1937.sagews

# user input:
    
N = 5
A = '00000'

#take out vertices with distance from A < 2

gN = graphs.CubeGraph(N)
gNL = list(gN)
gNL2 = []
i = 0 
while i < len(gNL):
    if gN.distance(gNL[i], A) >= 2:
        gNL2.append(gNL[i])   
    i+=1
gNL2
SUB = [];
i = 0
while i <= len(gNL2):
    S = Subsets(gNL2, i, submultiset=True)
    j = 0
    while j < len(list(S)):
        SUB.append(list(S)[j]);
        j +=1
    i +=1
SUB
i = 0 
while i < len(SUB):
    SUB[i].append(A)
    i+=1
    
MatrixList = [[0]];
i = 1
while i < len(SUB):
    Z = Matrix (QQ, len(SUB[i]), len(SUB[i]))
    j = 0
    while j < len(SUB[i]):
        k = 0
        while k < len(SUB[i]):
            Z[j,k]= gN.distance(SUB[i][j], SUB[i][k]); 
            if Z[j,k] ==1:
                Z[0,0]=99
            k += 1
        j += 1 
        if Z[0,0] != 99:
            MatrixList.append(Z)
    i += 1
MatrixList

['011', '111', '110', '101']

[[], ['011'], ['101'], ['110'], ['111'], ['011', '101'], ['011', '110'], ['011', '111'], ['101', '110'], ['101', '111'], ['110', '111'], ['011', '101', '110'], ['011', '101', '111'], ['011', '110', '111'], ['101', '110', '111'], ['011', '101', '110', '111']]

WARNING: Output truncated!

full_output.txt

\newcommand{\Bold}[1]{\mathbf{#1}}\left[\left[0\right], \left($$\begin{array}{rrr} 0 & 2 & 2 \\ 2 & 0 & 0 \\ 2 & 0 & 0 \end{array}$$\right), \left($$\begin{array}{rrr} 0 & 2 & 2 \\ 2 & 0 & 0 \\ 2 & 0 & 0 \end{array}$$\right), \left($$\begin{array}{rrr} 0 & 2 & 2 \\ 2 & 0 & 0 \\ 2 & 0 & 0 \end{array}$$\right), \left($$\begin{array}{rrr} 0 & 2 & 2 \\ 2 & 0 & 0 \\ 2 & 0 & 0 \end{array}$$\right), \left($$\begin{array}{rrr} 0 & 2 & 2 \\ 2 & 0 & 0 \\ 2 & 0 & 0 \end{array}$$\right), \left($$\begin{array}{rrr} 0 & 2 & 2 \\ 2 & 0 & 0 \\ 2 & 0 & 0 \end{array}$$\right), \left($$\begin{array}{rrr} 0 & 2 & 2 \\ 2 & 0 & 0 \\ 2 & 0 & 0 \end{array}$$\right), \left($$\begin{array}{rrr} 0 & 2 & 2 \\ 2 & 0 & 0 \\ 2 & 0 & 0 \end{array}$$\right), \left($$\begin{array}{rrr} 0 & 2 & 2 \\ 2 & 0 & 0 \\ 2 & 0 & 0 \end{array}$$\right), \left($$\begin{array}{rrr} 0 & 3 & 3 \\ 3 & 0 & 0 \\ 3 & 0 & 0 \end{array}$$\right), \left($$\begin{array}{rrr} 0 & 3 & 3 \\ 3 & 0 & 0 \\ 3 & 0 & 0 \end{array}$$\right), \left($$\begin{array}{rrr} 0 & 3 & 3 \\ 3 & 0 & 0 \\ 3 & 0 & 0 \end{array}$$\right), \left($$\begin{array}{rrrr} 0 & 2 & 2 & 2 \\ 2 & 0 & 2 & 2 \\ 2 & 2 & 0 & 0 \\ 2 & 2 & 0 & 0 \end{array}$$\right), \left($$\begin{array}{rrrr} 0 & 2 & 2 & 2 \\ 2 & 0 & 2 & 2 \\ 2 & 2 & 0 & 0 \\ 2 & 2 & 0 & 0 \end{array}$$\right), \left(\begin{array}{rrrr} ... 0 & 2 & 2 & 2 \\ 2 & 0 & 2 & 2 \\ 2 & 2 & 0 & 0 \\ 2 & 2 & 0 & 0 \end{array}\right), \left($$\begin{array}{rrrr} 0 & 2 & 2 & 2 \\ 2 & 0 & 2 & 2 \\ 2 & 2 & 0 & 0 \\ 2 & 2 & 0 & 0 \end{array}$$\right), \left($$\begin{array}{rrrr} 0 & 2 & 2 & 2 \\ 2 & 0 & 2 & 2 \\ 2 & 2 & 0 & 0 \\ 2 & 2 & 0 & 0 \end{array}$$\right), \left($$\begin{array}{rrrr} 0 & 2 & 2 & 2 \\ 2 & 0 & 2 & 2 \\ 2 & 2 & 0 & 0 \\ 2 & 2 & 0 & 0 \end{array}$$\right), \left($$\begin{array}{rrrr} 0 & 2 & 2 & 2 \\ 2 & 0 & 2 & 2 \\ 2 & 2 & 0 & 0 \\ 2 & 2 & 0 & 0 \end{array}$$\right), \left($$\begin{array}{rrrr} 0 & 2 & 2 & 2 \\ 2 & 0 & 2 & 2 \\ 2 & 2 & 0 & 0 \\ 2 & 2 & 0 & 0 \end{array}$$\right), \left($$\begin{array}{rrrrr} 0 & 2 & 2 & 2 & 2 \\ 2 & 0 & 2 & 2 & 2 \\ 2 & 2 & 0 & 2 & 2 \\ 2 & 2 & 2 & 0 & 0 \\ 2 & 2 & 2 & 0 & 0 \end{array}$$\right), \left($$\begin{array}{rrrrr} 0 & 2 & 2 & 2 & 2 \\ 2 & 0 & 2 & 2 & 2 \\ 2 & 2 & 0 & 2 & 2 \\ 2 & 2 & 2 & 0 & 0 \\ 2 & 2 & 2 & 0 & 0 \end{array}$$\right), \left($$\begin{array}{rrrrr} 0 & 2 & 2 & 2 & 2 \\ 2 & 0 & 2 & 2 & 2 \\ 2 & 2 & 0 & 2 & 2 \\ 2 & 2 & 2 & 0 & 0 \\ 2 & 2 & 2 & 0 & 0 \end{array}$$\right), \left($$\begin{array}{rrrrr} 0 & 2 & 2 & 2 & 2 \\ 2 & 0 & 2 & 2 & 2 \\ 2 & 2 & 0 & 2 & 2 \\ 2 & 2 & 2 & 0 & 0 \\ 2 & 2 & 2 & 0 & 0 \end{array}$$\right), \left($$\begin{array}{rrrrr} 0 & 2 & 2 & 2 & 2 \\ 2 & 0 & 2 & 2 & 2 \\ 2 & 2 & 0 & 2 & 2 \\ 2 & 2 & 2 & 0 & 0 \\ 2 & 2 & 2 & 0 & 0 \end{array}$$\right)\right]