Results 171 to 180 of about 963 (204)
Some of the next articles are maybe not open access.
Linear Algebra and its Applications, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rodrigo O. Braga +2 more
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rodrigo O. Braga +2 more
openaire +1 more source
On broadcasting in unicyclic graphs
Journal of Combinatorial Optimization, 2008zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hovhannes A. Harutyunyan +1 more
openaire +1 more source
Graphs and Combinatorics, 1987
We study lexicographic ordering of unicyclic graphs by spectral moments as well as the ordering by the largest eigenvalue. If the length of the cycle is fixed, extremal graphs in the first ordering are obtained by attaching a star and a path to a cycle. For the other ordering minimal graphs are not known.
Dragos M. Cvetkovic, Peter Rowlinson
openaire +1 more source
We study lexicographic ordering of unicyclic graphs by spectral moments as well as the ordering by the largest eigenvalue. If the length of the cycle is fixed, extremal graphs in the first ordering are obtained by attaching a star and a path to a cycle. For the other ordering minimal graphs are not known.
Dragos M. Cvetkovic, Peter Rowlinson
openaire +1 more source
THE GUTMAN INDEX OF UNICYCLIC GRAPHS
Discrete Mathematics, Algorithms and Applications, 2012Let G be a connected graph with vertex set V(G). The Gutman index of G is defined as S(G) = ∑{u, v}⊆V(G) d(u)d(v)d(u, v), where d(u) is the degree of vertex u, and d(u, v) denotes the distance between u and v. In this paper, we characterize n-vertex unicyclic graphs with girth k, having minimal Gutman index.
openaire +2 more sources
Unicyclic Graphs with Minimal Energy
Journal of Mathematical Chemistry, 2001zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Degree Condition for Subdivisions of Unicyclic Graphs
Graphs and Combinatorics, 2008The authors prove the following results: Let \(H\) be any graph of order \(n\) with \(k\) vertex disjoint pieces \(H_1,\dots, H_k\), each of which contains at most one cycle. Let \(G\) be any graph of order at least \(n\) with \(\delta (G) \geq n -k \). Then \(G\) contains a cyclic subdivision of \(H\).
BABU, C, DIWAN, A
openaire +3 more sources
Trees and unicyclic graphs with hamiltonian path graphs
Journal of Graph Theory, 1990AbstractWe prove two conjectures of Broersma and Hoede about path graphs of trees and unicyclic graphs.
openaire +1 more source
The Mathematics Teacher, 1967
There are many results in mathematics that are both new and elementary. Graph theory, which abounds in theorems of this kind, is the source of an interesting self-contained example which we present in this article.
Sabra S. Anderson, Frank Harary
openaire +1 more source
There are many results in mathematics that are both new and elementary. Graph theory, which abounds in theorems of this kind, is the source of an interesting self-contained example which we present in this article.
Sabra S. Anderson, Frank Harary
openaire +1 more source
On the minimal matching energies of unicyclic graphs
Discrete Applied Mathematics, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jianming Zhu, Ju Yang
openaire +1 more source
Rumor source detection in unicyclic graphs
2017 IEEE Information Theory Workshop (ITW), 2017Detecting information source in viral spreading has important applications such as to root out the culprit of a rumor spreading in online social networks. In particular, given a snapshot observation of the network topology of nodes having the rumor, how to accurately identify the initial source of the spreading? In the seminal work [Shah et el.
Pei-Duo Yu +2 more
openaire +1 more source

