Distance spectral radius and Hamiltonicity of a graph
نویسندگان
چکیده
In recent years, the eigenvalues of distance matrix a graph have attracted lot attention mathematicians, since there is close connection between its spectrum and structural properties graph. Thus, quite recently an interesting result was obtained, relating Hamiltonicity to spectral radius graph, on basis which more general conjecture about formulated. We confirm this put forward for k -connected when Î{2;3}, also establish similar sufficient conditions traceability Î{1; 2}.
منابع مشابه
Spectral radius and Hamiltonicity of graphs with large minimum degree
We extend some recent results on sufficient conditions for Hamiltonian paths and cycles in G. Let G be a graph of order n and λ (G) be the spectral radius of its adjacency matrix. One of the main results of the paper is the following theorem: Let k 2, n k3 + k + 4, and let G be a graph of order n, with minimum degree δ (G) k. If λ (G) n k 1, then G has a Hamiltonian cycle, unless G = K1 _ (Kn k...
متن کاملThe Spectral Radius of A Planar Graph
A decomposition result for planar graphs is used to prove that the spectral radius of a planar graph on n vertices is less than 4 + 3(n 3) Moreover, the spectral radius of an outerplanar graph on n vertices is less than 1 + JZ+&-X
متن کاملOn Complementary Distance Signless Laplacian Spectral Radius and Energy of Graphs
Let $D$ be a diameter and $d_G(v_i, v_j)$ be the distance between the vertices $v_i$ and $v_j$ of a connected graph $G$. The complementary distance signless Laplacian matrix of a graph $G$ is $CDL^+(G)=[c_{ij}]$ in which $c_{ij}=1+D-d_G(v_i, v_j)$ if $ineq j$ and $c_{ii}=sum_{j=1}^{n}(1+D-d_G(v_i, v_j))$. The complementary transmission $CT_G(v)$ of a vertex $v$ is defined as $CT_G(v)=sum_{u in ...
متن کاملAverage distance , radius and remoteness of a graph ∗
Let G = (V,E) be a connected graph on n vertices. Denote by l̄(G) the average distance between all pairs of vertices in G. The remoteness ρ(G) of a connected graph G is the maximum average distance from a vertex of G to all others. The aim of this paper is to show that two conjectures in [5] concerned with average distance, radius and remoteness of a graph are true.
متن کاملSpectral Radius and Degree Sequence of a Graph
Let G be a simple connected graph of order n with degree sequence d1, d2, · · · , dn in non-increasing order. The spectral radius ρ(G) of G is the largest eigenvalue of its adjacency matrix. For each positive integer ` at most n, we give a sharp upper bound for ρ(G) by a function of d1, d2, · · · , d`, which generalizes a series of previous results.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Vescì Nacyânal?naj akadèmìì navuk Belarusì
سال: 2023
ISSN: ['1814-6023', '2524-2350']
DOI: https://doi.org/10.29235/1561-2430-2023-59-1-62-70