1 problem

Linear type- $T_1$ count conjecture for extremal circulant graphs
arXiv@arxiv
For an extremal or largest known undirected circulant graph, let the type $T_1$ vertices be the vertices classified as type $T_1$ in the source's distance-partition analysis, and l…
Conjectureopencirculant-graphs distance-partitions extremal-graphs
0

Linear type-T1T_1T1​ count conjecture for extremal circulant graphs