Proof of conjectures on adjacency eigenvalues of graphs

DOI10.1016/J.DISC.2012.09.017MaRDI QIDQ1759806zbMATH OpenOpenAlexWikidataFDO

Authors Kinkar Ch. Das

Publication date 22 November 2012

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2012.09.017

zbMATH Keywords

adjacency matrixdeterminantdiametergirthfriendship graphaverage eccentricityadjacency eigenvalues

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Distance in graphs (05C12)

Recommendations

• Some eigenvalue properties in graphs (conjectures of Graffiti -- II)
• Graphs with the same determinant as a complete graph
• Spectra of eccentricity matrices of graphs
• On AGX conjectures regarding average eccentricity
• The graphs with all but two eigenvalues equal to \(\pm 1\)

Cited in

(22)

• The difference between remoteness and radius of a graph
• Proof of a conjecture involving the second largest \(D\)-eigenvalue and the number of triangles
• Monster graphs are determined by their Laplacian spectra
• On problems and conjectures on adjointly equivalent graphs
• Adjacency eigenvalues of graphs without short odd cycles
• Laplacian spectral determination of path-friendship graphs
• WEIGHT-DEPENDENT WALKS AND AVERAGE SHORTEST WEIGHTED PATH ON THE WEIGHTED ITERATED FRIENDSHIP GRAPHS
• On minimally 2-(edge)-connected graphs with extremal spectral radius
• Proof of a conjecture on `plateaux' phenomenon of graph Laplacian eigenvalues
• Connected graphs cospectral with a friendship graph
• When local and global clustering of networks diverge
• The spectral characterization of wind-wheel graphs
• Proof of conjectures involving algebraic connectivity of graphs
• Combinatorial and spectral properties of König-Egerváry graphs
• Comparison between Szeged indices of graphs
• The graphs with exactly two distance eigenvalues different from \(-1\) and \(-3\)
• On the spectral radius of bipartite graphs which are nearly complete
• Core-satellite graphs: clustering, assortativity and spectral properties
• Kite graphs determined by their spectra
• Proof of conjectures on remoteness and proximity in graphs
• Complete split graph determined by its (signless) Laplacian spectrum
• The graphs with all but two eigenvalues equal to \(\pm 1\)

This page was built for publication: Proof of conjectures on adjacency eigenvalues of graphs

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