Yong Lu

collaborators

6 papers

math.CO2026

The spectral inducibility of graphs

Liying Kang, Xizhi Liu, Yongchun Lu

We introduce a spectral version of the classical inducibility problem. Given an $ℓ$ -vertex graph $F$ and an $n$ -vertex graph $G$ , let $H_{F} (G)$ be the $ℓ$ -uniform hypergraph w…

math.CO2026

Sufficient conditions for fractional $k$ -factor-critical graphs with minimum degree to be $k$ -factor-critical

Jiaxu Zhong, Yong Lu

A graph $G$ is called $k$ -factor-critical if after deleting any $k$ vertices the remaining subgraph still has a perfect matching. Fan and Lin [Adv. in Appl. Math. 174 (2026) 103019…

math.CO2026

Sufficient conditions for spanning $k$ -trees in tough graphs

Caili Jia, Yong Lu

The toughness of a graph $G$ , denoted by $I ¨ (G)$ , is defined by $I ¨ (G) =$ min ${\frac{∣ S ∣}{c ( G - S )} : S \subseteq V (G)$ and $c (G - S) \geq 2}$ . A graph $G$ is said to be $I ¨ $ -tough if $Ï(…

math.CO2025

The existence of even factors based on the $A_{I^} \pm$ -spectral radius of graphs

Caili Jia, Yong Lu

An even factor of $G$ is a spanning subgraph $F$ such that every vertex in $F$ has a nonzero even degree. Note that $I^´ (G) \geq 2$ is a trivial necessary condition for a graph to hav…

math.CO2025

Scattering number and $I ¨ $ -toughness in graphs involving $A_{I^} \pm$ -spectral radius

Caili Jia, Yong Lu

The scattering number $s (G)$ of graph $G = (V, E)$ is defined as $s (G)$ =max\big\{ $c (G - S) - ∣ S ∣$ \big\}, where the maximum is taken over all proper subsets $S \subseteq V (G)$ , and $c (G - S)$ …

math.CO2025

Sufficient conditions for $t$ -tough graphs to be Hamiltonian and pancyclic or bipartite

Xiangge Liu, Caili Jia, Yong Lu +1

The toughness of graph $G$ , denoted by $I ¨ (G)$ , is $I ¨ (G) = min {\frac{∣ S ∣}{c ( G - S )} : S \subseteq V (G), c (G - S) \geq 2}$ for every vertex cut $S$ of $V (G)$ and the number of components of…

The spectral inducibility of graphs

Sufficient conditions for fractional k-factor-critical graphs with minimum degree to be k-factor-critical

Sufficient conditions for spanning k-trees in tough graphs

The existence of even factors based on the AI^​±-spectral radius of graphs

Scattering number and I¨-toughness in graphs involving AI^​±-spectral radius

Sufficient conditions for t-tough graphs to be Hamiltonian and pancyclic or bipartite

Sufficient conditions for fractional $k$ -factor-critical graphs with minimum degree to be $k$ -factor-critical

Sufficient conditions for spanning $k$ -trees in tough graphs

The existence of even factors based on the $A_{I^} \pm$ -spectral radius of graphs

Scattering number and $I ¨ $ -toughness in graphs involving $A_{I^} \pm$ -spectral radius

Sufficient conditions for $t$ -tough graphs to be Hamiltonian and pancyclic or bipartite