Sizhong Zhou

activity

20192026

most citedSignless Laplacian spectral radius for a k-extendable graph

2 citations · 2 across the 7 of their papers we have counts for

collaborators

Showing math.COShow all

10 papers · 1 filter

math.CO2026

Sufficient conditions for a special factor in a graph with minimum degree

Sizhong Zhou

Let $G$ be a graph. The size and the signless Laplacian spectral radius of $G$ are denoted by $e (G)$ and $q (G)$ , respectively. A spanning subgraph $F$ of $G$ is called an $H_{b}$ -fac…

math.CO2023

Spectral radius and k-factor-critical graphs

Sizhong Zhou, Zhiren Sun, Yuli Zhang

For a nonnegative integer $k$ , a graph $G$ is said to be $k$ -factor-critical if $G - Q$ admits a perfect matching for any $Q \subseteq V (G)$ with $∣ Q ∣ = k$ . In this article, we prove sp…

math.CO2023

Two sufficient conditions for graphs to admit path factors

Sizhong Zhou, Jiancheng Wu

Let $A$ be a set of connected graphs. Then a spanning subgraph $A$ of $G$ is called an $A$ -factor if each component of $A$ is isomorphic to some member of $\mat…

math.CO2023

Some existence theorems on path-factor critical avoidable graphs

Sizhong Zhou, Hongxia Liu

A spanning subgraph $F$ of $G$ is called a path factor if every component of $F$ is a path of order at least 2. Let $k \geq 2$ be an integer. A $P_{\geq k}$ -factor of $G$ means a pat…

math.CO2023

Spanning k-trees and distance spectral radius in graphs

Sizhong Zhou, Jiancheng Wu

Let $k \geq 2$ be an integer. A tree $T$ is called a $k$ -tree if $d_{T} (v) \leq k$ for each $v \in V (T)$ , that is, the maximum degree of a $k$ -tree is at most $k$ . Let $λ_{1} (D (G))$ denote…

math.CO2023★ 2 cited

Signless Laplacian spectral radius for a k-extendable graph

Sizhong Zhou, Yuli Zhang

Let $k$ and $n$ be two nonnegative integers with $n \equiv 0$ (mod 2), and let $G$ be a graph of order $n$ with a 1-factor. Then $G$ is said to be $k$ -extendable for $0\leq k\leq\fra…