International Journal For Research In Mathematics And Statistics

Vol. 5 No. 3 (2019): International Journal For Research In Mathematics And Statistics (ISSN: 2208-2662)
Articles

Characterizations of Connected Perfect Domination in Graphs

FULL-TEXT-PDF
  • Christine Cimeni Hormillada
Christine Cimeni Hormillada
College of Teacher Education, Bohol Island State University-Calape Campus 6328 San Isidro Calape Bohol, Philippines
DOI: https://doi.org/10.53555/ms.v5i3.820

Published 2019-03-31

Keywords

  • Domination,
  • Connected Domination,
  • Perfect Domination,
  • connected perfect domination

How to Cite

Hormillada, C. C. (2019). Characterizations of Connected Perfect Domination in Graphs. International Journal For Research In Mathematics And Statistics, 5(3), 09-`12. https://doi.org/10.53555/ms.v5i3.820

Copyright (c) 2019 International Journal For Research In Mathematics And Statistics (ISSN: 2208-2662)

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Abstract

A subset  of  is a connected perfect dominating set of  if  is both connected and perfect dominating set of . The connected perfect domination number of  denoted by  is the cardinality of the smallest connected perfect dominating set of . A connected perfect dominating set of  with cardinality equal to  is called a  of . This paper shows some charaterization of a connected dominating set and the values or bounds of the parameter were determined. It also characterizes the connected perfect dominating set in the join and corona of graphs and the corresponding values of the parameter were also determined.

 

FULL-TEXT-PDF

Downloads

Download data is not yet available.

References

  1. M. Chellali, F. Maffray, and K. Tablennehas, Connected domination DOT-critical graphs. Contributions to Discrete Mathematics, 5 (2010), no. 2, 11–25.
  2. I. Dejter, A. Delgado, Perfect domination in rectangular grid graphs. Australasian J. of Combinatorics, accepted for publication.
  3. C.E. Go, and S.R. Canoy, Jr., Domination in the corona and join of graphs. International Mathematical Forum, 6 (2011), no. 16, 763–771.
  4. M. Livingston and Q. F. Stout, Perfect Dominating Sets. Congr. Numer., 79 (1990), 187–203.
  5. B.F.Tubo, S.R.Canoy, Restrained Perfect Domination in Graphs. International Journal of Mathematical Analysis Vol. 9, 2015, no. 25, 1231–1240.
  6. E.Sampathkumar and H.B. Walikar, The connected domination number of a graph. Math. Physi. Sci. 13 (1979), 607–613.
  7. C. Yen, R.C.T. Lee, The weighted perfect domination problem and its variants. Discrete Applied Mathematics 66 (1996) 147–160.