Finally, we prove a bound for graphs with hereditarily bounded average degree, and as a corollary, strengthen previous bounds for graphs embeddable on surfaces.The University of Chicago.Guiduli, Barry Danzero.The University of Chicago.Barry Guiduli: Spectral Extrema for Graphs. Ph. D. Thesis, ...
For n≥6.23×1018, we characterize the unique extremal graph with the maximum spectral radius among all 1-planar graphs of order n. Introduction Graphs in this paper are finite and undirected. A multi-graph allows parallel edges. Let G be a graph. The vertex set and edge set of G are ...
Spectral radius of graphs with given matching number Linear Algebra Appl. (2007) Y.X. Lan et al. The Turán number of star forests Appl. Math. Comput. (2019) S.C. Li et al. On Aα spectral extrema of graphs forbidding even cycles Linear Algebra Appl. (2023) V. Nikiforov Bounds on...
A spectral Erdos-Stone-Bollobas theorem a r X i v : 7 07 .2259v 3 [m a t h .C O ] 22 N o v 2007A spectral Erd˝o s-Stone-Bollob´a s theorem Vladimir Nikiforov Department of Mathematical Sciences,University of Memphis,Memphis,TN 38152email:vnikifrv@memphis.edu February ...
Spectral extrema of graphs: Forbidden hexagonPathCycleSpectral radiusAdjacency matrixHexagonTo determine the Turan numbers of even cycles is a central problem of extremal graph theory. Even for C-6, the Turan number is still open. Till now, the best known upper bound is given by Faredi, Naor...
As a continuance of it, in this contribution we consider the Brualdi-Hoffman-type problem for A-spectra of graphs with given matching number. We identify the graphs with given size and matching number having the largest A-spectral radius for ${\\alpha}{\\in}[{\\frac{1}{2}},1)$....
Spectral extremaCONJECTUREINDEXIn this paper, we study the relationship between spectral radius and maximum average degree of graphs. By using this relationship and the previous technique of Li and Ning in (J Graph Theory 103:486-492, 2023), we prove that, for any given positive number epsilon...
Spectral extrema of $K_{s,t}$-minor free graphs--On a conjecture of M. TaitHuiqiu LinMingqing Zhai
A strengthening of the spectral chromatic critical edge theorem: Books and theta graphsbookchromatic critical edge theoremconsecutive cyclesspectral extrematheta graphA graph is color‐critical if it contains an edge whose removal reduces its chromatic number. Let T n , k ${T}_{n,k}$ be the ...
Spectral extrema for graphs: the Zarankiewicz problem Electron. J. Comb. (2009) C.T. Benson Minimal regular graphs of girths eight and twelve Can. J. Math. (1966) A.E. Brouwer et al. Spectra of Graphs (2011) S. Cioabă et al. The spectral even cycle problem There are more refer...