Spectral radius of graphs with given matching number

From MaRDI portal
Publication:869922

DOI10.1016/j.laa.2006.09.014zbMath1111.05060OpenAlexW2150809110MaRDI QIDQ869922

Guihai Yu, Li-Hua Feng, Xiao Dong Zhang

Publication date: 9 March 2007

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

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




Related Items (43)

On the spectral radius of graphs without a star forestSpectral extrema of \(K_{s,t}\)-minor free graphs -- on a conjecture of M. TaitThe maximum \(A_\alpha\)-spectral radius of \(t\)-connected graphs with bounded matching numberSpectral radius and fractional perfect matchings in graphsSpectral extrema of graphs with bounded clique number and matching numberDisproof of a conjecture on the minimum spectral radius and the domination numberSpectral radius and rainbow matchings of graphsOn minimally 2-(edge)-connected graphs with extremal spectral radiusThe maximum spectral radius of graphs without spanning linear forestsAn \(A_\alpha\)-spectral Erdős-Pósa theoremThe matchings and spectral radius of graphs involving minimum degreeOn the maximal α-spectral radius of graphs with given matching numberMatchings in graphs from the spectral radiusThe signless p-Laplacian spectral radius of graphs with given matching numberOn a conjecture for the signless Laplacian spectral radius of cacti with given matching numberThe zero forcing number of graphs with the matching number and the cyclomatic numberMatching extension and distance spectral radiusSharp bounds on the \(A_{\alpha}\)-index of graphs in terms of the independence numberSpectral extrema of \(\{ K_{k + 1}, \mathcal{L}_s \}\)-free graphsSpectral extremal problem on disjoint color-critical graphsUnnamed ItemPerfect matching and distance spectral radius in graphs and bipartite graphsNote on extremal graphs with given matching numberSpectral conditions for graphs to be β-deficient involving minimum degreeOn the largest and least eigenvalues of eccentricity matrix of treesSpectral conditions for some graphical propertiesOn the spectral radius of graphs with a given domination numberThe least eigenvalue of a graph with a given domination numberBound on the least eigenvalue of a graph with cut verticesThe vertex (edge) independence number, vertex (edge) cover number and the least eigenvalue of a graphZagreb, Harary and hyper-Wiener indices of graphs with a given matching numberResolution of AutoGraphiX conjectures relating the index and matching number of graphsMaximum spectral radius of graphs with given connectivity, minimum degree and independence numberOn maximal energy of line graphs with given parametersSpectral conditions for graphs to be \(k\)-Hamiltonian or \(k\)-path-coverableThe spectral radius of edge chromatic critical graphsThe least eigenvalue of graphs with given connectivityA tight lower bound on the matching number of graphs via Laplacian eigenvaluesThe maximum spectral radius of \(t\)-connected graphs with bounded matching numberOn the \(A_\alpha\)-spectral radius of graphs without large matchingsThe spectral radius and \({\mathcal{P}}_{\ge \ell}\)-factors of graphs involving minimum degreeThe maximal Aα-spectral radius of graphs with given matching numberAn extremal problem on Q-spectral radii of graphs with given size and matching number



Cites Work


This page was built for publication: Spectral radius of graphs with given matching number