Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
A sharp upper bound of the spectral radius of graphs - MaRDI portal

A sharp upper bound of the spectral radius of graphs

From MaRDI portal
Publication:1850520

DOI10.1006/jctb.2000.1997zbMath1024.05059OpenAlexW2044344002MaRDI QIDQ1850520

Jin-Long Shu, Yuan Hong, Kun-fu Fang

Publication date: 10 December 2002

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.2000.1997




Related Items (87)

Improved sufficient conditions for \(k\)-leaf-connected graphsAn improvement of spectral conditions for Hamilton-connected graphsWhich non-regular bipartite integral graphs with maximum degree four do not have \(\pm 1\) as eigenvalues?A new upper bound for the spectral radius of graphs with girth at least 5Spectral characterization of multicone graphsTrees with small spectral gapUpper bounds on the spectral radius of book-free and/or \(K_{2,l}\)-free graphsBounds on graph eigenvalues. IExtremal problems on the Hamiltonicity of claw-free graphsEigenvalue problems of Nordhaus--Gaddum typeA note on eigenvalues of signed graphsBounds on the (Laplacian) spectral radius of graphsOn sufficient spectral radius conditions for HamiltonicitySome upper bounds on the spectral radius of a graphSpectral radius conditions for the rigidity of graphsSome bounds for total communicability of graphsSome sufficient conditions for graphs being \(k\)-leaf-connectedMaximizing the spectral radius of graphs with fixed minimum degree and edge connectivitySpectral radius and edge‐disjoint spanning treesSufficient spectral conditions for graphs being k-edge-Hamiltonian or k-HamiltonianThe spectral radius, maximum average degree and cycles of consecutive lengths of graphsSpectral characterization of the complete graph removing a cycleBounds for Aα-eigenvaluesOn sufficient spectral radius conditions for Hamiltonicity of \(k\)-connected graphsA note on the spectral characterization of strongly connected bicyclic digraphsA spectral extremal problem on non-bipartite triangle-free graphsBinding number, \(k\)-factor and spectral radius of graphsSpectral radius of digraphs with given dichromatic numberAn improvement of sufficient condition for \(k\)-leaf-connected graphsStability of Woodall's theorem and spectral conditions for large cyclesSpectral radius and degree sequence of a graphSharp bounds on the spectral radius of a nonnegative matrixToughness, Hamiltonicity and spectral radius in graphsA note on the bounds for the spectral radius of graphsSpectral radius and Hamiltonian graphsSharp upper bounds on the spectral radius of graphsUnnamed ItemTree-width, clique-minors, and eigenvalues.Unnamed ItemTHE SPECTRAL DETERMINATIONS OF THE JOIN OF TWO FRIENDSHIP GRAPHSSpectral radius and Hamiltonian properties of graphs, IISharp bounds for the spectral radius of nonnegative matricesVariable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graphOn the spectral radius of graphsSpectral extremal results with forbidding linear forestsAdjacency eigenvalues of graphs without short odd cyclesSpectral radius and \(k\)-connectedness of a graphOn the spectral determinations of the connected multicone graphsSufficient conditions for Hamiltonian graphs in terms of (signless Laplacian) spectral radiusThe spectral determination of the connected multicone graphsSpectral results on Hamiltonian problemThe spectral radius of graphs without paths and cycles of specified lengthSpectral radius of strongly connected digraphsSpectral analogues of Erdős' theorem on Hamilton-connected graphsOn some properties of graph irregularity indices with a particular regard to the \(\sigma \)-indexSpectral radius and Hamiltonicity of graphsOn the two largest \(Q\)-eigenvalues of graphsSpectral conditions for graphs to be \(k\)-Hamiltonian or \(k\)-path-coverableA note on spectral radius and degree deviation in graphsThe Nordhaus-Gaddum type inequalities of \(A_\alpha \)-matrixOn an upper bound of the spectral radius of graphsSome algebraic properties of a class of integral graphs determined by their spectrumRemarks on Spectral Radius and Laplacian Eigenvalues of a GraphSpectral radius and traceability of graphs with large minimum degreeConnected graphs cospectral with a friendship graphA new result on spectral radius and maximum degree of irregular graphsA note on spectral radius and maximum degree of irregular graphsOpen problems on graph eigenvalues studied with AutoGraphiXSufficient spectral radius conditions for Hamilton-connectivity of \(k\)-connected graphsUnnamed ItemSufficient conditions for Hamilton-connected graphs in terms of (signless Laplacian) spectral radiusSharp upper bounds of the spectral radius of a graphSpectral radius and Hamiltonian properties of graphsSpectral radius and Hamiltonicity of graphs with large minimum degreeThe minimum spectral radius of graphs with a given independence numberEigenvalues of thek-th power of a graphSome new bounds on the spectral radius of graphsBounds of eigenvalues of \(K_{3,3}\)-minor free graphsEigenvalues and triangles in graphsThe maximum spectral radius of non-bipartite graphs forbidding short odd cyclesSpectral radius of bipartite graphsUnnamed ItemGRAPHS WITH SMALL INDEPENDENCE NUMBER MINIMIZING THE SPECTRAL RADIUSSpectral and extremal conditions for supereulerian graphsProof of a conjecture on the spectral radius condition for \([a,b\)-factors] ⋮ Spectral condition for Hamiltonicity of a graphA sharp upper bound on the largest eigenvalue of the Laplacian matrix of a graph



Cites Work




This page was built for publication: A sharp upper bound of the spectral radius of graphs