Unicyclic reflexive graphs with seven loaded vertices of the cycle
نویسندگان
چکیده
منابع مشابه
On Unicyclic Reflexive Graphs
If G is a simple graph (a non-oriented graph without loops or multiple edges), its (0, 1)-adjacency matrix A is symmetric and roots of the characteristic polynomial PG (λ) = det (λI −A) (the eigenvalues of G, making up its spectrum) are all real numbers, for which we assume their non-increasing order: λ1 ≥ λ2 ≥ · · · ≥ λn. In a connected graph for the largest eigenvalue λ1 (the index of the gra...
متن کاملThe spectral radius of unicyclic and bicyclic graphs with n vertices and k pendant vertices
In this paper, we determine graphs with the largest spectral radius among all the unicyclic and all the bicyclic graphs with n vertices and k pendant vertices, respectively. © 2005 Elsevier Inc. All rights reserved. AMS classification: 05C50
متن کامل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...
متن کاملUnicyclic radially-maximal graphs on the minimum number of vertices
We characterize unicyclic, non-selfcentric, radially-maximal graphs on the minimum number of vertices. Such graphs must have radius r ≥ 5, and we prove that the number of these graphs is 1 48 r + O(r).
متن کامل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 ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Filomat
سال: 2009
ISSN: 0354-5180,2406-0933
DOI: 10.2298/fil0903257k