Results 141 to 150 of about 828 (207)

Ordering Unicyclic Graphs in Terms of Their Smaller Least Eigenvalues

open access: yesJournal of Inequalities and Applications, 2010
Let be a simple graph with vertices, and let be the least eigenvalue of . The connected graphs in which the number of edges equals the number of vertices are called unicyclic graphs.
Xu Guang-Hui
doaj  

On tricyclic graphs with maximum atom-bond sum-connectivity index. [PDF]

open access: yesHeliyon
Noureen S   +5 more
europepmc   +1 more source

Home - About - Disclaimer - Privacy