Spectral radius, fractional [a,b]-factor and ID-factor-critical graphs

DOI10.1016/J.DISC.2024.113976MaRDI QIDQ6443025zbMATH OpenFDO

Authors Ao Fan, Rui-fang Liu, Guoyan Ao

Publication date 7 July 2023

Full work available at URL https://doi.org/10.1016/J.DISC.2024.113976

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)

Abstract: Let $G$ be a graph and $h:E(G)ightarrow[0,1]$ be a function. For any two positive integers $a$ and $b$ with $aleqb$, a fractional $[a,b]$-factor of $G$ with the indicator function $h$ is a spanning subgraph with vertex set $V(G)$ and edge set $E_h$ such that $aleqsu{m}_{ein{E}_G(v)}h(e)leqb$ for any vertex $vinV(G)$, where $E_h=einE(G)|h(e)>0$ and $E_G(v)=einE(G)|emboxisincidentwithvmboxinG$. A graph $G$ is ID-factor-critical if for every independent set $I$ of $G$ whose size has the same parity as $|V(G)|$, $G-I$ has a perfect matching. In this paper, we present a tight sufficient condition based on the spectral radius for a graph to contain a fractional $[a,b]$-factor, which extends the result of Wei and Zhang [Discrete Math. 346 (2023) 113269]. Furthermore, we also prove a tight sufficient condition in terms of the spectral radius for a graph with minimum degree $delta$ to be ID-factor-critical.

Recommendations

• A MINIMUM DEGREE CONDITION FOR FRACTIONAL ID-[a,b]-FACTOR-CRITICAL GRAPHS
• Spectral conditions for graphs having all (fractional) $[a,b]$-factors
• A degree condition for graphs to be fractional ID-\([a,b]\)-factor-critical
• A neighborhood condition for fractional ID-\([a,b]\)-factor-critical graphs

Cited in

(13)

• Spectral radius conditions for fractional \([a,b]\)-covered graphs
• Spectral conditions for graphs having all (fractional) $[a,b]$-factors
• Spectral condition for k-factor-criticality in t-connected graphs
• \(A_\alpha\)-spectral conditions for \((a, b, k)\)-factor-critical graphs and fractional \(ID\)-\([a, b]\)-factor-critical covered graphs
• Signless Laplacian spectral conditions for \(k\)-critical graphs with respect to \([1, b]\)-odd factors
• Spectral radius, the matching number and fractional criticality of graphs
• Distance spectral conditions for \textit{ID}-factor-criticality and fractional \([a,b]\)-factor of graphs
• Spectral extremal problem on all (a, b, k)-critical graphs
• Spectral extremal problems on factors in tough graphs, and beyond
• Spectral radius and fractional \([a, b]\)-factor of graphs
• Sufficient conditions on the existence of factors in graphs involving minimum degree.
• Characterizations of fractional factor-critical graphs via size and spectral radius
• A note on the spectral radius and \([a,b]\)-factor of graphs

This page was built for publication: Spectral radius, fractional $[a,b]$-factor and ID-factor-critical graphs

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