A tricyclic graph is a connected graph with n vertices and n + 2 edges. In this article, we determine graphs with the largest spectral radius among the n-vertex tricyclic graphs with given diameter d.
机构:
Guangdong Univ Foreign Studies, Sch Informat, Dept Math & Stat, Guangzhou, Guangdong, Peoples R ChinaS China Normal Univ, Dept Math, Guangzhou, Guangdong, Peoples R China
Cheng, Bo
Liu, Bolian
论文数: 0引用数: 0
h-index: 0
机构:
S China Normal Univ, Dept Math, Guangzhou, Guangdong, Peoples R ChinaS China Normal Univ, Dept Math, Guangzhou, Guangdong, Peoples R China
Liu, Bolian
Liu, Jianxi
论文数: 0引用数: 0
h-index: 0
机构:
Guangdong Univ Foreign Studies, Sch Informat, Dept Math & Stat, Guangzhou, Guangdong, Peoples R ChinaS China Normal Univ, Dept Math, Guangzhou, Guangdong, Peoples R China
机构:
E China Normal Univ, Dept Math, Shanghai 200241, Peoples R China
Chuzhou Univ, Dept Math, Chuzhou 239012, Anhui, Peoples R ChinaE China Normal Univ, Dept Math, Shanghai 200241, Peoples R China
Zhai, Mingqing
Wu, Yarong
论文数: 0引用数: 0
h-index: 0
机构:
E China Normal Univ, Dept Math, Shanghai 200241, Peoples R ChinaE China Normal Univ, Dept Math, Shanghai 200241, Peoples R China
Wu, Yarong
Shu, Jinlong
论文数: 0引用数: 0
h-index: 0
机构:
E China Normal Univ, Minist Educ, Key Lab Geog Informat Sci, Shanghai 200241, Peoples R ChinaE China Normal Univ, Dept Math, Shanghai 200241, Peoples R China