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.
机构:
Korea Adv Inst Sci & Technol, Math Sci Dept, Daejeon, South KoreaKorea Adv Inst Sci & Technol, Math Sci Dept, Daejeon, South Korea
Kim, Jaehoon
Kostochka, Alexandr, V
论文数: 0引用数: 0
h-index: 0
机构:
Univ Illinois, Dept Math, Urbana, IL 61801 USA
Sobolev Inst Math, Novosibirsk 630090, RussiaKorea Adv Inst Sci & Technol, Math Sci Dept, Daejeon, South Korea
Kostochka, Alexandr, V
Suil, O.
论文数: 0引用数: 0
h-index: 0
机构:
State Univ New York, Dept Appl Math & Stat, Incheon 21985, South KoreaKorea Adv Inst Sci & Technol, Math Sci Dept, Daejeon, South Korea
Suil, O.
Shi, Yongtang
论文数: 0引用数: 0
h-index: 0
机构:
Nankai Univ, Ctr Combinator, Tianjin 300071, Peoples R China
Nankai Univ, LPMC, Tianjin 300071, Peoples R ChinaKorea Adv Inst Sci & Technol, Math Sci Dept, Daejeon, South Korea
Shi, Yongtang
Wang, Zhiwen
论文数: 0引用数: 0
h-index: 0
机构:
Nankai Univ, LPMC, Tianjin 300071, Peoples R China
Nankai Univ, Sch Math Sci, Tianjin 300071, Peoples R ChinaKorea Adv Inst Sci & Technol, Math Sci Dept, Daejeon, South Korea
机构:
East China Univ Sci & Technol, Sch Math, Shanghai 200237, Peoples R ChinaEast China Univ Sci & Technol, Sch Math, Shanghai 200237, Peoples R China
Zhang, Quanbao
Fan, Dandan
论文数: 0引用数: 0
h-index: 0
机构:
East China Univ Sci & Technol, Sch Math, Shanghai 200237, Peoples R China
Xinjiang Agr Univ, Coll Math & Phys, Urumqi 830052, Xinjiang, Peoples R ChinaEast China Univ Sci & Technol, Sch Math, Shanghai 200237, Peoples R China