Xiangge Liu

collaborators

2 papers

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 t-tough graphs to be Hamiltonian and pancyclic or bipartite

Distance signless Laplacian spectral radius and tough graphs involving minimun degree

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