Results 241 to 250 of about 42,350 (268)

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   +3 more sources

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

Connectivity concerning the last two subconstituents of a Q-polynomial distance-regular graph

Journal of Combinatorial Theory - Series A, 2021
J H Koolen
exaly  

The Largest Moore Graph and a Distance-Regular Graph with Intersection Array {55, 54, 2; 1, 1, 54}

Algebra and Logic, 2020
D V Paduchikh
exaly  

On distance-regular graphs Γ of diameter 3 for which Γ 3 is a triangle-free graph

Discrete Mathematics and Applications, 2023
Wenbin Guo
exaly  

An inequality involving the second largest and smallest eigenvalue of a distance-regular graph

Linear Algebra and Its Applications, 2011
Jack Koolen, Jongyook Park
exaly  

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

Algebra and Logic, 2012
D V Paduchikh
exaly  

A distance regular graph of typeE 1° E d

Science Bulletin, 2000
Suogang Gao
exaly  

An equitable partition for a distance-regular graph of negative type

Journal of Combinatorial Theory Series B, 2005
Stefko Miklavic
exaly