We employ the concept of total domination to introduce a new separation axiom called T₀ axiom in simple graphs. The T₀ axiom in graphs introduced in this paper is analogous to the T₀ axiom in topology. This paper provides an in-depth study of the T₀ property in transformation graphs G^xyz.

total domination, transformation graphs.

Received: November 27, 2024; Accepted: December 17, 2024; Published: January 2, 2025

How to cite this article: A. R. Latheeshkumar,  graphs, Advances and Applications in Discrete Mathematics 42(3) (2025), 205-217. https://doi.org/10.17654/0974165825014

This Open Access Article is Licensed under Creative Commons Attribution 4.0 International License

References:
[1] R. Balakrishnan and K. Ranganathan, A Textbook of Graph Theory, Springer Science & Business Media, 2012.
[2] G. Chartrand and P. Zhang, Introduction to Graph Theory, Tata McGraw-Hill Edition, 2006.
[3] M. A. Henning and A. Yeo, Total Domination in Graphs, Springer, 2013.
[4] A. R. Latheeshkumar and V. Anil Kumar, Total domination polynomials of some graphs, Journal of Pure and Applied Mathematics: Advances and Applications 16 (2016), 97-108.
[5] V. Seena and R. Pilakkat, Hausdorff graph, British Journal of Mathematics and Computer Science 12(1) (2016), 1-12.
[6] B. Wu, L. Zhang and Z. Zhang, The transformation graph when Discrete Mathematics 296 (2005), 263-270.