Search
Close this search box.

Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

A Note on Some Domination Parameters in Graph

S. Aparna Lakshmanan1, A. Vijayakumar1
1Department of Mathematics Cochin University of Science and Technology Cochin – 682 022, Kerala, India.
  • Published: 31/05/2009

Abstract

In this paper, we study the domination number, the global domination number, the cographic domination number, the global cographic domination number, and the independent domination number of all the graph products which are non-complete extended \( p \)-sums (NEPS) of two graphs.

Keywords: Domination, non-complete extended p-sums (NEPS), supermultiplicative graphs,submultiplicative graphs 2000 Mathematics Subject Classification: 05C
Information
Guidelines
CP Initiatives
Follow CP
Facebook Twitter Linkedin
1970-2024 CP (Manitoba, Canada) unless otherwise stated.
Citation
S. Aparna Lakshmanan, A. Vijayakumar. A Note on Some Domination Parameters in Graph[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 069. 31-37. DOI: .