Araştırma Makalesi
BibTex RIS Kaynak Göster

Protection of a network by complete secure domination

Yıl 2022, Cilt: 9 Sayı: 1, 47 - 55, 15.01.2022
https://doi.org/10.13069/jacodesmath.1056581

Öz

A complete secure dominating set of a graph $G$ is a dominating set $D \subseteq V(G)$ with the property that for each $v \in D$, there exists $F=\lbrace v_{j} \vert v_{j} \in N(v) \cap (V(G)-D)\rbrace$, such that for each $v_{j} \in F$, $( D-\lbrace v \rbrace) \cup \lbrace v_{j} \rbrace$ is a dominating set. The minimum cardinality of any complete secure dominating set is called the complete secure domination number of $G$ and is denoted by $\gamma_{csd}(G)$. In this paper, the bounds for complete secure domination number for some standard graphs like grid graphs and stacked prism graphs in terms of number of vertices of $G$ are found and also the bounds for the complete secure domination number of a tree are obtained in terms of different parameters of $G$.

Kaynakça

  • [1] V. Anandam, Harmonic functions and potentials on finite and infinite networks, Springer, Heidelberg, Bologna (2011).
  • [2] S. Axler, P. Bourdon, W. Ramey, Harmonic function theory, Springer-Verlag, New York (2001).
  • [3] N. L. Biggs, Discrete mathematics, Clarendon Press, Oxford University Press, New York (1985).
  • [4] P. Cartier, Fonctions harmoniques sur un arbre, Sympos. Math. 9 (1972) 203–270.
  • [5] J. M. Cohen, F. Colonna, The Bloch space of a homogeneous tree, Bol. Soc. Mat. Mex. 37 (1992) 63–82.
  • [6] E. Nelson, A proof of Liouville’s theorem, Proc. Amer. Math. Soc. 12(6) (1961) 995.
  • [7] W. Woess, Random walks on infinite graphs and groups, Cambridge University Press (2000).
Yıl 2022, Cilt: 9 Sayı: 1, 47 - 55, 15.01.2022
https://doi.org/10.13069/jacodesmath.1056581

Öz

Kaynakça

  • [1] V. Anandam, Harmonic functions and potentials on finite and infinite networks, Springer, Heidelberg, Bologna (2011).
  • [2] S. Axler, P. Bourdon, W. Ramey, Harmonic function theory, Springer-Verlag, New York (2001).
  • [3] N. L. Biggs, Discrete mathematics, Clarendon Press, Oxford University Press, New York (1985).
  • [4] P. Cartier, Fonctions harmoniques sur un arbre, Sympos. Math. 9 (1972) 203–270.
  • [5] J. M. Cohen, F. Colonna, The Bloch space of a homogeneous tree, Bol. Soc. Mat. Mex. 37 (1992) 63–82.
  • [6] E. Nelson, A proof of Liouville’s theorem, Proc. Amer. Math. Soc. 12(6) (1961) 995.
  • [7] W. Woess, Random walks on infinite graphs and groups, Cambridge University Press (2000).
Toplam 7 adet kaynakça vardır.

Ayrıntılar

Birincil Dil İngilizce
Konular Mühendislik
Bölüm Makaleler
Yazarlar

Girish V. Rajasekharaiah Bu kişi benim 0000-0002-0036-6542

Usha P. Murthy Bu kişi benim 0000-0001-9855-1887

Umesh Subramanya Bu kişi benim

Erken Görünüm Tarihi 31 Ocak 2022
Yayımlanma Tarihi 15 Ocak 2022
Yayımlandığı Sayı Yıl 2022 Cilt: 9 Sayı: 1

Kaynak Göster

APA Rajasekharaiah, G. V., Murthy, U. P., & Subramanya, U. (t.y.). Protection of a network by complete secure domination. Journal of Algebra Combinatorics Discrete Structures and Applications, 9(1), 47-55. https://doi.org/10.13069/jacodesmath.1056581
AMA Rajasekharaiah GV, Murthy UP, Subramanya U. Protection of a network by complete secure domination. Journal of Algebra Combinatorics Discrete Structures and Applications. 9(1):47-55. doi:10.13069/jacodesmath.1056581
Chicago Rajasekharaiah, Girish V., Usha P. Murthy, ve Umesh Subramanya. “Protection of a Network by Complete Secure Domination”. Journal of Algebra Combinatorics Discrete Structures and Applications 9, sy. 1 t.y.: 47-55. https://doi.org/10.13069/jacodesmath.1056581.
EndNote Rajasekharaiah GV, Murthy UP, Subramanya U Protection of a network by complete secure domination. Journal of Algebra Combinatorics Discrete Structures and Applications 9 1 47–55.
IEEE G. V. Rajasekharaiah, U. P. Murthy, ve U. Subramanya, “Protection of a network by complete secure domination”, Journal of Algebra Combinatorics Discrete Structures and Applications, c. 9, sy. 1, ss. 47–55, doi: 10.13069/jacodesmath.1056581.
ISNAD Rajasekharaiah, Girish V. vd. “Protection of a Network by Complete Secure Domination”. Journal of Algebra Combinatorics Discrete Structures and Applications 9/1 (t.y.), 47-55. https://doi.org/10.13069/jacodesmath.1056581.
JAMA Rajasekharaiah GV, Murthy UP, Subramanya U. Protection of a network by complete secure domination. Journal of Algebra Combinatorics Discrete Structures and Applications.;9:47–55.
MLA Rajasekharaiah, Girish V. vd. “Protection of a Network by Complete Secure Domination”. Journal of Algebra Combinatorics Discrete Structures and Applications, c. 9, sy. 1, ss. 47-55, doi:10.13069/jacodesmath.1056581.
Vancouver Rajasekharaiah GV, Murthy UP, Subramanya U. Protection of a network by complete secure domination. Journal of Algebra Combinatorics Discrete Structures and Applications. 9(1):47-55.