A General Spectral Bound for Distant Vertex Subsets

DOI10.1017/S0963548302005448MaRDI QIDQ4796723zbMATH OpenFDO

Authors

Publication date 13 June 2003

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

zbMATH Keywords

graphdistance between vertex subsetsvertex subsets

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Extremal problems in graph theory (05C35) Distance in graphs (05C12)

Recommendations

• On the generalized distance spectrum of graphs
• The generalized distance spectrum of a graph and applications
• Sharp bounds on distance spectral radius of graphs
• Spectral distances in some sets of graphs
• Sharp upper bounds on the distance spectral radius of a graph
• Some new sharp bounds on the distance spectral radius of graph
• Some results on spectral distances of graphs
• Further results on the distance spectral radius of graphs
• On the distance spectra of graphs
• On the distance spectra of some graphs

This page was built for publication: A General Spectral Bound for Distant Vertex Subsets

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