Article

# Algebraic Connectivity of Connected Graphs with Fixed Number of Pendant Vertices

Graphs and Combinatorics (Impact Factor: 0.35). 01/2011; 27(2):215-229. DOI:10.1007/s00373-010-0975-0
Source: DBLP

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.

KeywordsLaplacian matrix–Algebraic connectivity–Characteristic set–Perron component–Pendant vertex

0 0
·
0 Bookmarks
·
118 Views
• ##### Article: Algebraic connectivity and the characteristic set of a graph
[hide abstract]
ABSTRACT: Let Gbe a connected weighted graph on vertices {1,2,…,n} and L be the Laplacian matrix of GLet μ be the second smallest eigenvalue of L and Y be an eigenvector corresponding to μ. A characteristic vertex is a vertex v such that Y(v) = 0 and Y(w) ≠ 0 for some vertex w adjacent to v. An edge e with end vertices v,w is called a characteristic edge of G if Y(w) Y(v) < 0. The characteristic vertices and the characteristic edges together form the characteristic set of G. We investigate the characteristic set of an arbitrary graph. The relation between the characteristic set and nonnegative matrix theory is exploited. Bounds are obtained on the cardinality of the characteristic set. It is shown that if G is a connected graph with n vertices and m edges then the characteristic set has at most m − n + 2 elements. We use the description of the Moore-Penrose inverse of the vertex-edge incidence matrix of a tree to derive a classical result of Fiedler for a tree. Furthermore, an analogous result is obtained for an eigenvector corresponding to any eigenvalue. We obtain a formula for the Moore-Penrose inverse of the incidence matrix of a unicyclic graph and give a complete description of characteristic vectors of a unicyclic graph. It is shown that the coordinates of a characteristic vector are unimodal along the cycle in the unicyclic graph if we begin with a vertex corresponding to the smallest coordinate.
Linear and Multilinear Algebra 12/1998; 45(2-3):247-273. · 0.68 Impact Factor
• ##### Article: Maximizing Algebraic Connectivity Over Unicyclic Graphs
[hide abstract]
ABSTRACT: We consider the class of unicyclic graphs on n vertices with girth g, and over that class, we attempt to determine which graph maximizes the algebraic connectivity. When g is fixed, we show that there is an N such that for each n>N, the maximizing graph consists of a g cycle with n−g pendant vertices adjacent to a common vertex on the cycle. We also provide a bound on N. On the other hand, when g is large relative to n, we show that this graph does not maximize the algebraic connectivity, and we give a partial discussion of the nature of the maximizing graph in that situation.
Linear and Multilinear Algebra 09/2003; 51(3):221-241. · 0.68 Impact Factor
• ##### Article: Algebraic Connectivity of Graphs
[hide abstract]
ABSTRACT: Seminal paper on algebraic connectivity of a network
Czechoslovak Mathematical Journal 01/1973; 23(98):298-305. · 0.30 Impact Factor