Advanced search
Publication Cover
Linear and Multilinear Algebra Volume 59, 2011 - Issue 7
Submit an article Journal homepage
278
Views
24
CrossRef citations to date
0
Altmetric
Original Articles

Connectivity and minimal distance spectral radius of graphs

Xiaoling Zhang Department of Combinatorics and Optimisation, University of Waterloo, Waterloo, ON, N2L 3G1, Canada; School of Mathematics and Statistics, Lanzhou University, Lanzhou, Gansu 730000, P.R. ChinaCorrespondence[email protected]
&
Chris Godsil Department of Combinatorics and Optimisation, University of Waterloo, Waterloo, ON, N2L 3G1, Canada
Pages 745-754 | Received 15 Dec 2009, Accepted 04 Jun 2010, Published online: 14 Apr 2011
 
Sample our Mathematics & Statistics journals, sign in here to start your FREE access for 14 days

Abstract

In this article, 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.

AMS Subject Classifications:

Acknowledgments

This article was finished when the author X. Zhang was a visiting PhD student in the Department of Combinatorics and Optimisation at the University of Waterloo from September 2008 to September 2009. X. Zhang is partially supported by NSFC grant no. 10831001.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related Research Data

Distance Matrix Polynomials of Trees
Source: Published by Elsevier Inc.
On the distance matrix of a tree
Source: Published by Elsevier B.V.
On the Dα-spectra of graphs
Source: Informa UK Limited
Topological indices and real number vertex invariants based on graph eigenvalues or eigenvectors
Source: American Chemical Society (ACS)
FW-PSO Algorithm to Enhance the Invulnerability of Industrial Wireless Sensor Networks Topology.
Source: MDPI AG
On the distance spectral radius of digraphs with given diameter
Source: Informa UK Limited
New Bounds on the Complexity of the Shortest Path Problem
Source: Society for Industrial & Applied Mathematics (SIAM)
On the addressing problem for loop switching
Source: Institute of Electrical and Electronics Engineers (IEEE)
Distance spectral radius of unicyclic graphs with fixed maximum degree
Source: World Scientific Pub Co Pte Lt
The distance spectrum of the path Pn and The First Distance Eigenvector of Connected Graphs
Source: Informa UK Limited

Linking provided by 

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.