Vertex subsets with minimal width and dual width in $Q$-polynomial distance-regular graphs

Details Vertex subsets with minimal width and dual width in $Q$-polynomial distance-regular graphs Vertex subsets with minimal width and dual width in $Q$-polynomial distance-regular graphs

2010-11-09

arxiv.org/abs/1011.2000v1

Electron. J. Combin. 18 (2011) Paper 167

Mathematics

Combinatorics

31 pages

Scientific paper

We study $Q$-polynomial distance-regular graphs from the point of view of what we call descendents, that is to say, those vertex subsets with the property that the width $w$ and dual width $w^*$ satisfy $w+w^*=d$, where $d$ is the diameter of the graph. We show among other results that a nontrivial descendent with $w\ge 2$ is convex precisely when the graph has classical parameters. The classification of descendents has been done for the 5 classical families of graphs associated with short regular semilattices. We revisit and characterize these families in terms of posets consisting of descendents, and extend the classification to all of the 15 known infinite families with classical parameters and with unbounded diameter.

Affiliated with

Also associated with

No associations

Rating

Vertex subsets with minimal width and dual width in $Q$-polynomial distance-regular graphs 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 Vertex subsets with minimal width and dual width in $Q$-polynomial distance-regular graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Vertex subsets with minimal width and dual width in $Q$-polynomial distance-regular graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-492956