On the spectral radius of graphs with cut vertices

From MaRDI portal
Publication:1850564

DOI10.1006/jctb.2001.2052zbMath1023.05098OpenAlexW2121529848MaRDI QIDQ1850564

Abraham Berman, Xiao Dong Zhang

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.2001.2052




Related Items (86)

Characterization of the minimizing graph of the connected graphs whose complements are bicyclicEigenvalues and degree deviation in graphsOn the zero forcing number and spectral radius of graphsCombinatorial methods for the spectral \(p\)-norm of hypermatricesSharp bounds for the signless Laplacian spectral radius of digraphsA note on upper bounds for the spectral radius of weighted graphsBounds for the (Laplacian) spectral radius of graphs with parameter αA new upper bound for the spectral radius of graphs with girth at least 5On the spectral radius of graphs with cut edgesOn the spectral radius of graphs with connectivity at most \(k\)Generalizing theorems of Nosal and Nikiforov: triangles and quadrilateralsOn the spectral radius of bipartite graphs which are nearly completeWalks and the spectral radius of graphsOn the spectral radius of unicyclic graphs with fixed diameterUpper bounds on the spectral radius of book-free and/or \(K_{2,l}\)-free graphsThe spectral radii of a graph and its line graphOn the spectral radius of bicyclic graphs with \(n\) vertices and diameter \(d\)Spectral radius of graphs with given matching numberA bound on the spectral radius of graphs in terms of their Zagreb indicesSome upper bounds on the spectral radius of a graphSome bounds for total communicability of graphsOn spectral radius of graphs with pendant pathsDisproof of a conjecture on the minimum spectral radius and the domination numberOn the \(\alpha\)-index of minimally 2-connected graphs with given order or sizeSpectral analogues of Erdős’ and Moon–Moser’s theorems on Hamilton cyclesA Spectral Erdős-Sós TheoremMaximizing the spectral radius of graphs with fixed minimum degree and edge connectivityOn minimally 2-(edge)-connected graphs with extremal spectral radiusThe extremal spectral radius of generalized block graphsThe matchings and spectral radius of graphs involving minimum degreeOn the spectral radius of tricyclic graphs with a maximum matchingThe minimum spectral radius of graphs with a given domination numberSharp bounds on the \(A_{\alpha}\)-index of graphs in terms of the independence numberBounds on the eigenvalues of graphs with cut vertices or edgesSpectral Turán problems for intersecting even cyclesThe new upper bounds on the spectral radius of weighted graphsThe maximum spectral radius of graphs without friendship subgraphsSpectral radius and Hamiltonian graphsExtremal Zagreb indices of graphs with a given number of cut edgesUnnamed ItemThe spectral radius of tricyclic graphs with \(n\) vertices and \(k\) pendent verticesOn the spectral radius of quasi-tree graphsOn graphs with cut vertices and cut edgesA sharp upper bound on the spectral radius of weighted graphsOn the (signless Laplacian) spectral radius of minimally \(k\)-(edge)-connected graphs for small \(k\)Sharp upper and lower bounds for the Laplacian spectral radius and the spectral radius of graphsThe signless Laplacian or adjacency spectral radius of bicyclic graphs with given number of cut edgesSpectral conditions for graphs to be β-deficient involving minimum degreeThe spectral radius of graphs with no odd wheelsSpectral analogues of Moon-Moser's theorem on Hamilton paths in bipartite graphsUpper and lower bounds for the \(q\)-entropy of network models with application to network model selectionSpectral radius and \(k\)-connectedness of a graphOrdering graphs with cut edges by their spectral radiiOn the irregularity of uniform hypergraphsSpectral conditions for some graphical propertiesOn the spectral radius of graphs with a given domination numberThe least eigenvalue of a graph with a given domination numberOn bags and bugsExtremal graph characterization from the bounds of the spectral radius of weighted graphsCertain classes of complementary equienergetic graphsBound on the least eigenvalue of a graph with cut verticesSharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of treesThe least eigenvalue of a graph with cut verticesConjectures on index and algebraic connectivity of graphsMaximum spectral radius of graphs with given connectivity, minimum degree and independence numberOn the maximum Zagreb indices of graphs with \(k\) cut verticesProof and disproof of conjectures on spectral radii of coclique extension of cycles and pathsOn the signless Laplacian spectral radius of graphs with cut verticesMaximizing signless Laplacian or adjacency spectral radius of graphs subject to fixed connectivityA note on the \(A_{\alpha}\)-spectral radius of graphsThe least eigenvalue of graphs with given connectivityOn the spectral radius of tricyclic graphs with a fixed diameterSPECTRAL RADII OF UNICYCLIC GRAPHS WITH FIXED NUMBER OF CUT VERTICESMaximizing the signless Laplacian spectral radius of graphs with given diameter or cut verticesMaximizing the spectral radius of bicyclic graphs with fixed girthEigenvalues of thek-th power of a graphOn the two conjectures of GraffitiSome new bounds on the spectral radius of graphsThe maximum spectral radius of \(t\)-connected graphs with bounded matching numberThe spectral radius of unicyclic and bicyclic graphs with \(n\) vertices and \(k\) pendant verticesOn the minimal \(\mathcal{D}_\alpha -\) spectral radius of graphs subject to fixed connectivityThe maximum spectral radius of non-bipartite graphs forbidding short odd cyclesSpectral radius of bipartite graphsUnnamed ItemBounds on the spectral radii of digraphs in terms of walksThe maximal Aα-spectral radius of graphs with given matching number



Cites Work


This page was built for publication: On the spectral radius of graphs with cut vertices