Volume 8, Issue 2 (Vol. 8,No. 2, 2022)                   mmr 2022, 8(2): 138-151 | Back to browse issues page

XML Persian Abstract Print


Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

erfanianoraei dehrokhi H, erfanian oraei M. Topology coloring. mmr 2022; 8 (2) :138-151
URL: http://mmr.khu.ac.ir/article-1-3034-en.html
1- , hamiderfanian23@yahoo.com
Abstract:   (763 Views)
Introduction
The aim of this study, is painting of topological surfaces with the least number of colors without the distance, and the colors have a border. For this purpose, we need a color mapping. In this mapping, we have not any fixed point, and we can colorable the map with least colors.
Definition: Let f X → X be a graph without a fixed point. f is colorable with k colors, if there is C={C_1,…,C_K}, where all C_i do not include {(x, f(x)}. Or similarly, for every i=1,…, k, there is the equation C_i ∩ f(C_i )=.
Also, we define some concepts such as Compression, Metric, or non-Compression of space. Also, to achieve the desired result of each space, we change the properties of the maps.
Material and methods
In this work, first, we define the properties and conditions of the color mapping and color number. Also, by the study of properties of each space, we choose the best of space. One of the best conditions of this space is the lowest color number and higher efficiency. Finally, we proved  that this number is finite, and we can do coloring space with some maps and conversely.
Results and discussion
In this work, we define the properties and conditions of the color mapping and color number. We presented some theorems and Lemma in the article and proved them for coloring of any space by coloring map, the coloring number is at least 3 and at most is a n+3. Also, we proved the coloring number finite and we can  do coloring space with some maps and conversely.
Conclusion
The following conclusions were drawn from this research.
    • the coloring number is at least 3.
    • the coloring number is at most n+3.
    • coloring number is finite and we can do coloring space with some maps.
    • We can do the coloring of any space by the finite coloring map.
Full-Text [PDF 1481 kb]   (305 Downloads)    
Type of Study: S | Subject: Universal algebra
Received: 2019/12/23 | Revised: 2022/11/16 | Accepted: 2020/08/26 | Published: 2022/05/21 | ePublished: 2022/05/21

Add your comments about this article : Your username or Email:
CAPTCHA

Send email to the article author


Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.

© 2024 CC BY-NC 4.0 | Mathematical Researches

Designed & Developed by : Yektaweb