Domination Scattering Number in Graphs

Abstract

Scattering number measures the stability of a graph by determining how well vertices are spread throughout the graph. However, it may not always be distinctive for different graphs, especially when comparing the same scattering numbers. In this study, we aim to provide a more nuanced and sensitive measure of stability for graphs by introducing domination scattering numbers, a new measure of graph stability. This parameter likely captures additional structural characteristics or dynamics within the graph that contribute to its stability or resilience. Moreover, we investigate the domination scattering numbers of the graphs $P_n$, $C_n$, $K_{1,n}$, $K_{m,n}$, and $P_n\times C_3$.

Keywords

• Vulnerability
• domination number
• scattering number

References

1. C. A. Barefoot, R. Entringer, H. Swart, Vulnerability in graphs -- A comparative survey, Journal of Combinatorial Mathematics and Combinatorial Computing 1 (1987) 13-22.
2. Z. N. Berberler, A. Aytaç, Node and link vulnerability in complete multipartite networks, International Journal of Foundations of Computer Science 35 (4) (2024) 375-385.
3. S. Zhang, Z. Wang, Scattering number in graphs, Networks 37 (2001) 102-106.
4. W. Chen, S. Renqian, Q. Ren, X. Li, Tight toughness, isolated toughness and binding number bounds for the path-cycle factors, International Journal of Computer Mathematics: Computer Systems Theory 8 (4) (2023) 235-241.
5. H. Chen, J. Li, l-connectivity, integrity, tenacity, toughness and eigenvalues of graphs, Bulletin of the Malaysian Mathematical Sciences Society 45 (6) (2022) 3307-3320.
6. F. Harary, Graph theory, CRC Press, Boca Raton, 2018.
7. H. A. Jung, On a class of posets and the corresponding comparability graphs, Journal of Combinatorial Theory Series B 24 (2) (1978) 125-133.
8. Ş. Onur, G. B. Turan, Geodetic domination integrity of thorny graphs, Journal of New Theory (46) (2024) 99-109.

9. Y. Sun, C. Wu, X. Zhang, Z. Zhang, Computation and algorithm for the minimum k-edge-connectivity of graphs, Journal of Combinatorial Optimization 44 (3) (2022) 1741-1752.
10. L. Vasu, R. Sundareswaran, R. Sujatha, Domination weak integrity in graphs, Bulletin of the International Mathematical Virtual Institute 10 (1) (2020) 181-187.
11. S. Zhang, S. Peng, Relationships between scattering number and other vulnerability parameters, International Journal of Computer Mathematics 81 (3) (2004) 291-298.
12. J. Xu, Theory and application of graphs, Springer, New York, 2003.
13. S. Varghese, B. Babu, An overview on graph products, International Journal of Science and Research Archive 10 (1) (2023) 966-971.
14. B. Kaval, A. Kırlangıç, Scattering number and cartesian product of graphs, Bulletin of the International Mathematical Virtual Institute 8 (2018) 401-412.
15. A. Kırlangıç,A measure of graph vulnerability: Scattering number, International Journal of Mathematics and Mathematical Sciences 30 (1) (2002) 1-8.
16. L. Markenzon, C. F. Waga, The scattering number of strictly chordal graphs: Linear time determination, Graphs and Combinatorics 38 (3) (2022) 102 14 pages.
17. J. Wang, Y. Sun, Scattering number of digraphs, Applied Mathematics and Computation 466 (2024) Article ID 128475 6 pages.
18. E. Aslan, Measure of graphs vulnerability: Edge scattering number, Bulletin of the International Mathematical Virtual Institute 4 (2014) 53-60.
19. Ö. K. Kükçü, E. Aslan, A comparison between edge neighbor rupture degree and edge scattering number in graphs, International Journal of Foundations of Computer Science 29 (7) (2018) 1119-1142.
20. R. Sundareswaran, V. Swaminathan, Domination integrity in trees, Bulletin of the International Mathematical Virtual Institute 2 (2012) 153-161.
21. P. Pavlic, J. Zerovnik, A note on the domination number of the cartesian products of paths and cycles, Kragujevac Journal of Mathematics 37 (2) (2013) 275-285.