collaborators

6 papers

math.CO2025

On the total Italian domination number in digraphs

Changchang Dong, Yubao Guo, Mei Lu +1

Consider a finite simple digraph with vertex set . An Italian dominating function (IDF) on is a function satisfying every vertex with…

math.CO2025

Perfect codes in quartic Cayley graphs of generalized dihedral groups

Chengcheng Dong, Yuefeng Yang, Changchang Dong

For a graph , a subset of is a perfect code in if every vertex of is dominated by exactly one vertex in . In this paper, we classify all connec…

math.CO2024

The generalized Tur'{a}n number of long cycles in graphs and bipartite graphs

Changchang Dong, Mei Lu, Jixiang Meng +1

Given a graph and a family of graphs , the maximum number of copies of in an -free graph on vertices is called the generalized Turán number,…

math.CO2024

Antidirected hamiltonian paths in -hypertournaments

Hong Yang, Changchang Dong, Jixiang Meng +1

A -hypertournament on vertices is a pair , where is a set of vertices and is a set of -tuples of vertices, called arcs, such that for any $…

math.CO2024

A new condition on dominated pair degree sum for a digraph to be supereulerian

Changchang Dong, Jixiang Meng, Juan Liu

A digraph is supereulerian if contains a spanning eulerian subdigraph. For any two vertices in a digraph , if for some , then we c…

math.CO2024

Sufficient conditions for closed-trailable in digraphs

Changchang Dong, Hong Yang, Jixiang Meng +1

A digraph with a subset of is called {\bf -strong} if for every pair of distinct vertices and of , there is a -dipath and a $(v, u…