Some sufficient conditions for a graph with minimum degree to be \(k\)-factor-critical

DOI10.1016/j.dam.2024.01.045OpenAlexW4391867842MaRDI QIDQ6124438

Shuchao Li, Xiao-Bing Luo, Guangfu Wang, Lin Zheng

Publication date: 27 March 2024

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2024.01.045

zbMATH Keywords

sizeminimum degreedistance spectral radius\(Q\)-index\(k\)-factor-critical graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Vertex degrees (05C07)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Large matchings from eigenvalues
• Matchings in regular graphs from eigenvalues
• 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
• On the \(A_\alpha\)-spectral radius of graphs without large matchings
• Characterizing star factors via the size, the spectral radius or the distance spectral radius of graphs
• The characterization of \(p\)-factor-critical graphs
• Spectral radius and matchings in graphs
• Perfect matching and distance spectral radius in graphs and bipartite graphs
• A note on \(m\)-near-factor-critical graphs
• On k-factor-critical graphs
• 3-Factor-Criticality of Vertex-Transitive Graphs
• Regular Graphs, Eigenvalues and Regular Factors
• On a conjecture for the signless Laplacian spectral radius of cacti with given matching number
• Edge-Connectivity, Eigenvalues, and Matchings in Regular Graphs
• Graphs and Subgraphs
• Graphs with 1-Factors
• A sufficient condition for a graph to contain three disjoint 1-factors
• On spectral radius of the distance matrix
• Merging the A-and Q-spectral theories
• The Factorization of Linear Graphs
• The spanning k-trees, perfect matchings and spectral radius of graphs
• ON THE SIZE, SPECTRAL RADIUS, DISTANCE SPECTRAL RADIUS AND FRACTIONAL MATCHINGS IN GRAPHS

This page was built for publication: Some sufficient conditions for a graph with minimum degree to be \(k\)-factor-critical