Results 251 to 260 of about 321,891 (280)
Some of the next articles are maybe not open access.
Bipartite Q -Polynomial Distance-Regular Graphs
Graphs and Combinatorics, 2004Let \(\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, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Potential Theory on Distance-Regular Graphs
Combinatorics, Probability and Computing, 1993A 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
Observability in Connected Strongly Regular Graphs and Distance Regular Graphs
IEEE Transactions on Control of Network Systems, 2014Alain Y Kibangou
exaly
Formation of Robust Multi-Agent Networks through Self-Organizing Random Regular Graphs
IEEE Transactions on Network Science and Engineering, 2015Magnus Egerstedt, Jeff S Shamma
exaly
Sparse regular random graphs: Spectral density and eigenvectors
Annals of Probability, 2012Ioana Dumitriu
exaly