A study on various domination numbers related to Security process of Hexagonal star Network and comparison and non – comparison of this Network domination numbers

Authors

  • Thangam P, Angelin Kavitha Raj S

Keywords:

secure, co – secure, strong, perfect secure, perfect co – secure domination number, Hexagonal star Networks.

Abstract

Graph theory on networks plays a momentous role composed of operators (vertices) and itslinked connections (edges). To scrutinize the properties, pathways and connections of networks, thetool like graph related parameters are imperative. Dominating set of a graph is subset of vertices, whose

References

Ali N.A.Koam, Ali Ahmad, M.Fizza Nadeem, Comparative study of valency – based Topological descriptor for Hexagon Star Network, Computer systems science and Engineering

(2021), vol 36, Iss 2, pp: 293 – 306.https://doi.org/10.32604/csse.2021.014896

Ana klobucar Barisic, Antoaneta Klobucar, Double total domination number in certain chemical graphs, AIMS Mathematics (2022), vol 7, Iss 11, pp: 19629 – 19640. https://doi.org/10.3934/math.20221076

Downloads

Published

2024-06-15

How to Cite

Thangam P, Angelin Kavitha Raj S. (2024). A study on various domination numbers related to Security process of Hexagonal star Network and comparison and non – comparison of this Network domination numbers . Journal of Computational Analysis and Applications (JoCAAA), 33(06), 2157–2173. Retrieved from https://eudoxuspress.com/index.php/pub/article/view/3177

Issue

Section

Articles