Sizhong Zhou

activity

20132026

most citedSignless Laplacian spectral radius for a k-extendable graph

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

collaborators

13 papers

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…

math.CO2022

Some sufficient conditions for path-factor uniform graphs

Sizhong Zhou, Zhiren Sun, Hongxia Liu

For a set $H$ of connected graphs, a spanning subgraph $H$ of $G$ is called an $H$ -factor of $G$ if each component of $H$ is isomorphic to an element of $\mathc…

math.CO2019

A result on fractional (a,b,k)-critical covered graphs

Sizhong Zhou, Quanru Pan

For a graph $G$ , the set of vertices in $G$ is denoted by $V (G)$ , and the set of edges in $G$ is denoted by $E (G)$ . A fractional $[a, b]$ -factor of a graph $G$ is a function $h$ fro…

math.CO2019★ 1 cited

Independence number and connectivity for fractional (a,b,k)-critical covered graphs

Sizhong Zhou, Jiancheng Wu, Hongxia Liu

A graph $G$ is a fractional $(a, b, k)$ -critical covered graph if $G - U$ is a fractional $[a, b]$ -covered graph for every $U \subseteq V (G)$ with $∣ U ∣ = k$ , which is first defined by Zhou…

math.CO2019

A note of generalization of fractional ID-factor-critical graphs

Sizhong Zhou

In communication networks, the binding numbers of graphs (or networks) are often used to measure the vulnerability and robustness of graphs (or networks). Furthermore, the fraction…

math.CO2014

All fractional (g,f)-factors in graphs

Zhiren Sun, Sizhong Zhou

Let $G$ be a graph, and $g, f : V (G) \to N$ be two functions with $g (x) \leq f (x)$ for each vertex $x$ in $G$ . We say that $G$ has all fractional $(g, f)$ -factors if $G$ includes…

math.CO2014

Some existence theorems on all fractional $(g, f)$ -factors with prescribed properties

Sizhong Zhou

Let $G$ be a graph, and $g, f : V (G) \to Z^{+}$ with $g (x) \leq f (x)$ for each $x \in V (G)$ . We say that $G$ admits all fractional $(g, f)$ -factors if $G$ contains a fractional $r…

math.CO2013

A neighborhood condition for fractional ID-[a,b]-factor-critical graphs

Sizhong Zhou, Fan Yang, Zhiren Sun

Let $G$ be a graph of order $n$ , and let $a$ and $b$ be two integers with $1 \leq a \leq b$ . Let $h : E (G) \to [0, 1]$ be a function. If $a \leq \sum_{e ∋ x} h (e) \leq b$ holds for…

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

Spectral radius and k-factor-critical graphs

Two sufficient conditions for graphs to admit path factors

Some existence theorems on path-factor critical avoidable graphs

Spanning k-trees and distance spectral radius in graphs

Signless Laplacian spectral radius for a k-extendable graph

Some sufficient conditions for path-factor uniform graphs

A result on fractional (a,b,k)-critical covered graphs

Independence number and connectivity for fractional (a,b,k)-critical covered graphs

A note of generalization of fractional ID-factor-critical graphs

All fractional (g,f)-factors in graphs

Some existence theorems on all fractional (g,f)-factors with prescribed properties

A neighborhood condition for fractional ID-[a,b]-factor-critical graphs

Some existence theorems on all fractional $(g, f)$ -factors with prescribed properties