On the Domination Number of Cartesian Product of Two Directed Cycles
Denote by γ(G) the domination number of a digraph G and Cm□Cn the Cartesian product of Cm and Cn, the directed cycles of length m,n≥2. In 2010, Liu et al. determined the exact values of γ(Cm□Cn) for m=2,3,4,5,6. In 2013, Mollard determined the exact values of γ(Cm□Cn) for m=3k+2. In this paper, we g...
Saved in:
Main Authors: | Zehui Shao, Enqiang Zhu, Fangnian Lang |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2013-01-01
|
Series: | Journal of Applied Mathematics |
Online Access: | http://dx.doi.org/10.1155/2013/619695 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Connection Number- Based Topological Indices of Cartesian Product of Graphs
by: Aiman Arshad, et al.
Published: (2023-01-01) -
Animals and Cartesian Consciousness: Pardies vs. the Cartesians
by: Evan Thomas
Published: (2020-09-01) -
Cartesian Products of Some Regular Graphs Admitting Antimagic Labeling for Arbitrary Sets of Real Numbers
by: Yi-Wu Chang, et al.
Published: (2021-01-01) -
Two Sufficient Conditions for Hamilton and Dominating Cycles
by: Zh. G. Nikoghosyan
Published: (2012-01-01) -
Eccentric Harmonic Index for the Cartesian Product of Graphs
by: Kamel Jebreen, et al.
Published: (2022-01-01)