Similar Search Results

The Minimal Spectral Radius of Graphs with a Given Diameter

van Dam, Edwin Robert; Kooij, R.E. - Tilburg University, Center for Economic Research - 2006

AMS classsifications: 05C50; 05E99; 94C15;

Persistent link: https://www.econbiz.de/10011091419

Measuring the Power of Nodes in Digraphs

Talman, Dolf; Herings, P.J.J.; van der Laan, G. - Tilburg University, Center for Economic Research - 2001

Persistent link: https://www.econbiz.de/10011092774

Strongly Regular Decompositions of the Complete Graph

van Dam, Edwin Robert - Tilburg University, Center for Economic Research - 2001

AMS classifications: 05E30; 05B20;

Persistent link: https://www.econbiz.de/10011092850

Regularity and the Generalized Adjacency Spectra of Graphs

Chesnokov, A.A.; Haemers, W.H. - Tilburg University, Center for Economic Research - 2005

For every rational number x 2 (0; 1), we construct a pair of graphs one regular and one nonregular with adjacency …

Persistent link: https://www.econbiz.de/10011092911

Which Graphs are Determined by their Spectrum?

van Dam, Edwin Robert; Haemers, W.H. - Tilburg University, Center for Economic Research - 2002

AMS classifications; 05C50; 05E30;

Persistent link: https://www.econbiz.de/10011090354

A Lower Bound for the Spectral Radius of Graphs with Fixed Diameter

van Dam, Edwin Robert; Cioaba, S.M.; Koolen, J.H.; Lee, J.H. - Tilburg University, Center for Economic Research - 2008

AMS classifications: 05C50, 05E99;

Persistent link: https://www.econbiz.de/10011090380

Ranking the nodes in directed and weighted directed graphs

van den Brink, J.R.; Gilles, R.P. - Tilburg University, Center for Economic Research - 1994

Persistent link: https://www.econbiz.de/10011090413

5-Chromatic Strongly Regular Graphs

Fiala, N.C.; Haemers, W.H. - Tilburg University, Center for Economic Research - 2003

In this paper, we begin the determination of all primitive strongly regular graphs with chromatic number equal to 5 … set, we must decide which strongly regular graphs, if any, possessing the set are 5-chromatic.In this way, we deal …

Persistent link: https://www.econbiz.de/10011090622

A Lower Bound for the Laplacian Eigenvalues of a Graph-Proof of a Conjecture by Guo

Brouwer, A.E.; Haemers, W.H. - Tilburg University, Center for Economic Research - 2008

We show that if μj is the j-th largest Laplacian eigenvalue, and dj is the j-th largest degree (1 j n) of a connected graph 蚠 on n vertices, then μj dj − j + 2 (1 j n − 1). This settles a conjecture due to Guo.

Persistent link: https://www.econbiz.de/10011090653

Matrices and Graphs

Haemers, W.H. - Tilburg University, Center for Economic Research - 2005

The present article is designed to be a contribution to the chapter `Combinatorial Matrix Theory and Graphs' of the … to (undirected) graphs. 1. Graphs. 2. The adjacency matrix and its eigenvalues. 3. Other matrix representations. 4. Graph …

Persistent link: https://www.econbiz.de/10011091078