[ 3 / biz / cgl / ck / diy / fa / ic / jp / lit / sci / vr / vt ] [ index / top / reports ] [ become a patron ] [ status ]
2023-11: Warosu is now out of extended maintenance.

/sci/ - Science & Math

Search:


View post   

>> No.8927396 [View]
File: 6 KB, 533x292, Untitled.png [View same] [iqdb] [saucenao] [google]
8927396

>>8927380
If I understand the problem correctly, I don't think there is a bijection.

A distance regular graph has to be regular, i.e., all vertex degrees are the same.
You can certainly draw two chords like pic related which divide a circle into 3 equal areas.
Then, the graph obtained by connecting adjacent pieces is not regular (and hence not distance regular).

Does that make sense? Did I misunderstand the question?

Navigation
View posts[+24][+48][+96]