Similar Search Results

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

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

Asymptotic Results on the Spectral Radius and the Diameter of Graphs

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

2000 Mathematics Subject Classification: 05C50, 05E99;

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

Conditions for Singular Incidence Matrices

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

-regular square divisible designs and distance-regular graphs. …

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

Enumeration of Cospectral Graphs

Haemers, W.H.; Spence, E. - Tilburg University, Center for Economic Research - 2002

AMS classification: 05C50;

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

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

Graphs with Given Diameter Maximizing the Spectral Radius (Revision of CentER Discussion Paper 2006-105)

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

We determine the graphs with maximal spectral radius among the ones on n nodes with diameter D. …

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

Cooperative Games in Graph Structure

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

players within the graph.A collection of graphs will be called balanced if to any graph in the collection a positive weight …-core if it lies in the core and the payoff vector is an element of payoff sets of all graphs in some balanced collection of … graphs.We prove that any balanced graph game has a nonempty balanced-core and therefore a nonempty core.We conclude by some …

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