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, ...
Spectral extrema of {Kk+1, Ls}-free graphs 来自 国家科技图书文献中心 喜欢 0 阅读量: 2 作者:Y Zhai,X Yuan 摘要: For a set of graphs F, a graph is said to be F-free if it does not contain any graph in F as a subgraph. Let Exsp(n, F) denote the graphs with the maximum ...
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 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...
On spectral extrema of graphs with given order and generalized 4-independence number Characterize the extremal graphs having the maximum spectral radius in some given class of graphs.Establish a sharp lower bound on the generalized 4-indepe... S Li,Z Zhou - 《Applied Mathematics & Computation》 ...
Maxima of the signless Laplacian spectral radius for planar graphs The signless Laplacian spectral radius of a graph is the largest eigenvalueof its signless Laplacian. In this paper, we prove that the graph $K_{2}ablaP_{n... G Yu 被引量: 1发表: 2014年 Spectral extrema of 1-planar...
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...
Spectral extrema of $K_{s,t}$-minor free graphs--On a conjecture of M. Tait In\nthis paper, Tait's conjecture is completely solved. We also determine the\nmaximum spectral radius and its extremal graphs for $n$-vertex $K_{1,t}$-minor\nfree graphs. To prove our results, some spe...
Spectral extrema of $K_{s,t}$-minor free graphs--On a conjecture of M. TaitHuiqiu LinMingqing Zhai
Some typical spectral techniques are also used. This presents a probable way to characterize the uniqueness of extremal graphs for some of other spectral extremal problems. In the end, we mention several related conjectures.Zhai, MingqingZhengzhou UnivLiu, Ruifang...