Hausdorff of a cycle in topological graph

Auteurs-es

DOI :

https://doi.org/10.5269/bspm.52013

Résumé

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.

Références

1. M. C. Gemignani, Elementry Topology , second edition, wesely publishing company , 1972. MR 0217749
2. K. P. Hart, et al., Encyclopaedia of General Topology ,Elsevier, Amsterdam (2004).
3. T. W. Haynes, S. T. Hedetniemi, P. J. Slater (Eds.), Fundamentals of Domination in Graphs, Marcel Dekker, Inc., New York, 1998.
4. A. A.Jabor, A. A.Omran, Domination in Discrete Topology Graph, Third International Conference of Science(ICMS2019), Vol.2183(2019).
5. A. A.Omran, H. H. Oda, Hn-domination in Graphs, Baghdad Science Journal, 2019, Vol.16(1):242-247.
6. A. A.Omran, R. Yasen, Some Properties of Frame domination in Graphs, JEAS, 2017, 12(10 SI): 882-885.
7. O. Ya.Viro, O. A. Ivanov, N. Yu. Netsvetaev, and V. M. Kharlamov; Elementary Topology, Problem Textbook ; 2008;
8. R. J. Wilson, Introduction to Graph Theory, Fourth Edition, Addison-Wesley Longman, 1996.

Téléchargements

Publié

2022-12-26

Numéro

Rubrique

Research Articles