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

DOI10.1016/J.DISC.2020.111906MaRDI QIDQ2185908zbMATH OpenOpenAlexFDO

Authors Sungeun Kim, Suil O, Hyo Ree, 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

b \)-factor]eigenvaluesodd \([ 1

Mathematics Subject Classification ID

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

Abstract: An odd $[1,b]$-factor of a graph $G$ is a spanning subgraph $H$ such that for each vertex $vinV(G)$, $d_H(v)$ is odd and $1le{d}_H(v)leb$. Let $lambd{a}_3(G)$ be the third largest eigenvalue of the adjacency matrix of $G$. For positive integers $rge3$ and even $n$, Lu, Wu, and Yang [10] proved a lower bound for $lambd{a}_3(G)$ in an $n$-vertex $r$-regular graph $G$ to gurantee the existence of an odd $[1,b]$-factor in $G$. In this paper, we improve the bound; it is sharp for every $r$.

Recommendations

• Eigenvalues and [a,b]‐factors in regular graphs
• Matchings in regular graphs from eigenvalues
• Two sufficient conditions for odd \([1,b]\)-factors in graphs
• Regular factors of regular graphs from eigenvalues
• Regular graphs, eigenvalues and regular factors

Cites work

• A degree condition for the existence of 1-factors in graphs or their complements
• Edge-connectivity, eigenvalues, and matchings in regular graphs
• Eigenvalues and \([1,n]\)-odd factors
• Eigenvalues and perfect matchings
• scientific article; zbMATH DE number 1600999 (Why is no real title available?)
• scientific article; zbMATH DE number 3141016 (Why is no real title available?)
• Matchings in regular graphs from eigenvalues
• On factors with all degrees odd
• Ore-type conditions for the existence of even \([2,b]\)-factors in graphs
• Some sufficient conditions for the existence of a 1-factor
• Sufficient condition for the existence of an even \([a,b]\)-factor in graph
• The Factorization of Linear Graphs

Cited in

(34)

• Spectral radius and \([a,b]\)-factors in graphs
• Two sufficient conditions for odd \([1,b]\)-factors in graphs
• Regular graphs, eigenvalues and regular factors
• scientific article; zbMATH DE number 426172 (Why is no real title available?)
• Sharp conditions for the existence of an even \([a,b]\)-factor in a graph
• Sharp Ore-type conditions for the existence of an even \([4,b]\)-factor in a graph
• Complete characterization of odd factors via the size, spectral radius or distance spectral radius of graphs
• Eigenvalues and [a,b]‐factors in regular graphs
• Regular factors of regular graphs from eigenvalues
• 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
• Spanning k-trees and distance signless Laplacian spectral radius of graphs
• Some results on \(\{K_2, C_{2i + 1} : i \geq 1\}\)-factor in a graph
• A spectral condition for a graph to have strong parity factors
• Binding number, odd \([1, b]\)-factors and the distance spectral radius
• Characterizing spanning trees via the size or the spectral radius of graphs
• An odd \([1, b]\)-factor in a graph from signless Laplacian spectral radius
• Eigenvalues and spanning tree in regular graphs
• Signless Laplacian spectral conditions for \(k\)-critical graphs with respect to \([1, b]\)-odd factors
• Some results on the k-strong parity property in a graph
• Some sufficient conditions for graphs to have component factors
• Spectral conditions for a graph to have strong parity factors
• The \(A_\alpha\)-spectral radius for \(\{P_2, C_3, P_5, \mathcal{T}(3)\}\)-factors in graphs
• Spectral radius and fractional \([a, b]\)-factor of graphs
• Spectral versions on Lovász's ( a , b )-parity factor theorem in graphs
• The size and \(A_\alpha\)-spectral radius for the existence of \(\{ K_{1, 1}, K_{1, 2}, \ldots, K_{1, k}, \mathcal{T} ( 2 k + 1 ) \}\)-factors in graphs
• Characterizations of fractional factor-critical graphs via size and spectral radius
• A note on the spectral radius and \([a,b]\)-factor of graphs
• Title not available (Why is no real title available?)
• Title not available (Why is no real title available?)
• Title not available (Why is no real title available?)
• Title not available (Why is no real title available?)
• Eigenvalues and \([1,n]\)-odd factors

This page was built for publication: An odd \([ 1 , b ]\)-factor in regular graphs from eigenvalues

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