Results 251 to 260 of about 322,612 (279)

Eigenpolytopes of Distance Regular Graphs

Canadian Journal of Mathematics, 1998
AbstractLet X be a graph with vertex set V and let A be its adjacency matrix. If E is the matrix representing orthogonal projection onto an eigenspace of A with dimension m, then E is positive semi-definite. Hence it is the Gram matrix of a set of |V| vectors in Rm. We call the convex hull of a such a set of vectors an eigenpolytope of X.
openaire   +1 more source

Eigenvectors of Distance-Regular Graphs

SIAM Journal on Matrix Analysis and Applications, 1988
The author studies the set of points the coordinates of which are rows of the matrix in which the columns are orthogonal eigenvectors associated to an eigenvalue of the adjacency matrix of a graph. In particular, the second largest eigenvalue \(\alpha\) and distance-regular graphs G are considered.
openaire   +1 more source

Bipartite Q -Polynomial Distance-Regular Graphs

Graphs and Combinatorics, 2004
Let \(\Gamma\) denote a bipartite \(Q\)-polynomial distance-regular graph with diameter \(D\geq 4\). Then the intersection numbers of \(\Gamma\) are determined by \(D\) and two real scalars \(q\) and \(s^*\). It is proved that \(s^*=0\) if \(D\geq 12\). Theorem 1.1. Let \(\Gamma\) be a bipartite distance-regular graph with diameter \(D\geq 12\). Then \(
openaire   +2 more sources

Codes in Shilla Distance-Regular Graphs

Proceedings of the Steklov Institute of Mathematics, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Potential Theory on Distance-Regular Graphs

Combinatorics, Probability and Computing, 1993
A graph may be regarded as an electrical network in which each edge has unit resistance. We obtain explicit formulae for the effective resistance of the network when a current enters at one vertex and leaves at another in the distance-regular case.
openaire   +2 more sources

Distance-Regular Graphs

1989
Brouwer, A.E., Cohen, A.M., Neumaier, A.
openaire   +2 more sources

Distance-Regular Graphs

2007
Akihito Hora, Nobuaki Obata
openaire   +1 more source

Distance-Regular Graphs

2011
Andries E. Brouwer, Willem H. Haemers
openaire   +1 more source

Observability in Connected Strongly Regular Graphs and Distance Regular Graphs

IEEE Transactions on Control of Network Systems, 2014
Alain Y Kibangou, Christian Commault
exaly  

The distance spectrum and energy of the compositions of regular graphs

Applied Mathematics Letters, 2009
Dragan Stevanović
exaly