Spectral radius of graphs with given matching number

DOI10.1016/J.LAA.2006.09.014zbMATH Open1111.05060OpenAlexW2150809110MaRDI QIDQ869922FDOQ869922

Authors: Guihai Yu, Lihua 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

Recommendations

• The maximal A_α-spectral radius of graphs with given matching number
• On the maximal α-spectral radius of graphs with given matching number
• The maximum spectral radius of \(t\)-connected graphs with bounded matching number
• Matchings in graphs from the spectral radius
• On the maximal signless Laplacian spectral radius of graphs with given matching number

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Extremal problems in graph theory (05C35)

Cites Work

• Graph theory
• Matching theory
• On the Spectral Radius of Complementary Acyclic Matrices of Zeros and Ones
• Title not available (Why is that?)
• Title not available (Why is that?)
• The spectral radius of trees on \(k\) pendant vertices
• On the spectral radius of graphs with cut vertices
• On the Laplacian spectral radius of a tree.
• Inverses of trees
• Bounds on the largest eigenvalues of trees with a given size of matching
• On the spectral radius of graphs with cut edges

Cited In (55)

• Fractional matchings in graphs from the spectral radius
• Spectral radius and rainbow Hamilton paths of a graph
• On the spectral Turán problem of theta graphs
• Maxima of the \(Q\)-index for \(3 K_3\)-free graphs
• Path factors in bipartite graphs from size or spectral radius
• Spectral extremal problem on disjoint color-critical graphs
• Spectral extremal problem on \(t\) copies of \(\ell\)-cycles
• Graphs with the minimum spectral radius for given independence number
• The spectral radius of edge chromatic critical graphs
• On the spectral radius of graphs without a star forest
• The signless p-Laplacian spectral radius of graphs with given matching number
• The maximum spectral radius of graphs without spanning linear forests
• An \(A_\alpha\)-spectral Erdős-Pósa theorem
• Maximum spectral radius of graphs with given connectivity, minimum degree and independence number
• An extremal problem on Q-spectral radii of graphs with given size and matching number
• Spectral conditions for graphs to be \(\beta\)-deficient involving minimum degree
• The zero forcing number of graphs with the matching number and the cyclomatic number
• On the minimum spectral radius of trees with given matching number.
• On minimally 2-(edge)-connected graphs with extremal spectral radius
• On a conjecture for the signless Laplacian spectral radius of cacti with given matching number
• Resolution of AutoGraphiX conjectures relating the index and matching number of graphs
• Title not available (Why is that?)
• The maximum \(A_\alpha\)-spectral radius of \(t\)-connected graphs with bounded matching number
• Spectral radius and fractional perfect matchings in graphs
• On maximal energy of line graphs with given parameters
• Note on extremal graphs with given matching number
• On the maximal signless Laplacian spectral radius of graphs with given matching number
• The least eigenvalue of graphs with given connectivity
• The least eigenvalue of a graph with a given domination number
• Spectral extrema of graphs with bounded clique number and matching number
• Sharp bounds on the \(A_{\alpha}\)-index of graphs in terms of the independence number
• The maximal A_α-spectral radius of graphs with given matching number
• Spectral extrema of \(\{ K_{k + 1}, \mathcal{L}_s \}\)-free graphs
• Zagreb, Harary and hyper-Wiener indices of graphs with a given matching number
• On the spectral radius of graphs with a given domination number
• Disproof of a conjecture on the minimum spectral radius and the domination number
• Spectral conditions for graphs to be \(k\)-Hamiltonian or \(k\)-path-coverable
• A tight lower bound on the matching number of graphs via Laplacian eigenvalues
• Spectral radius and rainbow matchings of graphs
• Matching extension and distance spectral radius
• Spectral extrema of \(K_{s,t}\)-minor free graphs -- on a conjecture of M. Tait
• The matchings and spectral radius of graphs involving minimum degree
• Spectral radius and matchings in graphs
• The maximum spectral radius of \(t\)-connected graphs with bounded matching number
• Constructing graphs with given spectrum and the spectral radius at most 2
• On the largest and least eigenvalues of eccentricity matrix of trees
• The vertex (edge) independence number, vertex (edge) cover number and the least eigenvalue of a graph
• On the maximal α-spectral radius of graphs with given matching number
• Perfect matching and distance spectral radius in graphs and bipartite graphs
• Spectral characterization of matchings in graphs
• Bound on the least eigenvalue of a graph with cut vertices
• Matchings in graphs from the spectral radius
• On the \(A_\alpha\)-spectral radius of graphs without large matchings
• The spectral radius and \({\mathcal{P}}_{\ge \ell}\)-factors of graphs involving minimum degree
• Spectral conditions for some graphical properties

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q869922)