Connectivity and minimal distance spectral radius of graphs

DOI10.1080/03081087.2010.499512zbMATH Open1222.05184arXiv1011.2049OpenAlexW2015594362MaRDI QIDQ3090722FDOQ3090722

Authors: Xiaoling Zhang, Chris Godsil 

Publication date: 1 September 2011

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Abstract: In this paper, we study how the distance spectral radius behaves when the graph is perturbed by grafting edges. As applications, we also determine the graph with $k$ cut vertices (respectively, $k$ cut edges) with the minimal distance spectral radius.

Full work available at URL: https://arxiv.org/abs/1011.2049

Recommendations

• On graft transformations decreasing distance spectral radius of graphs
• Some graft transformations and its applications on the distance spectral radius of a graph
• A NOTE ON THE DISTANCE SPECTRAL RADIUS OF SOME GRAPHS
• Connectivity, diameter, independence number and the distance spectral radius of graphs
• Minimum distance spectral radius of graphs with given edge connectivity

zbMATH Keywords

distance spectral radiuspendant path

Mathematics Subject Classification ID

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

Cites Work

• A note on two problems in connexion with graphs
• On the distance matrix of a tree
• Distance matrix polynomials of trees
• The distance spectrum of the pathP_nand The First Distance Eigenvector of Connected Graphs
• New Bounds on the Complexity of the Shortest Path Problem

Cited In (32)

• Ordering trees by their distance spectral radii
• Graph transformation and distance spectral radius
• Connected hypergraphs with small spectral radius
• On the distance spectral radius of cacti
• Extremal unicyclic graphs with minimal distance spectral radius
• On graft transformations decreasing distance spectral radius of graphs
• On the maximal distance spectral radius of graphs without a pendent vertex
• Properties of connected graphs having minimum degree distance
• Maximal distance spectral radius of trees
• Minimum distance spectral radius of graphs with given edge connectivity
• On the spectral closeness and residual spectral closeness of graphs
• Maximal distance spectral radius of 4-chromatic planar graphs
• On the minimal distance spectral radius in the class of bicyclic graphs
• Distance spectra of graphs: a survey
• Distance spectral radius of unicyclic graphs with fixed maximum degree
• On the second largest distance eigenvalue of a block graph
• On the maximal distance spectral radius in a class of bicyclic graphs
• On the distance spectral radius of some graphs
• Title not available (Why is that?)
• On the least distance eigenvalues of the second power of a graph
• On the distance spectral radius of digraphs with given diameter
• On the \(D_\alpha\)-spectra of graphs
• Further results on the distance spectral radius of graphs
• On the distance spectral radius of trees
• Bounds on the distance signless Laplacian spectral radius in terms of clique number
• On the distance \(\alpha \)-spectral radius of a connected graph
• Spectral radius and \(k\)-connectedness of a graph
• Connectivity, diameter, independence number and the distance spectral radius of graphs
• A NOTE ON THE DISTANCE SPECTRAL RADIUS OF SOME GRAPHS
• Convex and quasiconvex functions on trees and their applications
• Some results on the distance and distance signless Laplacian spectral radius of graphs and digraphs
• Connectivity, graph minors, and subgraph multiplicity

This page was built for publication: Connectivity and minimal distance spectral radius of graphs

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