Independent strong domination in complementary prisms

Let G = (V, E) be a graph and u,v ∈ V. Then, u strongly dominates  v if (i) uv ∈ E  and (ii) deg(u) ≥ deg(v). A set D ⊂ V  is a strong-dominating set of  G  if every vertex in V-D is strongly dominated by at least one vertex in D. A set D ⊆ V  is an independent set if no two vertices of D  are adjac...

Full description

Saved in:
Bibliographic Details
Main Authors: Berberler, Zeynep Nihan; Faculty of Science, Department of Computer Science, Dokuz Eylul University, 35160, Izmir/Turkey (Author), Berberler, Murat Ersen; Faculty of Science, Department of Computer Science, Dokuz Eylul University, 35160, Izmir/Turkey (Author)
Format: EJournal Article
Published: GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB, 2020-04-01.
Subjects:
Online Access:Get Fulltext
Tags: Add Tag
No Tags, Be the first to tag this record!
LEADER 02378 am a22002533u 4500
001 EJGTA_466_pdf_121
042 |a dc 
100 1 0 |a Berberler, Zeynep Nihan; Faculty of Science, Department of Computer Science, Dokuz Eylul University, 35160, Izmir/Turkey  |e author 
100 1 0 |e contributor 
700 1 0 |a Berberler, Murat Ersen; Faculty of Science, Department of Computer Science, Dokuz Eylul University, 35160, Izmir/Turkey  |e author 
245 0 0 |a Independent strong domination in complementary prisms 
260 |b GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB,   |c 2020-04-01. 
500 |a https://www.ejgta.org/index.php/ejgta/article/view/466 
520 |a Let G = (V, E) be a graph and u,v ∈ V. Then, u strongly dominates  v if (i) uv ∈ E  and (ii) deg(u) ≥ deg(v). A set D ⊂ V  is a strong-dominating set of  G  if every vertex in V-D is strongly dominated by at least one vertex in D. A set D ⊆ V  is an independent set if no two vertices of D  are adjacent. The independent strong domination number is(G) of a graph G is the minimum cardinality of a strong dominating set which is independent. Let Ġ   be the complement of a graph G. The complementary prism GĠ  of G  is the graph formed from the disjoint union of G  and  Ġ by adding the edges of a perfect matching between the corresponding vertices of G and Ġ. In this paper, we consider the independent strong domination in complementary prisms, characterize the complementary prisms with small independent strong domination numbers, and investigate the relationship between independent strong domination number and the distance-based parameters. 
540 |a Copyright (c) 2020 Electronic Journal of Graph Theory and Applications (EJGTA) 
546 |a eng 
690 |a domination, independent strong domination, complementary prisms, corona product 
655 7 |a info:eu-repo/semantics/article  |2 local 
655 7 |a info:eu-repo/semantics/publishedVersion  |2 local 
655 7 |a Peer-reviewed Article  |2 local 
786 0 |n Electronic Journal of Graph Theory and Applications (EJGTA); Vol 8, No 1 (2020): Electronic Journal of Graph Theory and Applications; 1 - 8 
786 0 |n 2338-2287 
787 0 |n https://www.ejgta.org/index.php/ejgta/article/view/466/pdf_121 
856 4 1 |u https://www.ejgta.org/index.php/ejgta/article/view/466/pdf_121  |z Get Fulltext