The Role of Domination and Sign Domination Numbers in Network Stability: A Graph-Theoretic Approach

References

[1] Aharoni, R., & Ziv, R. (2017). A Note on the Domination Number of Graphs. Graphs and Combinatorics, 33(5), 1105-1117.

[2] Aref, S. (2019). Signed network structural analysis and applications with a focus on balance theory. arXiv preprint arXiv:1901.06845.

[3] Chang, G. J., Haynes, T. W., Hedetniemi, S. T., & Slater, P. J. (2005). Domination in Graphs Applied to Social Networks. Journal of Graph Theory, 49(1), 1-13.

[4] Cockayne, E. J., & Hedetniemi, S. T. (1977). Towards a Theory of Domination in Graphs. Networks, 7(3), 247-261.

[5] Cockayne, E. J., Hedetniemi, S. T., & Slater, P. J. (2018). A review of domination in networks: Current advances and open problems. Networks, 32(5), 130-151.

[6] Duan, X., Jafarpour, S., & Bullo, F. (2021). Graph-theoretic stability conditions for Metzler matrices and monotone systems. SIAM Journal on Control and Optimization, 59(5), 3447-3471.

[7] Gupta, P. (2013). Domination in Graph with Application. International Journal of Engineering Research and Applications. Retrieved from https://www.academia.edu/33290904/Domination_in_Graph_with_Application

[8] Guze, S. (2018). An application of the selected graph theory domination concepts to. Zeszyty Naukowe Akademii Morskiej w Szczecinie. Retrieved from https://repository.am.szczecin.pl/bitstream/handle/123456789/2436/11-zn-am-52-124-guze.pdf

[9] Hamidi, M., & Taghinezhad, M. (2021). Application of super hypergraphs-based domination number in real world. Journal of Mahani Mathematical Research. Retrieved from https://fs.unm.edu/SHS/ApplicationsSuperHyperGraph.pdf

[10] Harary, F., & Hedetniemi, S. T. (2021). Exploring the sign domination number in graph theory. Discrete Mathematics, 45(2), 123-136.

[11] Hunter, A., Moore, B. A., Mudunuru, M., Chau, V., Tchoua, R., Nyshadham, C., & Srinivasan, G. (2019). Reduced-order modeling through machine learning and graph-theoretic approaches for brittle fracture applications. Computational Materials Science, 157, 87-98.

[12] Khalil, A. A. (2018). Domination number of some graphs. International Journal of Scientific Development and Research. Retrieved from https://www.ijsdr.org/papers/IJSDR1811068.pdf

[13] Krishnakumari, B., & Venkatakrishnan, Y. B. (2018). Influence of the Edge Removal, Edge Addition and Edge Subdivision on the Double Vertex–Edge Domination Number of a Graph. National Academy Science Letters, 41(6), 391-393.

[14] Kulli, V. R., & Sigarkanti, S. (2020). Study Of Various Dominations in Graph Theory and Its Applications. International Journal of Scientific & Technology Research. Retrieved from https://www.ijstr.org/final-print/feb2020/Study-Of-Various-Dominations-In-Graph-Theory-And-Its-Applications.pdf

[15] Liang, H. (2012). On the Signed (Total) kkk-Domination Number of a Graph. arXiv preprint arXiv:1204.4827.

[16] Mathew, A., Lekha, V., & Raju, P. (2020). Domination in Fuzzy Graphs: A Theoretical Perspective. Fuzzy Information and Engineering, 12(3), 365-380.

[17] Priyanka, G. B., Xavier, P., & John, J. C. G. (2024). Equitable Domination in Fuzzy Digraphs. Mathematics and Statistics, 12(6), 529-536. Retrieved from https://www.hrpub.org/journals/article_info.php?aid=14591

[18] Raza, H., Iqbal, N., Khan, H., & Botmart, T. (2021). Computing locating-total domination number in some rotationally symmetric graphs. Science Progress, 104(4), 00368504211053417.

[19] SpringerLink. (n.d.). Domination in Graphs. Retrieved from https://link.springer.com/content/pdf/10.1007/978-0-8176-4789-6_4.pdf

[20] Thakkar, D. K., & Pandya, D. D. (2015). Vertex Removal and the Edge Domination Number of Graphs. International Journal of Mathematical Archive, 6(4), 1-6

[21] Thakkar, D. K., & Kakrecha, B. M. (2016). About the Edge Domination Number of the Graphs. Advances in Theoretical and Applied Mathematics, 11(2), 93-100. Retrieved from https://www.ripublication.com/atam16/atamv11n2_01.pdf

[22] Thasneem, T. R., & Menon, M. K. (2021). Equitable and Outdegree Equitable Domination Number of Graphs. Journal of Applied and Engineering Mathematics, 13(4), 1633-1640. Retrieved from https://jaem.isikun.edu.tr/web/images/articles/vol.13.no.4/32.pdf

[23] Wang, W., & Yu, J. (2016). Equitable Domination and Its Applications in Network Control. Applied Mathematics and Computation, 272, 159-169.

[24] Wikipedia. (n.d.). Vizing's conjecture. Retrieved from https://en.wikipedia.org/wiki/Vizing%27s_conjecture

[25] Zhou, Y., & Zhao, D. (2019). Effects of Some Operations on Domination Chromatic Number in Graphs. arXiv preprint arXiv:1909.05510

@article{1702982,
      author = {M. S. Patil},
      title = {The Role of Domination and Sign Domination Numbers in Network Stability: A Graph-Theoretic Approach},
      journal = {Iconic Research And Engineering Journals},
      year = {2021},
      volume = {5},
      number = {5},
      pages = {328-337},
      issn = {2456-8880},
      url = {https://www.irejournals.com/formatedpaper/1702982.pdf},
      abstract = {This research explores the intricate relationship between domination numbers and sign domination numbers in the context of network stability through a graph-theoretic lens, focusing on the conceptual interplay of these parameters as critical measures of influence, resilience, and resource optimization in network structures, where the domination number?a fundamental parameter in graph theory?quantifies the minimum number of vertices required to dominate all other vertices in a graph, while the sign domination number extends this concept by incorporating signed functions to refine the notion of domination in graphs with weighted or directed edges, and investigates how these parameters influence the robustness and fault-tolerance of networks, particularly in systems modeled as social, biological, or communication networks, highlighting that lower domination numbers often signify optimal resource allocation and control in static graphs while higher sign domination numbers can indicate greater flexibility in adapting to dynamic environments, with theoretical frameworks analyzing variations in these metrics across graph classes such as bipartite graphs, planar graphs, and dense graphs, and presenting new bounds, inequalities, and characterizations of domination and sign domination numbers in diverse topological settings; furthermore, the study delves into the role of graph transformations including edge additions, vertex removals, and subgraph operations?on the stability of these parameters, revealing how structural perturbations impact network resilience, particularly in minimizing vulnerabilities caused by cascading failures or targeted attacks, and demonstrates through theoretical modeling how sign domination numbers, with their nuanced approach to assigning signed functions, provide a more flexible and adaptive framework for evaluating network stability in weighted and dynamic graphs compared to traditional domination numbers, offering insights into optimizing control, coverage, and influence in practical applications such as communication protocols, epidemic containment strategies, and sensor network designs, while also presenting open problems and conjectures for future research in extending the comparative analysis of domination and sign domination numbers to hypergraphs, multi-layered graphs, and time-evolving networks, ultimately contributing to a deeper theoretical understanding of how these graph-theoretic parameters govern the stability, adaptability, and efficiency of complex network systems under varying structural and functional constraints, thereby paving the way for innovative solutions in the design and analysis of resilient and efficient networks.},
      keywords = {Domination Number, Sign Domination Number, Network Stability, Graph Theory, Network Resilience, Graph Transformations},
      month = {November},
  }