Domination Number of Square of Cartesian Products of Cycles - Open Journal of Discrete Mathematics

OJDM > Vol.5 No.4, October 2015

Domination Number of Square of Cartesian Products of Cycles ()

HTML XML

Download as PDF (Size: 553KB) PP. 88-94

DOI: 10.4236/ojdm.2015.54008 4,316 Downloads 6,064 Views Citations

Author(s)

Morteza Alishahi^*, Sakineh Hoseini Shalmaee

Affiliation(s)

Islamic Azad University, Nazarabad Branch.

ABSTRACT

A set

is a dominating set of G if every vertex of

is adjacent to at least one vertex of S. The cardinality of the smallest dominating set of G is called the domination number of G. The square G² of a graph G is obtained from G by adding new edges between every two vertices having distance 2 in G. In this paper we study the domination number of square of graphs, find a bound for domination number of square of Cartesian product of cycles, and find the exact value for some of them.

KEYWORDS

Domination Number, Square of a Graph, Cartesian Product

Share and Cite:

Alishahi, M. and Shalmaee, S. (2015) Domination Number of Square of Cartesian Products of Cycles. Open Journal of Discrete Mathematics, 5, 88-94. doi: 10.4236/ojdm.2015.54008.

Journals Menu

Follow SCIRP

	+1 323-425-8868
	customer@scirp.org
	+86 18163351462(WhatsApp)
	1655362766

	Paper Publishing WeChat

Journals Menu

Home

About SCIRP

Service

Policies