LOWER BOUND ON DOMINATION NUMBER OF CARTESIAN PRODUCTS OF ODD CYCLES

ALI DINO JUMANI

Abstract


Let γ (G) denote the domination number of a graph G . Let n C denote the cycle where n is a positive integer with 5 < n . In this note, a lower bound on the domination number of the Cartesian product of two cycles 5 C and n C is characterized such that
5
( ) 3 2 2
n 4 4
γ C C n n
⎡ − ⎤ ⎡ ⎤ ≥ ⎢ ⎥ + ⎢ ⎥ ⎢ ⎥ ⎢ ⎥


Full Text:

PDF

Refbacks

  • There are currently no refbacks.


Copyright (c) 2015 Sindh University Research Journal - SURJ (Science Series)

 Copyright © University of Sindh, Jamshoro. 2017 All Rights Reserved.
Printing and Publication by: Sindh University Press.