Research Article

Domination Scattering Number in Graphs

Number: 49 December 31, 2024
EN

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.
APA
Kaval, B., & Kırlangıç, A. (2024). Domination Scattering Number in Graphs. Journal of New Theory, 49, 53-61. https://doi.org/10.53570/jnt.1563823
AMA
1.Kaval B, Kırlangıç A. Domination Scattering Number in Graphs. JNT. 2024;(49):53-61. doi:10.53570/jnt.1563823
Chicago
Kaval, Burak, and Alpay Kırlangıç. 2024. “Domination Scattering Number in Graphs”. Journal of New Theory, nos. 49: 53-61. https://doi.org/10.53570/jnt.1563823.
EndNote
Kaval B, Kırlangıç A (December 1, 2024) Domination Scattering Number in Graphs. Journal of New Theory 49 53–61.
IEEE
[1]B. Kaval and A. Kırlangıç, “Domination Scattering Number in Graphs”, JNT, no. 49, pp. 53–61, Dec. 2024, doi: 10.53570/jnt.1563823.
ISNAD
Kaval, Burak - Kırlangıç, Alpay. “Domination Scattering Number in Graphs”. Journal of New Theory. 49 (December 1, 2024): 53-61. https://doi.org/10.53570/jnt.1563823.
JAMA
1.Kaval B, Kırlangıç A. Domination Scattering Number in Graphs. JNT. 2024;:53–61.
MLA
Kaval, Burak, and Alpay Kırlangıç. “Domination Scattering Number in Graphs”. Journal of New Theory, no. 49, Dec. 2024, pp. 53-61, doi:10.53570/jnt.1563823.
Vancouver
1.Burak Kaval, Alpay Kırlangıç. Domination Scattering Number in Graphs. JNT. 2024 Dec. 1;(49):53-61. doi:10.53570/jnt.1563823

Cited By