scientific article
From MaRDI portal
Publication:3497917
zbMath1148.05306MaRDI QIDQ3497917
Pierre Hansen, Dragan Stevanović
Publication date: 28 May 2008
Full work available at URL: https://eudml.org/doc/129301
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (20)
Unnamed Item ⋮ On the spectral characterization of Kite graphs ⋮ On minimally 2-(edge)-connected graphs with extremal spectral radius ⋮ Sharp bounds on the \(A_{\alpha}\)-index of graphs in terms of the independence number ⋮ The smallest Laplacian spectral radius of graphs with a given clique number ⋮ 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 ⋮ Unnamed Item ⋮ Kite graphs determined by their spectra ⋮ Sharp bounds on the spectral radii of uniform hypergraphs concerning diameter or clique number ⋮ On the \(\alpha\)-index of graphs with pendent paths ⋮ On the \(A_\alpha\)-spectral radius of a graph ⋮ A survey of automated conjectures in spectral graph theory ⋮ Semiregular trees with minimal Laplacian spectral radius ⋮ Resolution of AutoGraphiX conjectures relating the index and matching number of graphs ⋮ On the spectral radius of block graphs having all their blocks of the same size ⋮ Extremal problems involving the two largest complementarity eigenvalues of a graph ⋮ Quotient of spectral radius, (signless) Laplacian spectral radius and clique number of graphs ⋮ The minimum spectral radius of graphs with a given independence number ⋮ The kite graph is determined by its adjacency spectrum
Uses Software
This page was built for publication:
