On the \(A_\alpha\)-spectral radius of graphs without large matchings
type: Item
instance of: scholarly article
title: On the \(A_\alpha\)-spectral radius of graphs without large matchings
zbMATH Open document ID: 1506.05120
author: Yifang Hao
author: Shuchao Li
author: Qin Zhao
published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series
publication date: 2022-10-31T00:00:00Z
Mathematics Subject Classification ID: 05C50
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 7610164
zbMATH Keywords: \(A_{\alpha}\)-matrix
zbMATH Keywords: \(A_\alpha\)-spectral radius
zbMATH Keywords: matching number
zbMATH Keywords: quotient matrix
describes a project that uses: Mathematica
MaRDI profile type: Publication
full work available at URL: s40840-022-01363-4
OpenAlex ID: W4292263195
cites work: Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels
cites work: Eigenvalues and perfect matchings
cites work: Spectra of graphs
cites work: On the second largest \(A_{\alpha}\)-eigenvalues of graphs
cites work: Matchings in regular graphs from eigenvalues
cites work: Edge-Connectivity, Eigenvalues, and Matchings in Regular Graphs
cites work: Spectral radius of graphs with given matching number
cites work: Computing large matchings in planar graphs with fixed minimum degree
cites work: Matchings in graphs from the spectral radius
cites work: Large matchings in bipartite graphs have a rainbow matching
cites work: The \(A_\alpha \)-spectral radius of trees and unicyclic graphs with given degree sequence
cites work: Characterizing \(\mathcal{P}_{\geqslant 2} \)-factor and \(\mathcal{P}_{\geqslant 2} \)-factor covered graphs with respect to the size or the spectral radius
cites work: An arithmetic criterion for graphs being determined by their generalized \(A_\alpha \)-spectra
cites work: Some spectral inequalities for connected bipartite graphs with maximum \(A_\alpha\)-index
cites work: Adjacency eigenvalues of graphs without short odd cycles
cites work: Q5215566
cites work: The multiplicity of an \(A_\alpha \)-eigenvalue: a unified approach for mixed graphs and complex unit gain graphs
cites work: The effect on Aα-eigenvalues of mixed graphs and unit gain graphs by adding edges in clusters
cites work: On the \(A_\sigma\)-spectral radii of graphs with some given parameters
cites work: Graphs determined by their \(A_\alpha\)-spectra
cites work: On the \(A_\alpha\)-spectra of graphs
cites work: The maximum number of cliques in hypergraphs without large matchings
cites work: Regular graphs, eigenvalues and regular factors
cites work: Matching theory
cites work: Merging the A-and Q-spectral theories
cites work: Spectral radius and matchings in graphs
cites work: Spectral radius and fractional matchings in graphs
cites work: The Factorization of Linear Graphs
cites work: On the spectrum of an equitable quotient matrix and its application
cites work: Perfect matching and distance spectral radius in graphs and bipartite graphs
cites work: The \(A_\alpha\)-spectral radius and perfect matchings of graphs
DOI: 10.1007/S40840-022-01363-4
description: scientific article; zbMATH DE number 7610164