Outer independent global dominating set of trees and unicyclic graphs
Let G be a graph. A set D ⊆ V(G) is a global dominating set of G if D is a dominating set of G and $\overline G$. γg(G) denotes global domination number of G. A set D ⊆ V(G) is an outer independent global dominating set (OIGDS) of G if D is a global dominating set of G and V(G) − D is an independent...
Saved in:
Main Authors: | , |
---|---|
Other Authors: | |
Format: | EJournal Article |
Published: |
GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB,
2019-04-05.
|
Subjects: | |
Online Access: | Get Fulltext |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
LEADER | 02291 am a22002533u 4500 | ||
---|---|---|---|
001 | EJGTA_171_pdf_100 | ||
042 | |a dc | ||
100 | 1 | 0 | |a Mojdeh, Doost Ali; Department of Mathematics, University of Mazandaran, Babolsar, Iran |e author |
100 | 1 | 0 | |a Partialy by Univesity of Tafresh |e contributor |
700 | 1 | 0 | |a Alishahi, Mortaza; Department of Mathematics, Islamic Azad University, Nazarabad Branch, Nazarabad, Iran, and Department of Mathematics, University of Tafresh, Tafresh, Iran. |e author |
245 | 0 | 0 | |a Outer independent global dominating set of trees and unicyclic graphs |
260 | |b GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB, |c 2019-04-05. | ||
500 | |a https://www.ejgta.org/index.php/ejgta/article/view/171 | ||
520 | |a Let G be a graph. A set D ⊆ V(G) is a global dominating set of G if D is a dominating set of G and $\overline G$. γg(G) denotes global domination number of G. A set D ⊆ V(G) is an outer independent global dominating set (OIGDS) of G if D is a global dominating set of G and V(G) − D is an independent set of G. The cardinality of the smallest OIGDS of G, denoted by γgoi(G), is called the outer independent global domination number of G. An outer independent global dominating set of cardinality γgoi(G) is called a γgoi-set of G. In this paper we characterize trees T for which γgoi(T) = γ(T) and trees T for which γgoi(T) = γg(T) and trees T for which γgoi(T) = γoi(T) and the unicyclic graphs G for which γgoi(G) = γ(G), and the unicyclic graphs G for which γgoi(G) = γg(G). | ||
540 | |a Copyright (c) 2019 Electronic Journal of Graph Theory and Applications (EJGTA) | ||
546 | |a eng | ||
690 | |a global domination, outer independent global dominating set, tree, unicyclic graph | ||
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 7, No 1 (2019): Electronic Journal of Graph Theory and Applications; 121-145 | |
786 | 0 | |n 2338-2287 | |
787 | 0 | |n https://www.ejgta.org/index.php/ejgta/article/view/171/pdf_100 | |
856 | 4 | 1 | |u https://www.ejgta.org/index.php/ejgta/article/view/171/pdf_100 |z Get Fulltext |