[Home] [Table] [Glossary] [Families]
On this page are all graphs related to C4[ 256, 66 ].
Graphs which this one covers
32-fold cover of C4[ 8, 1 ] = K_4,4
16-fold cover of C4[ 16, 1 ] = W( 8, 2)
16-fold cover of C4[ 16, 2 ] = {4, 4}_ 4, 0
8-fold cover of C4[ 32, 2 ] = {4, 4}_ 4, 4
8-fold cover of C4[ 32, 4 ] = MPS( 4, 16; 3)
8-fold cover of C4[ 32, 5 ] = MSY( 4, 8, 5, 4)
4-fold cover of C4[ 64, 2 ] = {4, 4}_ 8, 0
4-fold cover of C4[ 64, 6 ] = MPS( 8, 16; 3)
4-fold cover of C4[ 64, 8 ] = PX( 8, 3)
4-fold cover of C4[ 64, 15 ] = UG(ATD[64,10])
2-fold cover of C4[ 128, 25 ] = CPM( 8, 2, 4, 1)
2-fold cover of C4[ 128, 26 ] = AMC( 8, 8, [ 1. 1: 0. 1])
2-fold cover of C4[ 128, 33 ] = UG(ATD[128,44])
Graphs which cover this one
2-fold covered by C4[ 512, 135 ] = UG(ATD[512,245])
2-fold covered by C4[ 512, 146 ] = UG(ATD[512,278])
2-fold covered by C4[ 512, 155 ] = UG(ATD[512,305])
2-fold covered by C4[ 512, 196 ] = UG(ATD[512,414])
2-fold covered by C4[ 512, 198 ] = UG(ATD[512,420])
2-fold covered by C4[ 512, 199 ] = UG(ATD[512,423])
2-fold covered by C4[ 512, 200 ] = UG(ATD[512,426])
2-fold covered by C4[ 512, 201 ] = UG(ATD[512,429])
2-fold covered by C4[ 512, 202 ] = UG(ATD[512,432])
2-fold covered by C4[ 512, 203 ] = UG(ATD[512,435])
2-fold covered by C4[ 512, 220 ] = UG(ATD[512,482])
2-fold covered by C4[ 512, 223 ] = UG(ATD[512,491])
2-fold covered by C4[ 512, 228 ] = UG(ATD[512,504])
2-fold covered by C4[ 512, 229 ] = UG(ATD[512,507])
2-fold covered by C4[ 512, 230 ] = UG(ATD[512,510])
2-fold covered by C4[ 512, 232 ] = UG(ATD[512,516])
2-fold covered by C4[ 512, 233 ] = UG(ATD[512,519])
2-fold covered by C4[ 512, 234 ] = UG(ATD[512,522])
2-fold covered by C4[ 512, 235 ] = UG(ATD[512,525])
2-fold covered by C4[ 512, 533 ] = SS[512, 66]
2-fold covered by C4[ 512, 538 ] = SS[512, 71]
2-fold covered by C4[ 512, 547 ] = SS[512, 80]
2-fold covered by C4[ 512, 548 ] = SS[512, 81]
BGCG dissections of this graph
Base Graph: C4[ 16, 1 ] = W( 8, 2) connection graph: [K_4,4]
Base Graph: C4[ 16, 2 ] = {4, 4}_ 4, 0 connection graph: [K_4,4]
Base Graph: C4[ 32, 2 ] = {4, 4}_ 4, 4 connection graph: [C_4]
Aut-Orbital graphs of this one:
C4[ 8, 1 ] = K_4,4
C4[ 16, 2 ] = {4, 4}_ 4, 0
C4[ 256, 66 ] = UG(ATD[256,111])