Gang Zhang

most citedOn the

C_{4}

-isolation number of a graph

1 citations · 1 across the 4 of their papers we have counts for

collaborators

4 papers

math.CO2024

Isolation partitions in graphs

Gang Zhang, Weiling Yang, Xian'an Jin

Let $G$ be a graph and $k \geq 3$ an integer. A subset $D \subseteq V (G)$ is a $k$ -clique (resp., cycle) isolating set of $G$ if $G - N [D]$ contains no $k$ -clique (resp., cycle). In…

math.CO2023★ 1 cited

On the $C_{4}$ -isolation number of a graph

Xiaohua Wei, Gang Zhang, Biao Zhao

Let $C_{k}$ be the cycle of length $k$ . For any graph $G$ , a subset $D \subseteq V (G)$ is a $C_{k}$ -isolating set of $G$ if the graph obtained from $G$ by deleting the closed neighbour…

math.CO2023

New results on the 1-isolation number of graphs without short cycles

Yirui Huang, Gang Zhang, Xian'an Jin

Let $G$ be a graph. A subset $D \subseteq V (G)$ is called a 1-isolating set of $G$ if $Δ (G - N [D]) \leq 1$ , that is, $G - N [D]$ consists of isolated edges and isolated vertices only. T…

cs.CV2023

Open-TransMind: A New Baseline and Benchmark for 1st Foundation Model Challenge of Intelligent Transportation

Yifeng Shi, Feng Lv, Xinliang Wang +5

With the continuous improvement of computing power and deep learning algorithms in recent years, the foundation model has grown in popularity. Because of its powerful capabilities…

Isolation partitions in graphs

On the C4​-isolation number of a graph

New results on the 1-isolation number of graphs without short cycles

Open-TransMind: A New Baseline and Benchmark for 1st Foundation Model Challenge of Intelligent Transportation

On the $C_{4}$ -isolation number of a graph