On Domination Number of Mixed-Grid Graph

Volume 2 - Issue 3

Ramy Shaheen*

Received: February 03, 2020;   Published: February 27, 2020

DOI: 10.26717/CTBB.MS.ID.000137

Full Text PDF

To view the Full Article   Peer-reviewed Article PDF

Abstract

A mixed graph GM (V, E, A) is a graph containing unoriented edges (set E) as well as oriented edges (set A), referred to as arcs. In this paper we calculate the domination number of the Cartesian product of a path Pm with directed path Pn (mixed-grid graph p_m × p_n) for some values of m and arbitrary n.

Keywords: graph, directed graph, Cartesian product, path, directed path, mixed graph, mixed-grid graph, dominating set, domination number.

Abstract| Introduction| Main Results| References|