Caili Jia

collaborators

5 papers

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…

math.CO2025

Distance signless Laplacian spectral radius and tough graphs involving minimun degree

Xiangge Liu, Yong Lu, Caili Jia +2

Let $G = (V (G), E (G))$ be a simple graph, where $V (G)$ and $E (G)$ are the vertex set and the edge set of $G$ , respectively. The number of components of $G$ is denoted by $c (G)$ . Let $…

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

Distance signless Laplacian spectral radius and tough graphs involving minimun degree

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