On a conjecture of V. Nikiforov

被引：46

作者：

Csikvari, Peter ^{[1
]}

机构：

[1] Eotvos Lorand Univ, Dept Algebra & Number Theory, H-1117 Budapest, Hungary

来源：

DISCRETE MATHEMATICS | 2009年 / 309卷 / 13期

关键词：

Spectral radius; Eigenvalue; Nordhaus-Gaddum type problem; NETWORK RELIABILITY; GRAPHS; EDGES;

D O I：

10.1016/j.disc.2009.02.013

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

In this paper we will prove that mu(G) + mu((G) over bar) <= 1 + root 3/2n - 1. where mu(G), mu((G) over bar) are the greatest eigenvalues of the adjacency matrices of the graph G and its complement and n denotes the number of vertices of G. (C) 2009 Elsevier B.V. All rights reserved.

引用

页码：4522 / 4526

页数：5

共 8 条

[1] NETWORK TRANSFORMATIONS AND BOUNDING NETWORK RELIABILITY [J].

BROWN, JI ;

COLBOURN, CJ ;

DEVITT, JS .

NETWORKS, 1993, 23 (01) :1-17

[2] ON THE SPECTRAL-RADIUS OF (0,1)-MATRICES [J].

BRUALDI, RA ;

HOFFMAN, AJ .

LINEAR ALGEBRA AND ITS APPLICATIONS, 1985, 65 (FEB) :133-146

[3] ON GRAPHS WITH RANDOMLY DELETED EDGES [J].

KELMANS, AK .

ACTA MATHEMATICA ACADEMIAE SCIENTIARUM HUNGARICAE, 1981, 37 (1-3) :77-88

[4] Eigenvalue problems of Nordhaus-Gaddum type [J].

Nikiforov, Vladimir .

DISCRETE MATHEMATICS, 2007, 307 (06) :774-780

[5]

Nikiforov V, 2006, ELECTRON J LINEAR AL, V15, P329

[6]

Nosal E., 1970, Eigenvalues of graphs

[7] ON THE MAXIMAL INDEX OF GRAPHS WITH A PRESCRIBED NUMBER OF EDGES [J].

ROWLINSON, P .

LINEAR ALGEBRA AND ITS APPLICATIONS, 1988, 110 :43-53

[8] A RELIABILITY-IMPROVING GRAPH TRANSFORMATION WITH APPLICATIONS TO NETWORK RELIABILITY [J].

SATYANARAYANA, A ;

SCHOPPMANN, L ;

SUFFEL, CL .

NETWORKS, 1992, 22 (02) :209-216

← 1 →