A connected graph G = (V-G, E-G) is called a quasi-k-cyclic graph, if there exists a vertex q is an element of V-G such that G - q is a k-cyclic graph (connected with cyclomatic number k). In this paper we identify in the set of quasi-k-cyclic graphs (for k <= 3) those graphs whose spectral radius of the adjacency matrix (and the signless Laplacian if k <= 2) is the largest. In addition, for quasi-unicyclic graphs we identify as well those graphs whose spectral radius of the adjacency matrix is the second largest. (C) 2010 Elsevier Inc. All rights reserved.
机构:
Xinjiang Normal Univ, Sch Math Sci, Urumqi 830054, Xinjiang, Peoples R ChinaXinjiang Normal Univ, Sch Math Sci, Urumqi 830054, Xinjiang, Peoples R China
Fan, Dandan
Wang, Guoping
论文数: 0引用数: 0
h-index: 0
机构:
Xinjiang Normal Univ, Sch Math Sci, Urumqi 830054, Xinjiang, Peoples R ChinaXinjiang Normal Univ, Sch Math Sci, Urumqi 830054, Xinjiang, Peoples R China
Wang, Guoping
Zao, Yuying
论文数: 0引用数: 0
h-index: 0
机构:
Xinjiang Normal Univ, Sch Math Sci, Urumqi 830054, Xinjiang, Peoples R ChinaXinjiang Normal Univ, Sch Math Sci, Urumqi 830054, Xinjiang, Peoples R China