Abstract
A porous exponential dominating set of a graph G is a subset S such that, for every vertex v of G, ∑u∈S(1/2)d(u, v)−1 ≥ l, where d(u, v) is the distance between vertices u and v. The porous exponential domination number, γ*e(G), is the minimum cardinality of a porous exponential dominating set. In this paper, we determine porous exponential domination number of the Harary graph Hk,n for all k and n.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
T. W. Haynes, S. T. Hedetniemi, and P. J. Slater, Fundamentals of Domination in Graphs in A Series of Monographs and Text Books (Marcel Dekker Inc., New York, 1998).
M. A. Henning and V. Naicker, “Disjunctive total domination in graphs,” J. Combinatorial Optim. 31 (3), 1090–1110 (2016).
M. A. Henning, “Distance domination in graphs,” in Domination in Graphs: Advanced Topics, Ed. by T. W. Haynes, S. T. Hedetniemi, and P. J. Slater (Marcel Dekker Inc., New York, 1998), pp. 321–350.
P. Dankelmann, D. Day, D. Erwin, S. Mukwembi, and H. Swart, “Domination with exponential decay,” Discrete Mathematics 309 (19), 5877–5883 (2009).
M. Anderson, R. C. Brigham, J. R. Carrington, R. P. Vitray, and J. Yellen, “On exponential domination of Cm × Cn,” AKCE Int. J. Graphs Comb. 6 (3), 341–351 (2009).
A. Aytaç and B. Atay, “On exponential domination of some graphs,” Nonlinear Dyn. Syst. Theory 16 (1), 12–19 (2016).
S. Bessy, P. Ochem, and D. Rautenbach, “Exponential domination in subcubic graphs,” The Electronic Journal of Combinatorics 23 (4), 1–17 (2016).
S. Bessy, P. Ochem, and D. Rautenbach, “Bounds on the exponential domination number,” Discrete Mathematics 340 (3), 494–503 (2017).
M. A. Henning, S. Jäger, and D. Rautenbach, “Relating domination, exponential domination, and porous exponential domination,” Discrete Optimization 23, 81–92 (2017).
J. Beverly, M. Farley, C. McClain, and F. Stover, “Bounding the porous exponential domination number of Apollonian networks,” arXiv:1409.5609 (2014).
F. Harary, “The maximum connectivity of a graph,” Proc. Nat. Acad. Sci. 48 (7), 1142–1146 (1962).
P. Bhabak, Approximation Algorithms for Broadcasting in Simple Graphs with Intersecting Cycles, Doctoral dissertation (Concordia University, 2015).
S. Skiena, “Harary graphs,” in Implementing Discrete Mathematics: Combinatorics and Graph Theory with Mathematica (1990), pp. 179–180.
S. Tanna, “Broadcasting in Harary graphs,” Master Thesis (Concordia University, 2015).
A. P. Kazemi and B. Pahlavsay, “Double total domination in Harary graphs,” Comm. Math. Appl. 8 (1), 1–6 (2017).
A. Khodkar, D. Mojdeh, and A. P. Kazemi, “Domination in Harary graphs,” The Bulletin of ICA 49, 61–78 (2007).
L. J. E. Mary and S. Pavithra, “On 2-rainbow domination number in Harary graphs,” International Journal of Innovative Research in Technology, Science & Engineering (IJIRTSE) 1 (5), 22–29 (2015).
S. H. Yang and H. L. Wang, “A note on the 2-Tuple total domination problem in Harary graphs,” in Computer Symposium (ICS) IEEE, 68–73 (2016).
Author information
Authors and Affiliations
Corresponding authors
Additional information
The article was submitted by the authors for the English version of the journal.
Rights and permissions
About this article
Cite this article
Çiftçi, C., Aytaç, A. Porous Exponential Domination in Harary Graphs. Math Notes 107, 231–237 (2020). https://doi.org/10.1134/S0001434620010228
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0001434620010228