Contents

Ars Combinatoria

  • Research article

Domination Number in Iterated Line Digraph of a Complete Bipartite Digraph

Huiping Cai1,2, Juan Liu1, Jixiang Meng3
1College of Mathemetics Sciences, Xinjiang Normal University, Urumgi, Xinjiang, 880054, P.R.China
2Department of Mathematics, School of Sctence,Shihezi University, Shihezi,Xingiang 882008, P.R.China
3College of Mathematics and System Sciences, Xinjiang University, Urumgi, Xinjiang, 830046, P.R.China
  • Published: 31/10/2012

Abstract

Let \(K_{d,d}\) be a complete bipartite digraph. In this paper, we determine the exact value of the domination number in iterated line digraph of \(K_{d,d}\).

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.

Citation
Huiping Cai, Juan Liu, Jixiang Meng. Domination Number in Iterated Line Digraph of a Complete Bipartite Digraph[J], Ars Combinatoria, Volume 107. 515-520. .