Computer Engineering and Applications ›› 2016, Vol. 52 ›› Issue (16): 41-45.

Previous Articles     Next Articles

Algebraic connectivity of intersectant bicycle graphs

WAN Jiqing, CHEN Yuehui, KANG Li   

  1. College of Mathematics and Statistics, Minnan Normal University, Zhangzhou, Fujian 363000, China
  • Online:2016-08-15 Published:2016-08-12


万继青,陈跃辉,康  丽   

  1. 闽南师范大学 数学与统计学院,福建 漳州 363000

Abstract: A simple connected graph is intersectant bicycle graph if the number of edges equals the number of vertices plus one and the two cycles in this graph at least two common vertex. This paper presents the fifth to tenth largest value of algebraic connectivity together with the corresponding graph.

Key words: intersectant bicycle graph, Laplacian matrix, algebraic connectivity

摘要: 简单连通图若边数等于顶点数加1,且图中所含的两个圈至少有两个公共顶点,则称该图为相交双圈图。主要给出了相交双圈图中第五到第十大代数连通度的图类。

关键词: 相交双圈图, 拉普拉斯矩阵, 代数连通度