Gang Zhang

collaborators

5 papers

math.CO2025

On $d$ -distance $p$ -packing domination number in strong products

Csilla BujtÃ¡s, Vesna IrÅ¡iÄ Chenoweth, Sandi KlavÅ¾ar +1

The $d$ -distance $p$ -packing domination number $Î³_d^p(G)$ of a graph $G$ is the cardinality of a smallest set of vertices of $G$ which is both a $d$ -distance dominating set and a…

math.CO2025

The $d$ -distance $p$ -packing domination number: complexity, cycles, and trees

Csilla BujtÃ¡s, Vesna IrÅ¡iÄ Chenoweth, Sandi KlavÅ¾ar +1

A set of vertices $X \subseteq V (G)$ is a $d$ -distance dominating set if for every $u \in V (G) ∖ X$ there exists $x \in X$ such that $d (u, x) \leq d$ , and $X$ is a $p$ -packing if…

math.CO2025

Revisiting $d$ -distance (independent) domination in trees and in bipartite graphs

Csilla BujtÃ¡s, Vesna IrÅ¡iÄ Chenoweth, Sandi KlavÅ¾ar +1

The $d$ -distance $p$ -packing domination number $Î³_d^p(G)$ of $G$ is the minimum size of a set of vertices of $G$ which is both a $d$ -distance dominating set and a $p$ -packing. In…

math.CO2025

On the maximum partial-dual genus of a planar graph

Jiaying Chen, Xian'an Jin, Gang Zhang

Let $G$ be an embedded graph and $A$ an edge subset of $G$ . The partial dual of $G$ with respect to $A$ , denoted by $G^{A}$ , can be viewed as the geometric dual $G^{*}$ of $G$ over $A$ …

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…

On d-distance p-packing domination number in strong products

The d-distance p-packing domination number: complexity, cycles, and trees

Revisiting d-distance (independent) domination in trees and in bipartite graphs

On the maximum partial-dual genus of a planar graph

Isolation partitions in graphs

On $d$ -distance $p$ -packing domination number in strong products

The $d$ -distance $p$ -packing domination number: complexity, cycles, and trees

Revisiting $d$ -distance (independent) domination in trees and in bipartite graphs