On the \(A_\alpha\)-spectral radius of graphs without large matchings

DOI10.1007/s40840-022-01363-4zbMath1506.05120OpenAlexW4292263195MaRDI QIDQ2091147

Qin Zhao, Yifang Hao, Shuchao Li

Publication date: 31 October 2022

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40840-022-01363-4

zbMATH Keywords

matching numberquotient matrix\(A_\alpha\)-spectral radius\(A_{\alpha}\)-matrix

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (4)

An \(A_\alpha\)-spectral Erdős-Pósa theorem ⋮ Some sufficient conditions for a graph with minimum degree to be \(k\)-factor-critical ⋮ Matching extension and matching exclusion via the size or the spectral radius of graphs ⋮ Characterizing star factors via the size, the spectral radius or the distance spectral radius of graphs

Uses Software

• Mathematica

Cites Work

• Unnamed Item
• Spectral radius and fractional matchings in graphs
• Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels
• Computing large matchings in planar graphs with fixed minimum degree
• Spectra of graphs
• Spectral radius of graphs with given matching number
• Matchings in regular graphs from eigenvalues
• Matching theory
• Graphs determined by their \(A_\alpha\)-spectra
• On the \(A_\alpha\)-spectra of graphs
• Eigenvalues and perfect matchings
• Characterizing \(\mathcal{P}_{\geqslant 2} \)-factor and \(\mathcal{P}_{\geqslant 2} \)-factor covered graphs with respect to the size or the spectral radius
• On the spectrum of an equitable quotient matrix and its application
• Some spectral inequalities for connected bipartite graphs with maximum \(A_\alpha\)-index
• An arithmetic criterion for graphs being determined by their generalized \(A_\alpha \)-spectra
• On the \(A_\sigma\)-spectral radii of graphs with some given parameters
• The multiplicity of an \(A_\alpha \)-eigenvalue: a unified approach for mixed graphs and complex unit gain graphs
• The maximum number of cliques in hypergraphs without large matchings
• Spectral radius and matchings in graphs
• Perfect matching and distance spectral radius in graphs and bipartite graphs
• Adjacency eigenvalues of graphs without short odd cycles
• The \(A_\alpha\)-spectral radius and perfect matchings of graphs
• On the second largest \(A_{\alpha}\)-eigenvalues of graphs
• The \(A_\alpha \)-spectral radius of trees and unicyclic graphs with given degree sequence
• Large matchings in bipartite graphs have a rainbow matching
• Regular Graphs, Eigenvalues and Regular Factors
• Edge-Connectivity, Eigenvalues, and Matchings in Regular Graphs
• Merging the A-and Q-spectral theories
• The Factorization of Linear Graphs
• The effect on A_α-eigenvalues of mixed graphs and unit gain graphs by adding edges in clusters
• Matchings in graphs from the spectral radius

This page was built for publication: On the \(A_\alpha\)-spectral radius of graphs without large matchings