An odd \([ 1 , b ]\)-factor in regular graphs from eigenvalues

DOI10.1016/j.disc.2020.111906zbMath1441.05140arXiv2003.12834OpenAlexW3013919929MaRDI QIDQ2185908

Hyo Ree, Suil O, Sungeun Kim, Ji Hwan Park

Publication date: 8 June 2020

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

Full work available at URL: https://arxiv.org/abs/2003.12834

zbMATH Keywords

eigenvaluesb \)-factor]odd \([ 1

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items

Spectral radius and \([a,b\)-factors in graphs] ⋮ Sharp conditions for the existence of an even $[a,b$-factor in a graph] ⋮ Eigenvalues and [a,b‐factors in regular graphs] ⋮ Two sufficient conditions for odd \([1,b\)-factors in graphs] ⋮ Degree conditions for the existence of a {P₂, P₅}-factor in a graph ⋮ Sufficient conditions for graphs to have strong parity factors ⋮ \(\mathcal{D}\)-index and \(\mathcal{Q}\)-index for spanning trees with leaf degree at most \(k\) in graphs ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Sufficient condition for the existence of an even \([a,b\)-factor in graph]
• Eigenvalues and \([1,n\)-odd factors]
• Matchings in regular graphs from eigenvalues
• On factors with all degrees odd
• A degree condition for the existence of 1-factors in graphs or their complements
• Eigenvalues and perfect matchings
• Ore-type conditions for the existence of even \([2,b\)-factors in graphs]
• Edge-Connectivity, Eigenvalues, and Matchings in Regular Graphs
• Some sufficient conditions for the existence of a 1-factor
• The Factorization of Linear Graphs