On planar domination in graphs
Let G be a finite, undirected, simple graph with no isolated vertices. A new model of graph domination is introduced in this paper, and named “planar domination”. The properties of planar domination number are determined. Also, the relation between the domination number and planer domination number is discussed. the size of graph having planar domination number is calculated.
Authors
- Manal N. Al-Harere (ORCID: https://orcid.org/0000-0003-1125-4439)
- Emad Bakr Al-Zangana (ORCID: https://orcid.org/0000-0001-6415-1930)
- Doha Adel Abbass
Publication Details
- Journal
- Journal of Discrete Mathematical Sciences and Cryptography
- Published
- 2025-01-01
- DOI
- https://doi.org/10.47974/jdmsc-2274
- Citations
- 1
- Primary Topic
- Advanced Graph Theory Research
- Type
- article
- Field-Weighted Citation Impact
- 1.50