The spread of the unicyclic graphs
نویسندگان
چکیده
منابع مشابه
The spread of the unicyclic graphs
Let G be a simple connected graph with n vertices and n edges which we call an unicyclic graph. In this paper, we first investigate the least eigenvalue λn(G), then we present two sharp bounds of the spread s(G) of G. AMS classification: 05C50 ,05C35
متن کاملOn the Laplacian Spread of Trees and Unicyclic Graphs
In this paper, we determine the four trees (resp. the three unicyclic graphs), which share the second to fifth (resp. the second to fourth) largest Laplacian spreads among all the trees (resp. connected unicyclic graphs) on n ≥ 10 (respectively n ≥ 17) vertices.
متن کاملOn the Eccentric Connectivity Index of Unicyclic Graphs
In this paper, we obtain the upper and lower bounds on the eccen- tricity connectivity index of unicyclic graphs with perfect matchings. Also we give some lower bounds on the eccentric connectivity index of unicyclic graphs with given matching numbers.
متن کاملThe Signless Laplacian Estrada Index of Unicyclic Graphs
For a simple graph $G$, the signless Laplacian Estrada index is defined as $SLEE(G)=sum^{n}_{i=1}e^{q^{}_i}$, where $q^{}_1, q^{}_2, dots, q^{}_n$ are the eigenvalues of the signless Laplacian matrix of $G$. In this paper, we first characterize the unicyclic graphs with the first two largest and smallest $SLEE$'s and then determine the unique unicyclic graph with maximum $SLEE$ a...
متن کاملThe Hyper-Zagreb Index of Trees and Unicyclic Graphs
Topological indices are widely used as mathematical tools to analyze different types of graphs emerged in a broad range of applications. The Hyper-Zagreb index (HM) is an important tool because it integrates the first two Zagreb indices. In this paper, we characterize the trees and unicyclic graphs with the first four and first eight greatest HM-value, respectively.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2010
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2009.03.043