Please use this identifier to cite or link to this item: https://hdl.handle.net/11499/56698
Title: A variation of distance domination in composite networks
Authors: Aytaç, Vecdi
Şentürk, Fatmana
Keywords: graph operations
graph theory
porous exponential domination
R-corona
R-join
Exponential Domination
Publisher: Wiley
Abstract: Let V be the set of vertex of a graph G. The set S is a dominating set, being a subset of the set V, if every vertex in the set V is in the set S, or if it is neighbor of a vertex in the set S. The number of elements of the set S with the least number of elements is the dominating number of graph G. In this study, we have worked on a type of dominating called porous exponential domination. In this new parameter, while the distance between vertex s and vertex v grows this weight value reduces exponentially. If all vertices in S dominate all vertices of G a with a total weight of at least 1, the set S is named as a porous exponential dominating set of graph G. The cardinality of the set with the least number of elements of the obtained porous exponential domination sets is defined as the porous exponential domination number of graph G. In this paper we compute the porous exponential domination number of the R - graphs under corona and join product.
URI: https://doi.org/10.1002/num.22759
https://hdl.handle.net/11499/56698
ISSN: 0749-159X
1098-2426
Appears in Collections:Mühendislik Fakültesi Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection
WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection

Show full item record



CORE Recommender

SCOPUSTM   
Citations

1
checked on Oct 13, 2024

Page view(s)

30
checked on Aug 24, 2024

Google ScholarTM

Check




Altmetric


Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.