Maximal Semitotal-Point Domination in Graphs
Author & Affiliation:
B. Basavanagoud (b.basavanagoud@gmail.com)
Department of Mathematics, Karnatak University, Dharwad - 580 003 (INDIA)
S.M. Hosamani
Department of Mathematics, Karnatak University, Dharwad - 580 003 (INDIA)
S.H. Malghan
Department of Mathematics, Karnatak University, Dharwad - 580 003 (INDIA)
Keyword:
domination number, maximal domination number, maximal semitotal-point domination number
Issue Date:
December 2010
Abstract:
Let G= (V, E) be a graph.Then the semitotal-point graph is denoted byT2 (G) = H. Let the vertices and edges of G be the elements of G A dominating set D of a graph H is a maximal dominating set of H if V (H) - D is not a dominating set of H. The maximal semitotal-point (MSP) domination number Y mtp (G) of G is the minimum cardinality of a MSP dominating set of H. In this paper many bounds on Y mtp (G) are obtained in terms of elements of G but not the elements of H. Also its relationship with other domination parameters are investigated.
Pages:
711-718
ISSN:
2319-8044 (Online) - 2231-346X (Print)
Source:
PDF:
DOI:
jusps-A
Share This:
Copy the following to cite this article:
B. Basavanagoud; S. Hosamani; S. Malghan, "Maximal Semitotal-Point Domination in Graphs", Journal of Ultra Scientist of Physical Sciences, Volume 22, Issue 3, Page Number 711-718, 2018Copy the following to cite this URL:
B. Basavanagoud; S. Hosamani; S. Malghan, "Maximal Semitotal-Point Domination in Graphs", Journal of Ultra Scientist of Physical Sciences, Volume 22, Issue 3, Page Number 711-718, 2018Available from: https://www.ultrascientist.org/paper/948/
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License
