论文标题
拓扑图中的特殊交点图
Special Intersection Graph in The Topological Graphs
论文作者
论文摘要
在本文中，新图$g_τ= \ left（v，e \右）$由离散拓扑空间$（x，τ）\ $构建。给出了这种类型的图形的几种属性：集团数等于x中的元素数量，也等于吊坠顶点的数量，$g_τ$没有孤立的顶点，$g_τ$中的最低度是一个和最大程度等于$ n-1+n-1+sum+\ sum^sum^{n-1} { $γ（g_τ）$以$g_τ$和电晕进行评估，并在两者之间加入操作以离散拓扑图。在重要的情况下，$β\ left（g_τ\ right）=γ（g_τ）$以$g_τ$进行了讨论。另外，$g_τ$被证明是连接的订单$ 2^n-2 $的图表，并且没有隔离的顶点。然后，评估了rad $ \g_τ$和diam $ \（g_τ）$。
In this paper, new graphs $G_τ=\left(V,E\right)$ 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+\sum^{n-1}_{i=2}\binom{n-1}{i}$ , 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 $β\left(G_τ\right)=γ(G_τ)$ is discussed for $G_τ$. Also that $G_τ$ is proved a connected graph of order $2^n-2$ and it has no isolated vertex. Then, rad $\ G_τ$ and diam $\ (G_τ)$ are evaluated.
