On spectral extrema of graphs with given order and dissociation number

DOI10.1016/j.dam.2023.10.001OpenAlexW4387630184MaRDI QIDQ6184344

Shuchao Li, Unnamed Author, Xianya Geng, Zihan Zhou

Publication date: 24 January 2024

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2023.10.001

zbMATH Keywords

treebipartite graphspectral radiusdissociation number

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The sharp lower bound for the spectral radius of connected graphs with the independence number
• On the spectral radius of trees with given independence number
• The minimum spectral radius of graphs with a given independence number
• The spectral radius of trees on \(k\) pendant vertices
• The spectral radius of graphs with given independence number
• On the spectral radius of bi-block graphs with given independence number \(\alpha\)
• The complexity of dissociation set problems in graphs
• NP-hard graph problems and boundary classes of graphs
• Independent packings in structured graphs
• GRAPHS WITH SMALL INDEPENDENCE NUMBER MINIMIZING THE SPECTRAL RADIUS
• On the Spectral Radius of Complementary Acyclic Matrices of Zeros and Ones
• Node-Deletion Problems on Bipartite Graphs
• The complexity of restricted spanning tree problems
• The maximum number of maximum dissociation sets in trees
• On the maximal number of maximum dissociation sets in forests with fixed order and dissociation number

This page was built for publication: On spectral extrema of graphs with given order and dissociation number