Algebraic connectivity of connected graphs with fixed number of pendant vertices

DOI10.1007/S00373-010-0975-0MaRDI QIDQ659677zbMATH OpenOpenAlexFDO

Authors Arbind Kumar Lal, Kamal L. Patra, Binod K. Sahoo

Publication date 24 January 2012

Published in Graphs and Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

Laplacian matrixAlgebraic connectivityCharacteristic setPendant vertexPerron component

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Extremal problems in graph theory (05C35) Connectivity (05C40)

Abstract: In this paper we consider the following problem: Over the class of all simple connected graphs of order $n$ with $k$ pendant vertices ($n,k$ being fixed), which graph maximizes (respectively, minimizes) the algebraic connectivity? We also discuss the algebraic connectivity of unicyclic graphs.

Recommendations

• Maximizing Algebraic Connectivity Over Unicyclic Graphs
• Extremizing algebraic connectivity subject to graph theoretic constraints
• Minimizing algebraic connectivity over graphs made with some given blocks
• Algebraic connectivity of trees with the maximum degree
• The algebraic connectivity of graphs with given stability number

Cites work

• scientific article; zbMATH DE number 4114654 (Why is no real title available?)
• scientific article; zbMATH DE number 867649 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• scientific article; zbMATH DE number 3417498 (Why is no real title available?)
• A conjecture on the algebraic connectivity of connected graphs with fixed girth
• Algebraic connectivity and the characteristic set of a graph
• Characteristic vertices of trees^*
• Characteristic vertices of weighted trees via perron values
• Extremizing algebraic connectivity subject to graph theoretic constraints
• Laplacian matrices of graphs: A survey
• Maximizing Algebraic Connectivity Over Unicyclic Graphs
• Maximizing the distance between center, centroid and characteristic set of a tree
• Minimizing algebraic connectivity over connected graphs with fixed girth
• Perron components and algebraic connectivity for weighted graphs
• The Laplacian Spectrum of a Graph
• The effect on the algebraic connectivity of a tree by grafting or collapsing of edges
• The ordering of trees and connected graphs by algebraic connectivity

Cited in

(11)

• Ordering trees and graphs with few cycles by algebraic connectivity
• Minimizing algebraic connectivity over graphs made with some given blocks
• Algebraic connectivity of \(k\)-connected graphs.
• On the distance Laplacian spectra of graphs
• A conjecture on the algebraic connectivity of connected graphs with fixed girth
• Trees with matrix weights: Laplacian matrix and characteristic-like vertices
• The algebraic connectivity of barbell graphs
• The algebraic connectivity of graphs with given matching number
• On the spectral gap of a quantum graph
• Hamiltonian graphs of given order and minimum algebraic connectivity
• First eigenvalue of nonsingular mixed graphs with given number of pendant vertices

This page was built for publication: Algebraic connectivity of connected graphs with fixed number of pendant vertices

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