Geometric distance-regular graphs without 4-claws

Details Geometric distance-regular graphs without 4-claws Geometric distance-regular graphs without 4-claws

2011-01-03

arxiv.org/abs/1101.0440v1

Mathematics

Combinatorics

Scientific paper

A non-complete \drg $\Gamma$ is called geometric if there exists a set $\mathcal{C}$ of Delsarte cliques such that each edge of $\Gamma$ lies in a unique clique in $\mathcal{C}$. In this paper, we determine the non-complete distance-regular graphs satisfying $\max \{3, 8/3}(a_1+1)\}

Affiliated with

Also associated with

No associations

Rating

Geometric distance-regular graphs without 4-claws does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Geometric distance-regular graphs without 4-claws, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Geometric distance-regular graphs without 4-claws will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-238041