Special Intersection Graph in The Topological Graphs

Abstract

In this paper, new graphs Gτ=(V,E) are constructed from the discrete topological space (X,τ)\ . Several properties of this type of graphs are given such that: the clique number equals the number of elements in X also the number of pendants vertices, Gτ has no isolated vertices, the minimum degree in Gτ is one and maximum degree equal n-1+Σn-1i=2n-1i , the minimum dominating set is determined and γ(Gτ) is evaluated for Gτ and for corona and join operations between to discrete topological graphs. At what matter β(Gτ)=γ(Gτ) is discussed for Gτ. Also that Gτ is proved a connected graph of order 2n-2 and it has no isolated vertex. Then, rad \ Gτ and diam \ (Gτ) are evaluated.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…