Outer independent global dominating set of trees and unicyclic graphs

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...

Full description

Saved in:
Bibliographic Details
Main Authors: Mojdeh, Doost Ali; Department of Mathematics, University of Mazandaran, Babolsar, Iran (Author), Alishahi, Mortaza; Department of Mathematics, Islamic Azad University, Nazarabad Branch, Nazarabad, Iran, and Department of Mathematics, University of Tafresh, Tafresh, Iran (Author)
Other Authors: Partialy by Univesity of Tafresh (Contributor)
Format: EJournal Article
Published: GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB, 2019-04-05.
Subjects:
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
Online Access:Get Fulltext
Tags: Add Tag
No Tags, Be the first to tag this record!

Internet

Get Fulltext

3rd Floor Main Library

Holdings details from 3rd Floor Main Library
Call Number: A1234.567
Copy 1 Available

Similar Items