A note on connected bipartite graphs of fixed order and size with maximal index

DOI10.1016/j.laa.2015.05.013zbMath1327.05218OpenAlexW574656419MaRDI QIDQ490874

Miroslav M. Petrović, Slobodan K. Simic

Publication date: 21 August 2015

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2015.05.013

zbMATH Keywords

adjacency matrixlargest eigenvaluegraph spectrumbipartite chain graphsdouble nested graphs

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (5)

Maximize the \(Q\)-index of graphs with fixed order and size ⋮ Some spectral inequalities for connected bipartite graphs with maximum \(A_\alpha\)-index ⋮ On the Laplacian spectral radius of bipartite graphs with fixed order and size ⋮ An extremal problem on Q-spectral radii of graphs with given size and matching number ⋮ Some bounds on the A_α-index of connected graphs with fixed order and size

Cites Work

• Minimizing the least eigenvalue of graphs with fixed order and size
• Some new considerations about double nested graphs
• Further results on the least eigenvalue of connected graphs
• On bounds for the index of double nested graphs
• Graphs for which the least eigenvalue is minimal. I
• Graphs for which the least eigenvalue is minimal. II.
• Bicyclic graphs for which the least eigenvalue is minimum
• On the first eigenvalue of bipartite graphs
• On the largest eigenvalues of bipartite graphs which are nearly complete
• On the maximal index of graphs with a prescribed number of edges
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on connected bipartite graphs of fixed order and size with maximal index