Extremal unicyclic graphs with minimal distance spectral radius

DOI10.7151/dmgt.1772zbMath1303.05092OpenAlexW2012302652MaRDI QIDQ472131

Zhongxun Zhu, Jing Luo, Hongyan Lu

Publication date: 18 November 2014

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1772

zbMATH Keywords

matchingunicyclic graphdistance matrixdistance spectral radius

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12)

Related Items

Connectivity, diameter, independence number and the distance spectral radius of graphs, ON THE SIZE, SPECTRAL RADIUS, DISTANCE SPECTRAL RADIUS AND FRACTIONAL MATCHINGS IN GRAPHS, Extremal cacti of given matching number with respect to the distance spectral radius, Perfect matching and distance spectral radius in graphs and bipartite graphs, Ordering trees by their distance spectral radii

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distance spectral radius of trees with given matching number
• Some graft transformations and its application on a distance spectrum
• Sharp bounds on the distance spectral radius and the distance energy of graphs
• On distance matrices and Laplacians
• Distance matrix and Laplacian of a tree with attached graphs
• Connectivity and minimal distance spectral radius of graphs
• Distance spectral radius of trees with fixed maximum degree
• On spectral radius of the distance matrix