Journal
EUROPEAN JOURNAL OF COMBINATORICS
Volume 118, Issue -, Pages -Publisher
ACADEMIC PRESS LTD- ELSEVIER SCIENCE LTD
DOI: 10.1016/j.ejc.2023.103875
Keywords
-
Categories
Ask authors/readers for more resources
In this paper, a sharp upper bound for the spectral radius of an n-vertex F-minor-free graph is presented, and the graphs that achieve this bound are characterized. This result is of significant importance in the field of mathematics.
In this paper, we present a sharp upper bound for the spectral radius of an n-vertex F-minor-free graph for sufficiently large n, where F is obtained from the complete graph Kr by deleting disjoint paths. Furthermore, the graphs which achieve the sharp bound are characterized. This result may be regarded as a spectral extremal analogue of the number of edges in an n-vertex F-minor-free graph. (c) 2023 Elsevier Ltd. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available