On the spectral radius of graphs with cut edges

From MaRDI portal
Publication:1887612

DOI10.1016/j.laa.2004.03.026zbMath1053.05080OpenAlexW2144471006MaRDI QIDQ1887612

Huiqing Liu, Mei Lu, Feng Tian

Publication date: 22 November 2004

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2004.03.026




Related Items (52)

The spanning k-trees, perfect matchings and spectral radius of graphsOn the spectral radius of graphs with connectivity at most \(k\)Spectral radius and \([a,b\)-factors in graphs] ⋮ Maximizing and minimizing multiplicative Zagreb indices of graphs subject to given number of cut edgesOn the \(A_\sigma\)-spectral radii of graphs with some given parametersOn the spectral radius of unicyclic graphs with fixed diameterOn the spectral radius of bicyclic graphs with \(n\) vertices and diameter \(d\)Spectral radius of graphs with given matching numberThe least eigenvalue of graphs with cut edgesUnnamed ItemMaximizing the spectral radius of graphs with fixed minimum degree and edge connectivitySpectral radius and edge‐disjoint spanning treesOn minimally 2-(edge)-connected graphs with extremal spectral radiusThe matchings and spectral radius of graphs involving minimum degreeOn the spectral radius of tricyclic graphs with a maximum matchingBounds on the eigenvalues of graphs with cut vertices or edgesBinding number, \(k\)-factor and spectral radius of graphsMatching extension and matching exclusion via the size or the spectral radius of graphsSpectral radius and Hamiltonian graphsExtremal Zagreb indices of graphs with a given number of cut edgesThe 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 edgesSums of powers of the degrees of graphs with \(k\) cut edgesThe effect on the adjacency and signless Laplacian spectral radii of uniform hypergraphs by grafting edgesOn the spectral radius of block graphs with prescribed independence number \(\alpha\)The signless Laplacian or adjacency spectral radius of bicyclic graphs with given number of cut edgesOn the spectral radius of bi-block graphs with given independence number \(\alpha\)Eccentric adjacency index of graphs with a given number of cut edgesOrdering graphs with cut edges by their spectral radiiThe Laplacian spectral radius of some bipartite graphsThe least eigenvalue of a graph with a given domination numberOn the extremal Zagreb indices of graphs with cut edgesBound on the least eigenvalue of a graph with cut verticesOn the spectral radius of quasi-\(k\)-cyclic graphsMaximum spectral radius of graphs with given connectivity, minimum degree and independence numberOn the signless Laplacian spectral radius of graphs with cut verticesThe spectral radius of bicyclic graphs with prescribed degree sequencesMaximizing signless Laplacian or adjacency spectral radius of graphs subject to fixed connectivityA note on spectral radius and degree deviation in graphsLeading eigenvalues of adjacency matrices of star-like graphs with fixed numbers of vertices and edgesInterlacing eigenvalues on some operations of graphsThe least eigenvalue of graphs with given connectivityOn the maximum spectral radius of multipartite graphsOn 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 verticesA further result on majorization theoremThe maximum spectral radius of \(t\)-connected graphs with bounded matching numberOn the index of tricyclic graphs with perfect matchingsThe spectral radius of unicyclic and bicyclic graphs with \(n\) vertices and \(k\) pendant verticesOn the multiplicative sum Zagreb index of graphs with some given parameters



Cites Work


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