The nullity of k-cyclic graphs of ∞-type
The nullity of k-cyclic graphs of ∞-type
复制标题
DOI：
10.1080/03081087.2014.993301
复制
发表时间：
2015-11
影响因子：
1.1
通讯作者：
Xiaobin Ma;Dein Wong
中科院分区：
文献类型：
--
作者：
Xiaobin Ma;Dein Wong
如果简单连通图的边数等于它的阶数加，则称它为-循环图。Tan X.Z.研究了-型-循环图的零度，刘宝林(see是林书Alg. 2013;438：3144-3153）。在-型的-圈图中，所有的圈恰好有两个公共顶点.在这篇文章中，我们主要研究了与-型图相反的另一类-循环图，其中不同的圈没有公共顶点。这样的-循环图称为-型图.当时，证明了具有顶点的-型循环图的零度集为，并给出了具有零度的极图的完全刻划。
A simple connected graph is called a -cyclic graph provided that the number of edges equals its order plus . The nullity of a -cyclic graph of -type is studied by Tan X.Z., Liu B.L. (see Lin. Alg. Appl. 2013;438:3144–3153). In a -cyclic graph of -type with , all cycles have exactly two common vertices. In this paper, we focus on another type of -cyclic graphs opposite those of -type, in which distinct cycles have no common vertices. Such a -cyclic graph is said to be of -type. When , the nullity set of all -cyclic graphs of -type with vertices is proven to be , and the extremal graphs with nullity are characterized completely.