Premium
Porous exponential domination number of some graphs
Author(s) -
Çiftçi Canan,
Aytaç Aysun
Publication year - 2021
Publication title -
numerical methods for partial differential equations
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.901
H-Index - 61
eISSN - 1098-2426
pISSN - 0749-159X
DOI - 10.1002/num.22585
Subject(s) - mathematics , exponential function , combinatorics , dominating set , cardinality (data modeling) , double exponential function , graph , discrete mathematics , vertex (graph theory) , mathematical analysis , computer science , data mining
Let G be a graph and S ⊆ V ( G ) . If∑ u ∈ S1 2 d ( u , v ) − 1≥ 1 for all v ∈ V ( G ) , then S is a porous exponential dominating set for G , where d ( u , v ) is the distance between vertices u and v . The smallest cardinality of a porous exponential dominating set is the porous exponential domination number of G and is denoted byγ e * ( G ) . In this article, we examine porous exponential domination number of some shadow graphs and trees such as comet, double comet, double star, binomial tree, and generalized caterpillar graphs.