Independent Semitotal Domination in the Join of Graphs
Bryan L. Susada, Rolito G. Eballe
Asian Research Journal of Mathematics · pp. 25–31 · Published 27 Feb 2023
10.9734/arjom/2023/v19i3647Abstract
A subset W \(\subseteq\) V (G) of a graph G is an independent semitotal dominating set of G, abbreviated ISTd-set of G, if W is an independent dominating set of G and every element of W is exactly of distance 2 from at least one other element of W. The independent semitotal domination number of G, denoted by \(\gamma\)it2(G), is the minimum cardinality of an ISTd-set of G. In this paper, we study the concept of independent semitotal domination in graphs and investigate the conditions for graphs on which the ISTd-sets exist. Further, the ISTd-sets of the join of any two graphs are examined. Consequently, the corresponding independent semitotal domination number of these graphs are obtained.
Cited by 3
Zeliha Kartal Yıldız · Journal of New Theory · 2025
A. Cabrera-Martínez, J. L. López-Carmona, A. Serrano-Díaz · Mediterranean Journal of Mathematics · 2025
Showing 2 of 3 known citations — external sources report more than can currently be individually listed.
Related research
- Maximum Linear Forest of Graphs Resulting from Some Binary Operations — shares topic coverage
Article metrics
Real usage data collected on this platform.
0
Page views
0
PDF downloads
0
Outbound clicks
3
Citations
Views by country
Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".
No views recorded yet.
Traffic sources
Referring site, by host.
No traffic recorded yet.
Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.