[Home] [Table] [Glossary] [Families]

On this page are all graphs related to C4[ 128, 20 ].

Graphs which this one covers

     16-fold cover of C4[ 8, 1 ] = K_4,4

     8-fold cover of C4[ 16, 1 ] = W( 8, 2)

     8-fold cover of C4[ 16, 2 ] = {4, 4}_ 4, 0

     4-fold cover of C4[ 32, 1 ] = W( 16, 2)

     4-fold cover of C4[ 32, 4 ] = MPS( 4, 16; 3)

     2-fold cover of C4[ 64, 7 ] = MPS( 4, 32; 7)

Graphs which cover this one

     2-fold covered by C4[ 256, 50 ] = UG(ATD[256,37])

     2-fold covered by C4[ 256, 55 ] = UG(ATD[256,79])

     3-fold covered by C4[ 384, 206 ] = UG(ATD[384,315])

     3-fold covered by C4[ 384, 207 ] = UG(ATD[384,318])

     3-fold covered by C4[ 384, 211 ] = UG(ATD[384,330])

     4-fold covered by C4[ 512, 51 ] = CPM( 8, 2, 16, 1)

     4-fold covered by C4[ 512, 116 ] = UG(ATD[512,153])

     4-fold covered by C4[ 512, 118 ] = UG(ATD[512,174])

     4-fold covered by C4[ 512, 119 ] = UG(ATD[512,186])

     4-fold covered by C4[ 512, 120 ] = UG(ATD[512,195])

     4-fold covered by C4[ 512, 122 ] = UG(ATD[512,201])

     4-fold covered by C4[ 512, 123 ] = UG(ATD[512,204])

     4-fold covered by C4[ 512, 124 ] = UG(ATD[512,207])

     4-fold covered by C4[ 512, 125 ] = UG(ATD[512,210])

     4-fold covered by C4[ 512, 126 ] = UG(ATD[512,213])

     4-fold covered by C4[ 512, 136 ] = UG(ATD[512,248])

     4-fold covered by C4[ 512, 143 ] = UG(ATD[512,269])

     4-fold covered by C4[ 512, 147 ] = UG(ATD[512,281])

     4-fold covered by C4[ 512, 152 ] = UG(ATD[512,296])

     4-fold covered by C4[ 512, 165 ] = UG(ATD[512,335])

     4-fold covered by C4[ 512, 166 ] = UG(ATD[512,338])

     4-fold covered by C4[ 512, 168 ] = UG(ATD[512,344])

     4-fold covered by C4[ 512, 169 ] = UG(ATD[512,347])

     4-fold covered by C4[ 512, 559 ] = SS[512, 94]

BGCG dissections of this graph

     Base Graph: C4[ 8, 1 ] = K_4,4   connection graph:  [C_8]

     Base Graph: C4[ 32, 1 ] = W( 16, 2)   connection graph:  [K_2]

     Base Graph: C4[ 32, 4 ] = MPS( 4, 16; 3)   connection graph:  [K_2]

Graphs which have this one as the base graph in a BGCG dissection:

      C4[ 256, 138 ] = BGCG(KE_32(1,15,2,19,1); K1;{1, 3})    with connection graph  [K_1]

      C4[ 256, 139 ] = BGCG(KE_32(1,15,2,19,1); K1;{5, 6, 9, 10})    with connection graph  [K_1]

      C4[ 512, 55 ] = PL(SoP( 4, 32))    with connection graph  [K_2]

      C4[ 512, 120 ] = UG(ATD[512,195])    with connection graph  [K_2]

      C4[ 512, 126 ] = UG(ATD[512,213])    with connection graph  [K_2]

      C4[ 512, 320 ] = PL(ATD[8,2]#ATD[64,4])    with connection graph  [K_2]

      C4[ 512, 322 ] = PL(ATD[8,2]#ATD[64,6])    with connection graph  [K_2]

      C4[ 512, 388 ] = PL(CS(MPS( 4, 32; 7)[ 16^ 8], 1))    with connection graph  [K_2]

      C4[ 512, 410 ] = BGCG(KE_32(1,15,2,19,1); K2;{1, 3, 5, 6, 9, 10})    with connection graph  [K_2]

      C4[ 512, 443 ] = BGCG(UG(ATD[256,106]); K1;{3, 4})    with connection graph  [K_2]

      C4[ 512, 444 ] = BGCG(UG(ATD[256,106]); K1;{5, 7})    with connection graph  [K_2]

Aut-Orbital graphs of this one:

      C4[ 8, 1 ] = K_4,4

      C4[ 128, 20 ] = KE_32(1,15,2,19,1)