The nullity of (k-1)-cyclic graphs☆
The nullity of (k-1)-cyclic graphs☆
复制标题
DOI：
10.1016/j.laa.2012.11.033
复制
发表时间：
2013-04
影响因子：
1.1
通讯作者：
Xuezhong Tan;Bolian Liu
中科院分区：
文献类型：
--
作者：
Xuezhong Tan;Bolian Liu
一个简单连通图称为k-循环图，只要它的边数等于它的阶数加（k-1）。本文定义了一类（k-1）-循环图，记为Θk.研究了Θ-图的奇异性。此外，包含Θ-图作为导出子图的（k-1）-循环图也受到了广泛关注。我们刻画了那些具有极端零值的图。所得结果推广了单圈图和双圈图的相应定理。
A simple connected graph is called a k-cyclic graph provided that the number of edges equals its order plus (k-1). In this paper, we define a class of (k-1)-cyclic graph, denoted by Θk. The singularity of Θ-graph is studied. Also, the (k-1)-cyclic graphs that contain Θ-graph as an induced subgraph are paid much attention. We characterize those graphs that have extreme nullities. The results generalize the corresponding theorems on unicyclic and bicyclic graphs.