On the semitotal dominating sets of graphs
Publish place: The Journal of Algebra and Related Topics، Vol: 12، Issue: 2
Publish Year: 1404
Type: Journal paper
Language: English
View: 69
This Paper With 10 Page And PDF Format Ready To Download
- Certificate
- I'm the author of the paper
Export:
Document National Code:
JR_JART-12-2_004
Index date: 25 January 2025
On the semitotal dominating sets of graphs abstract
A set D of vertices in an isolate-free graph G is a semitotal dominating set of G if D is a dominating set of G and every vertex in D is within distance 2 from another vertex of D.The semitotal domination number of G is the minimum cardinality of a semitotal dominating set of G and is denoted by \gamma_{t2}(G). In this paper after computation of semitotal domination number of specific graphs, we count the number of this kind of dominating sets of arbitrary size in some graphs.
On the semitotal dominating sets of graphs Keywords:
On the semitotal dominating sets of graphs authors
H. Zaherifar
Department of Mathematical Sciences, Yazd University, Yazd, Iran
S. Alikhani
Department of Mathematical Sciences, Yazd University, Yazd, Iran
