In this paper. A new definition of discrete topological graph is introduced. Some properties of this graph are proved. If are evaluated has no pendant vertex , not tree, also the value of the diameter and the minimum degree of . If , has ( ) complete bipartite induced subgraphs, is connected graph, simple graph, has no odd cycle, the clique number also proved, the value of the radius, the maximum degree and the chromatic number of have been studied.
No takes yet. Share an insight, caveat, or question.
Mhawis et al. (2024) studied this question.