Graphs with small independence number minimizing the spectral radius

DOI10.1142/S1793830913500171MaRDI QIDQ2864859zbMATH OpenFDO

Authors Xue Du, Lingsheng Shi

Publication date 26 November 2013

Published in Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S1793830913500171

zbMATH Keywords

cliqueindependence numberspectral radius

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• The minimum spectral radius of graphs with a given independence number
• The minimum signless Laplacian spectral radius of graphs with given independence number
• The spectral radius of graphs with given independence number
• Maximum spectral radius of graphs with given connectivity, minimum degree and independence number
• The sharp lower bound for the spectral radius of connected graphs with the independence number

Cites work

• A sharp upper bound of the spectral radius of graphs
• Bounds on graph eigenvalues. II
• Laplacian spectral bounds for clique and independence numbers of graphs
• Minimizing the Laplacian spectral radius of trees with given matching number
• Spectral bounds for the clique and independence numbers of graphs
• Spektren endlicher Grafen
• The minimum spectral radius of graphs with a given independence number
• The spectral radius of trees on \(k\) pendant vertices

Cited in

(21)

• The minimum spectral radius of graphs with a given independence number
• Semi-regular graphs of minimum independence number
• A characterization of graphs where the independence number equals the radius
• Packing triangles in \(K_4\)-free graphs
• Maximum spectral radius of graphs with given connectivity, minimum degree and independence number
• On the spectral radius of block graphs having all their blocks of the same size
• The spectral radius of graphs with given independence number
• The bounds of spectral radius of graphs with a given size of independent set.
• The sharp lower bound for the spectral radius of connected graphs with the independence number
• The Q-minimizer graph with given independence number
• On spectral extrema of graphs with given order and dissociation number
• The minimal spectral radius with given independence number
• Independence number and spectral radius of cactus graphs
• Graphs with the minimum spectral radius for given independence number
• On the minimum spectral radius of graphs with given order and dissociation number
• On the -index of minimally k-(edge-)connected graphs for small k
• On spectral extrema of graphs with given order and generalized 4-independence number
• The minimum signless Laplacian spectral radius of graphs with given independence number
• Domination number, independent number and minimum spectral radius in unicyclic graphs
• Minimal spectral radius of graphs with given matching number
• On the spectral radius of trees with given independence number

This page was built for publication: Graphs with small independence number minimizing the spectral radius

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2864859)