Hausdorff of a cycle in topological graph
Abstract
The main purpose of the paper is to bring together two areas in which strong relation, graph theory and topological spaces. And derive interesting formula for the set that contains all minimal dominating sets(MDS) and ( -set). Some separation axioms are discussed in topological graph theory, especially in a cycle graph Cn.
Downloads
References
M. C. Gemignani, Elementry Topology , second edition, wesely publishing company , 1972. MR 0217749
K. P. Hart, et al., Encyclopaedia of General Topology ,Elsevier, Amsterdam (2004).
T. W. Haynes, S. T. Hedetniemi, P. J. Slater (Eds.), Fundamentals of Domination in Graphs, Marcel Dekker, Inc., New York, 1998.
A. A.Jabor, A. A.Omran, Domination in Discrete Topology Graph, Third International Conference of Science(ICMS2019), Vol.2183(2019). DOI: https://doi.org/10.1063/1.5136110
A. A.Omran, H. H. Oda, Hn-domination in Graphs, Baghdad Science Journal, 2019, Vol.16(1):242-247. DOI: https://doi.org/10.21123/bsj.16.1.(suppl.).0242
A. A.Omran, R. Yasen, Some Properties of Frame domination in Graphs, JEAS, 2017, 12(10 SI): 882-885.
O. Ya.Viro, O. A. Ivanov, N. Yu. Netsvetaev, and V. M. Kharlamov; Elementary Topology, Problem Textbook ; 2008; DOI: https://doi.org/10.1090/mbk/054
R. J. Wilson, Introduction to Graph Theory, Fourth Edition, Addison-Wesley Longman, 1996.
Copyright (c) 2022 Boletim da Sociedade Paranaense de Matemática
This work is licensed under a Creative Commons Attribution 4.0 International License.
When the manuscript is accepted for publication, the authors agree automatically to transfer the copyright to the (SPM).
The journal utilize the Creative Common Attribution (CC-BY 4.0).
