The maximum spectral radius of wheel-free graphs
نویسندگان
چکیده
A wheel graph is a formed by connecting single vertex to all vertices of cycle. called wheel-free if it does not contain any as subgraph. In 2010, Nikiforov proposed Brualdi–Solheid–Turán type problem: what the maximum spectral radius order n that subgraphs particular kind. this paper, we study problem for graphs, and determine (signless Laplacian) n. Furthermore, characterize extremal graphs.
منابع مشابه
The spectral radius of triangle-free graphs
In this note, we present two lower bounds for the spectral radius of the Laplacian matrices of triangle-free graphs. One is in terms of the numbers of edges and vertices of graphs, and the other is in terms of degrees and average 2-degrees of vertices. We also obtain some other related results.
متن کاملThe Spectral Radius and the Maximum Degree of Irregular Graphs
Let G be an irregular graph on n vertices with maximum degree ∆ and diameter D. We show that ∆ − λ1 > 1 nD , where λ1 is the largest eigenvalue of the adjacency matrix of G. We also study the effect of adding or removing few edges on the spectral radius of a regular graph. 1 Preliminaries Our graph notation is standard (see West [22]). For a graph G, we denote by λi(G) the i-th largest eigenval...
متن کاملThe maximum spectral radius of C4-free graphs of given order and size
Suppose that G is a graph with n vertices and m edges, and let be the spectral radius of its adjacency matrix. Recently we showed that if G has no 4-cycle, then 2 n 1; with equality if and only if G is the friendship graph. Here we prove that if m 9 and G has no 4-cycle, then 2 m; with equality if G is a star. For 4 m 8 this assertion fails. Keywords: 4-cycles; graph spectral radius; graphs wit...
متن کاملSpectral radius and maximum degree of connected graphs
Given a connected irregular graph G of order n, write μ for the largest eigenvalue of its adjacency matrix, ∆ for its maximum degree, andD for its diameter. We prove that ∆− μ > 1 (D + 2)n and this bound is tight up to a constant factor. This improves previous results of Stevanović and Zhang, and extends a result of Alon and Sudakov.
متن کاملSpectral Radius and Traceability of Connected Claw-Free Graphs
Let G be a connected claw-free graph on n vertices and G be its complement. Let μ(G) be the spectral radius of G. Denote by Nn−3,3 the graph consisting of Kn−3 and three disjoint pendent edges. In this note we prove that: (1) If μ(G) ≥ n − 4, then G is traceable unless G = Nn−3,3. (2) If μ(G) ≤ μ(Nn−3,3) and n ≥ 24, then G is traceable unless G = Nn−3,3. Our works are counterparts on claw-free ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2021
ISSN: ['1872-681X', '0012-365X']
DOI: https://doi.org/10.1016/j.disc.2021.112341