On the nullity of graphs with pendent vertices
نویسندگان
چکیده
منابع مشابه
Ela on the Characterization of Graphs with Pendent Vertices and given Nullity∗
Let G be a graph with n vertices. The nullity of G, denoted by η(G), is the multiplicity of the eigenvalue zero in its spectrum. In this paper, we characterize the graphs (resp. bipartite graphs) with pendent vertices and nullity η, where 0 < η ≤ n. Moreover, the minimum (resp. maximum) number of edges for all (connected) graphs with pendent vertices and nullity η are determined, and the extrem...
متن کاملOn the characterization of graphs with pendent vertices and given nullity
Let G be a graph with n vertices. The nullity of G, denoted by η(G), is the multiplicity of the eigenvalue zero in its spectrum. In this paper, we characterize the graphs (resp. bipartite graphs) with pendent vertices and nullity η, where 0 < η ≤ n. Moreover, the minimum (resp. maximum) number of edges for all (connected) graphs with pendent vertices and nullity η are determined, and the extrem...
متن کاملOn the Laplacian Coefficients and Laplacian-Like Energy of Unicyclic Graphs with Vertices and Pendent Vertices
Copyright q 2012 X. Pai and S. Liu. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Let Φ G, λ det λIn − L G ∑n k 0 −1 ck G λn−k be the characteristic polynomial of the Laplacian matrix of a graph G of order n. In this paper, we g...
متن کاملThe spectral radius of tricyclic graphs with n vertices and k pendent vertices
In this paper, we determine graphs with the largest spectral radius among all the tricyclic graphs with n vertices and k pendent vertices. © 2008 Elsevier Inc. All rights reserved. AMS classification: 05C50; 05C35
متن کاملOn the spectral radii of quasi-tree graphs and quasi-unicyclic graphs with k pendent vertices
A connected graph G = (V, E) is called a quasi-tree graph if there exists a vertex u0 ∈ V (G) such that G−u0 is a tree. A connected graph G = (V, E) is called a quasi-unicyclic graph if there exists a vertex u0 ∈ V (G) such that G− u0 is a unicyclic graph. Set T (n, k) := {G : G is a n-vertex quasi-tree graph with k pendant vertices}, and T (n, d0, k) := {G : G ∈ T (n, k) and there is a vertex ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2008
ISSN: 0024-3795
DOI: 10.1016/j.laa.2008.04.037