The spectral radius of a planar graph[J].Linear Algebra and its Applications, 1993,187:251-257.D. Cao, A. Vince, The spectral radius of a planar graph, Linear Algebra Appl. 187 (1993) 251-257.Cao G, Vince A. T h e spectral radius of a planar graph. Linear Algebra Appl, 1993, ...
摘要: A decomposition result for planar graphs is used to prove that the spectral radius of a planar graph on n vertices is less than 4 + √ 3 (n 3). Moreover, the spectral radius of an outerplanar graph on n vertices is less than 1 + √2 + √2 + √n 5....
19 国际基础科学大会-Low moments of character sums-Adam James Harper 48:57 国际基础科学大会-Tilting theory revisited-Osamu Iyama 51:53 国际基础科学大会-The chromatic number of random graphs-Annika Heckel 46:10 国际基础科学大会-A Resolution of the Arrow Impossibility Theorem-Eric Maskin 1:07:06 ...
RADIUS WITH AN APPLICATION TO THE LONELY 1:10:35 MICHA SHARIR_ ELIMINATING DEPTH CYCLES AND ITS RELATIVES 1:30:58 MOTIVIC CHERN CLASSES OF COINCIDENT ROOT LOCI 1:08:37 OSCAR ORTEGA MORENO_ AN OPTIMAL PLANK PROBLEM 1:00:35 ZSOLT LÁNGI_ A SOLUTION TO SOME PROBLEMS OF CONWAY AND GUY ...
Upper bounds of the spectral radius of graphs in terms of genus
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-2}$ has the maximal signless Laplacian spectral radius among all planargraphs of order $n\\geq 456$....
L. Zhang Every planar graph with maximum degree 7 is of class 1 Graphs Combin., 16 (2000), pp. 467-495 View in ScopusGoogle Scholar Cited by (2) The spectral radius of edge chromatic critical graphs 2016, Linear Algebra and Its Applications Show abstract Graph Edge Coloring: A Survey 20...
Shu, J.L., Hong, Y.: The upper bound for the spectral radius of outerplanar graphs and Halin graphs. Chin. Ann. Math. Ser. A 21, 677–682 (2000) (in Chinese) Stanić, Z.: Inequalities for Graph Eigenvalues, London Mathematical Society Lecture Note Series, vol. 423. Cambridge Unive...
A coordinate system in which locations of points in space are expressed by reference to three mutually perpendicular planes, called coordinate planes. The three planes intersect in three straight lines called coordinate axes. See also coordinates. ...
A SYMPLECTIC RESTRICTION PROBLEM 59:07 ON BERNSTEIN'S PROOF OF THE MEROMORPHIC CONTINUATION OF EISENSTEIN SERIES - 副本 59:08 PETER HUMPHRIES_ NEWFORM THEORY FOR GL_N 1:15:19 SECOND MOMENT OF THE CENTRAL VALUES OF RANKIN-SELBERG L-FUNCTIONS 1:11:56 OLGA BALKANOVA_ SPECTRAL DECOMPOSITION ...