Results 281 to 290 of about 41,123 (303)

A duality between pairs of split decompositions for a Q-polynomial distance-regular graph [PDF]

open access: yesDiscrete Mathematics, 2010
Let Γ denote a Q-polynomial distance-regular graph with diameter D≥3 and standard module V. Recently, Ito and Terwilliger introduced four direct sum decompositions of V; we call these the (μ,ν)-split decompositions of V, where μ,ν∈{↓,↑}. In this paper we
Kim, Joohyung
exaly   +2 more sources

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

A Bound for the Diameter of Distance-Regular Graphs

Combinatorica, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Distance-regular graphs

1978
Inequalities are obtained between the various parameters of a distance-regular graph. In particular, if k1 is the valency and k2 is the number of vertices at distance two from a given vertex, then in general k1 ⩽ k2. For distance-regular graphs of diameter at least four, k1=k2 if and only if the graph is simply a circuit.
D. E. Taylor, Richard Levingston
openaire   +1 more source

Distance-Regular Graphs

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

An automorphism group of a distance-regular graph with intersection array {24, 21, 3; 1, 3, 18}

Algebra and Logic, 2012
D V Paduchikh   +2 more
exaly  

The Displacement and Split Decompositions for a Q-Polynomial Distance-regular Graph

Graphs and Combinatorics, 2005
Paul Terwilliger, Terwilliger Paul
exaly  

Home - About - Disclaimer - Privacy