广义Halin图的竞争数

发布时间：2018-04-22 05:05

  本文选题：竞争图 + 竞争数　； 参考：《石家庄学院学报》2017年03期

【摘要】：对于任意图G,G并上足够多的孤立顶点就为某个无圈有向图的竞争图.这样加进来的孤立顶点的最少个数称为图G的竞争数,记作k(G).一般来说计算图的竞争数是比较困难的,并且通过计算图的竞争数来刻画图已成为研究竞争图理论的一个重要内容.广义Halin图包括一个树的平面嵌入和一个连接树的叶子的圈.针对广义Halin图进行研究,确定了广义Halin图的竞争数.
[Abstract]:For any graph G G and sufficient isolated vertices, it is a competitive graph of an acyclic digraph. The minimum number of isolated vertices added in is called the competition number of graph G. Generally speaking, it is difficult to calculate the competition number of graph, and it has become an important content to study the competition graph theory by calculating the competition number of graph. The generalized Halin graph includes the planar embedding of a tree and a circle of leaves connected to the tree. The competition number of generalized Halin graph is determined by studying the generalized Halin graph.
【作者单位】： 石家庄学院理学院;
【基金】：河北省自然科学基金(A2015106045)
【分类号】：O157.5
，

本文编号：1785703