Unicyclic graphs with given number of pendent vertices and minimal energy
نویسندگان
چکیده
منابع مشابه
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...
متن کاملOn Merrifield-Simmons index of unicyclic graphs with given girth and prescribed pendent vertices
For a graph G, the Merrifield-Simmons index i(G) is defined as the total number of independent sets of the graph G. Let G(n, l, k) be the class of unicyclic graphs on n vertices with girth and pendent vertices being resp. l and k. In this paper, we characterize the unique unicyclic graph possessing prescribed girth and pendent vertices with the maximal Merrifield-Simmons index among all graphs ...
متن کاملgraphs with fixed number of pendent vertices and minimal first zagreb index
the first zagreb index $m_1$ of a graph $g$ is equal to the sum of squaresof degrees of the vertices of $g$. goubko proved that for trees with $n_1$pendent vertices, $m_1 geq 9,n_1-16$. we show how this result can beextended to hold for any connected graph with cyclomatic number $gamma geq 0$.in addition, graphs with $n$ vertices, $n_1$ pendent vertices, cyclomaticnumber $gamma$, and minimal $m...
متن کامل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 ...
متن کاملMORE GRAPHS WHOSE ENERGY EXCEEDS THE NUMBER OF VERTICES
The energy E(G) of a graph G is equal to the sum of the absolute values of the eigenvalues of G. Several classes of graphs are known that satisfy the condition E(G) > n , where n is the number of vertices. We now show that the same property holds for (i) biregular graphs of degree a b , with q quadrangles, if q<= abn/4 and 5<=a < b = 0 (iii) triregular graphs of degree 1, a, b that are quadran...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2007
ISSN: 0024-3795
DOI: 10.1016/j.laa.2007.05.024