超立方体与蝴蝶网络的测地线横截集
Geodesic Transversal of Hypercube and Butterfly networks
AI总结:
本文提出测地线横截引理,据此确定蝴蝶网络与超立方体网络的测地线横截数,解决了两类网络的测地线横截数计算问题。
摘要:
连通图$G(V,E)$中的测地线$P$若不存在图$G$中的其他测地线$P'$以$P$为子路径,则称为极大测地线。测地线横截问题是确定顶点子集$S\subseteq V(G)$,使得图$G$的每个极大测地线都包含$S$中至少一个顶点;元素数量最少的该集合称为测地线横截集(gt-set),其基数为图$G$的测地线横截数(gt-number)。本文提出测地线横截引理,该引理可根据任意图$G$的诱导子图的测地线横截数,给出$G$的测地线横截数的下界;利用该引理,确定了蝴蝶网络与超立方体网络的测地线横截数。
英文摘要:
A geodesic $P$ of a connected graph $G(V,E)$ is called a maximal geodesic if there exists no geodesic $P'$ in $G$ that contains $P$ as its sub-path. The geodesic transversal problem determines a subset $S\subseteq V(G)$ such that every possible maximal geodesic of $G$ includes at least one vertex of $S$. Such a set with minimum number of elements is called a gt-set and its cardinality is the gt-number of $G$. In this paper, we establish a general result, called the Geodesic Transversal lemma which provides a lower bound for the gt-number of an arbitrary graph $G$ in terms of the gt-number of its induced subgraphs. Using this lemma, we determine the gt-number of Butterfly and Hypercube networks.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。