In this paper we consider the extremal problem on adjacency spectral radius of -free graphs. Assume that G is a graph with m edges having no isolated vertices.
In this paper we consider the extremal problem on adjacency spectral radius of { C 3 , C 5 } -free graphs. Assume that G is a graph with m edges having no ...
Li [26] showed that if G is a non-bipartite {C 3 , C 5 }-free graphs of given size m, then λ(G) 4 u∈V G d 2 u − m + 4q + 5, equality holds if and only if G ...
Semantic Scholar extracted view of "The maximum spectral radius of {C3,C5}-free graphs of given size" by Wanting Sun et al.
Sep 16, 2022 · Maximizing the number of edges over all F-free graphs with n vertices is a classical problem in graph theory. Basing on this, Nikiforov [11] ...
The maximum spectral radius of {C3,C5}-free graphs of given size. https://doi.org/10.1016/j.disc.2023.113440. Journal: Discrete Mathematics, 2023, № 7, p ...
Dec 9, 2022 · If G is {C3,C5}-free and G is non-bipartite, then ρ(G) ⩽ γ(m) ... Nikiforov, The maximum spectral radius of C4-free graphs of given order and size,.
Sep 24, 2024 · Our first main result determines the largest spectral radius of F2k+2-free graph of size m for k ⩾ 3 and the corresponding extremal graph is ...
Oct 22, 2024 · Moreover, the C △ 4 -free or C △ 5 -free spectral extremal graphs are determined in [43] for odd m, and subsequently in [9, 26] for even m. In ...
People also ask
What is the spectral radius of a graph?
Which vertex of the given graph is a center?
What is the spectral radius limit?
What is a bipartite graph in graph theory?
May 8, 2022 · In this section, we will prove a refinement on Theorem 6. To be more specific, we will determine the largest spectral radius for C3-free and C5- ...