Vol. 1 No. 2 (2017): Vol 1, Iss 2, Year 2017
Degree Equitable Domination in Semigraphs
Published December 30, 2017
- Adjacency domination, end vertex adjacency domination, consecutive adjacency domination and degree equitable domination.
How to Cite
kumar, S., & M, H. (2017). Degree Equitable Domination in Semigraphs. Journal of Computational Mathematica, 1(2), 40-45. https://doi.org/10.26524/cm14
Let G = (V, X) be a semigraph. The concepts of adjacency domination number, end vertex adjacency domination number and consecutive adjacency domination number of a semigraph is introduced and studied in . Here an attempt is made to study the concept of degree equitable domination number  for these three parameters and obtained characterizations for degree equitable minimal (consecutive) adjacency domination number for semigraph.
Download data is not yet available.