On the index of bicyclic graphs with perfect matchings

被引：26

作者：

Chang, A ^{[1
]}

Tian, F

Yu, AM

机构：

[1] Fuzhou Univ, Dept Math, Fuzhou 350002, Fujian, Peoples R China

[2] Chinese Acad Sci, Acad Math & Syst Sci, Beijing 100080, Peoples R China

来源：

DISCRETE MATHEMATICS | 2004年 / 283卷 / 1-3期

关键词：

bicyclic graphs; index; perfect matching; upper bound;

D O I：

10.1016/j.disc.2004.02.005

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Let R+ (2k) be the set of all bicyclic graphs on 2k(k greater than or equal to 2) vertices with perfect matchings. In this paper, we discuss some properties of the connected graphs with perfect matchings, and then determine graphs with maximal index in R+ (2k). (C) 2004 Elsevier B.V. All rights reserved.

引用

页码：51 / 59

页数：9

共 16 条

[1]

[Anonymous], PUBL I MATH BEOGRAD

[2]

BELL FK, 1993, LINEAR ALGEBRA APPL, V144, P135

[3]

Brualdi R. A., 1986, PUBL I MATH-BEOGRAD, V39, P45

[4] On the spectral radius of unicyclic graphs with perfect matchings [J].

Chang, A ;

Tian, F .

LINEAR ALGEBRA AND ITS APPLICATIONS, 2003, 370 :237-250

[5]

Collatz L., 1957, Abh. Math. Sem. Univ. Hamburg, V21, P63, DOI DOI 10.1007/BF02941924

[6] A TABLE OF CONNECTED GRAPHS ON 6 VERTICES [J].

CVETKOVIC, D ;

PETRIC, M .

DISCRETE MATHEMATICS, 1984, 50 (01) :37-49

[7]

CVETKOVIC D, 1997, EIGENSPACES GRAPHS

[8]

CVETKOVIC D, 1990, LINEAR MULTILINEAR A, V28, P3, DOI DOI 10.1080/03081089008818026

[9]

CVETKOVIC D, 1986, PUBL I MATH BEOGRAD, V44, P29

[10]

Cvetkovic D.M., 1980, SPECTRA GRAPH THEORY

← 1 2 →