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...
Saved in:
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!
|
Similar Items
-
Open-independent, open-locating-dominating sets
by: Seo, Suk J.; Computer Science Department, Middle Tennessee State University, Murfreesboro, TN 37132, U.S.A, et al.
Published: (2017) -
Unique response strong Roman dominating functions of graphs
by: Mojdeh, Doost Ali; Department of Mathematics, University of Mazandaran, Babolsar, Iran, et al.
Published: (2021) -
On the k-rainbow domination in graphs with bounded tree-width
by: Meybodi, M. Alambardar; Department of Applied Mathematics and Computer Science, Faculty of Mathematics and Statistics, University of Isfahan, Iran, et al.
Published: (2021) -
Domination number of the non-commuting graph of finite groups
by: Vatandoost, Ebrahim; Department of Mathematics, Faculty of Science, Imam Khomeini International University, Qazvin, Iran, et al.
Published: (2018) -
Outer independent global dominating set of trees and unicyclic graphs
by: Mojdeh, Doost Ali; Department of Mathematics, University of Mazandaran, Babolsar, Iran, et al.
Published: (2019)