scientific article; zbMATH DE number 5280010

MaRDI QIDQ3497917zbMATH OpenFDO

Authors Dragan Stevanović, Pierre Hansen

Publication date 28 May 2008

Full work available at URL https://eudml.org/doc/129301, http://www.math.technion.ac.il/iic/ela/toc/17.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

adjacency matrixclique numberkite graphlargest eigenvaluespectral radius

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• The smallest Laplacian spectral radius of graphs with a given clique number
• The minimum spectral radius of signless Laplacian of graphs with a given clique number
• The minimum spectral radius of graphs with a given domination number
• The minimal spectral radius of graphs with a given diameter
• The minimum spectral radius of graphs with a given independence number
• The smallest signless Laplacian spectral radius of graphs with a given clique number
• The minimum spectral radius of \(K_{r + 1}\)-saturated graphs
• Clique number and distance spectral radii of graphs.
• Graphs with diameter \(n - e\) minimizing the spectral radius
• Spectral radius and clique partitions of graphs

Cited in

(28)

• The minimum spectral radius of graphs with a given independence number
• Kite graphs determined by their spectra
• On the \(\alpha\)-index of graphs with pendent paths
• On the \(A_\alpha\)-spectral radius of a graph
• On the spectral radius of block graphs having all their blocks of the same size
• The spectral radius and \({\mathcal{P}}_{\ge \ell}\)-factors of graphs involving minimum degree
• Sharp bounds on the spectral radii of uniform hypergraphs concerning diameter or clique number
• Extremal problems involving the two largest complementarity eigenvalues of a graph
• The kite graph is determined by its adjacency spectrum
• On minimally 2-(edge)-connected graphs with extremal spectral radius
• The smallest signless Laplacian spectral radius of graphs with a given clique number
• The minimum spectral radius of signless Laplacian of graphs with a given clique number
• The rate of growth of the minimum clique size of graphs of given order and chromatic number
• Quotient of spectral radius, (signless) Laplacian spectral radius and clique number of graphs.
• The smallest Laplacian spectral radius of graphs with a given clique number
• The number of maximal cliques and spectral radius of graphs with certain forbidden subgraphs
• Extremal octagonal chains with respect to the spectral radius
• On the Geršgorin disks of distance matrices of graphs
• On the spectral characterization of kite graphs
• Graphs with small spectral gap
• The maximum principal ratio of graphs
• Sharp bounds on the \(A_{\alpha}\)-index of graphs in terms of the independence number
• Variable neighbourhood search for connected graphs of fixed order and size with minimal spectral radius
• The Li-Feng transformation of weighted adjacency matrices for graphs with degree-based edge-weights
• Resolution of AutoGraphiX conjectures relating the index and matching number of graphs
• The A_ spectral radius of graphs with given independence number n-4
• A survey of automated conjectures in spectral graph theory
• Semiregular trees with minimal Laplacian spectral radius

Describes a project that uses

Uses Software

• AutoGraphiX

This page was built for publication:

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