Graphs ending ...NAA and <= 11 vertices

3523 days ago by butler

NAA = ['Bw', 'DLo', 'FHQSO', 'FK?}W', 'HHOOSIA', 'H@QCBC\\', 'HK@KPKV', 'H_?hiiJ', 'HK?@OnN', 'H@SicmM', 'H?DSZu|', 'H@GR[z{', 'HBYleVS','J?AEB?oE?W?', 'J?AAD?oU?[_', 'J?AA@_gs?[_', 'J?AAD@oFOV?','J?AA@_gw@{_', 'J?AEB?oZBo?', 'J?AE@bGJC`_', 'J?ABA_g{BW?','J?AA@BOiC~_', 'J?AAD@OaT}_', 'J?AAD@OzEs_', 'J?AAD?o}D[_','J?AAD?o]P]_', 'J?AAD@ojDt?', 'J?AAD@oRQv?', 'J?AAD@oJPv?','J?AA@b_mD\\?', 'J?AA@qoY@N_', 'J?AEB?oyFw?', 'J?AEB?oYb{?','J?AEB?oas}?', 'J?AE@poJ`F?', 'J?ABAaI[A\\_', 'J?ABAbgjF_?','J?AB?rO[Ax_', 'J?AB?rS{Eo?', 'J?BD?pW{E`?', 'J?BD?pWL_l?','J?`@CbOISN_', 'J?AAFBO}?^_', 'J?AAF@Sa~o_', 'J?AEBBoJfs?','J?AEB@sJb{?', 'J?ABA_Yubh_', 'J?BD?oslFp?', 'J?B@eQwj@Y?','J?AADBoR]v_', 'J?AADAsZT}_', 'J?AADAsR[~_', 'J?AAFAs~B]?','J?AAFBw|@V_', 'J?AAFB[|?^_', 'J?AAF@tVO^_', 'J?AADb_}B^_','J?AADbwybJ_', 'J?AADa{z@N_', 'J?AAD_|ZPN_', 'J?AE@b_yb|_','J?AE@b_yRz_', 'J?AE@bc^f[?', 'J?AE@bc^VY?', 'J?AE@bi}BL_','J?AEB`e^@]_', 'J?AE@roJlF_', 'J?AEDFWtVS_', 'J?ABAbYff`_','J?ABEbg{HZ_', 'J?ABEbW{Gz_', 'J?ABEa[\\Uw_', 'J?ABEbIB~`_','J?ABCrS\\Uw_', 'J?ABCpTuN`_', 'J?ABApwcyl_', 'J?ABCdY]am_','J?AB?vSufa_', 'J?AFE`g}@N_', 'J?B@fAozAZ_', 'J?B@fAon?z_','J?B@cZ_[^W_', 'J?B@`Yos\\w_', 'J?`DAboQ{N_', 'J?`DAboB}F_','J?`D@_yw[N_', 'J?AEFBs^`^?', 'J?`DFBw]_^_', 'J?AAF@t~T^_','J?AAFAvZv}?', 'J?AEDFq}f^?', 'J?AEFJojv}?', 'J?AEFJoJz~?','J?ABCdVvVz?', 'J?ABCdVVr~?', 'J?BFDrs}Cl_', 'J?B@ljbzAZ_','J?B@ljbn?z_', 'J?`DEEd{^v?', 'J?`FDrh}CN_', 'J?`F?}]xQV_','J?`Df`jy_^_', 'J?b@d_lB~V_', 'J?b@fRJydb_', 'J?bFB`uZeF_','J?`bErsvBp_', 'J?`afbT|BR_', 'J?`ebPy}Eb_', 'J?AEDFv~v^?','J?BDDjs~u~?', 'J?BDLjJzvl_', 'J?BDLjuuv}?', 'J?bERZk~F|?','J?bERZk|Vn?', 'J?bb]rw~Ex?'] 
       
html('<!--notruncate-->') for x in NAA: G=Graph(x) A=G.adjacency_matrix() B=A.inverse() t=1/abs(B[1,1]) G.show() print " vertices: "+str(G.order())+"\n edges: "+str(G.size())+"\nautomorphisms: "+str(len(G.automorphism_group()))+"\ngraph6-string: "+G.graph6_string()+"\n\nAdjacency matrix:" print A print "\n("+str(t)+"x)Inverse of the Adjacency matrix:" print t*B print "\n======================================\n" 
       
     vertices:  3
        edges:  3
automorphisms:  6
graph6-string:  Bw

Adjacency matrix:
[0 1 1]
[1 0 1]
[1 1 0]

(2x)Inverse of the Adjacency matrix:
[-1  1  1]
[ 1 -1  1]
[ 1  1 -1]

======================================

     vertices:  5
        edges:  5
automorphisms:  10
graph6-string:  DLo

Adjacency matrix:
[0 0 0 1 1]
[0 0 1 0 1]
[0 1 0 1 0]
[1 0 1 0 0]
[1 1 0 0 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1 -1  1  1]
[-1  1  1 -1  1]
[-1  1  1  1 -1]
[ 1 -1  1  1 -1]
[ 1  1 -1 -1  1]

======================================

     vertices:  7
        edges:  7
automorphisms:  14
graph6-string:  FHQSO

Adjacency matrix:
[0 0 0 0 0 1 1]
[0 0 1 0 1 0 0]
[0 1 0 1 0 0 0]
[0 0 1 0 0 1 0]
[0 1 0 0 0 0 1]
[1 0 0 1 0 0 0]
[1 0 0 0 1 0 0]

(2x)Inverse of the Adjacency matrix:
[-1 -1 -1  1  1  1  1]
[-1 -1  1  1  1 -1  1]
[-1  1 -1  1  1  1 -1]
[ 1  1  1 -1 -1  1 -1]
[ 1  1  1 -1 -1 -1  1]
[ 1 -1  1  1 -1 -1  1]
[ 1  1 -1 -1  1  1 -1]

======================================

     vertices:  7
        edges:  9
automorphisms:  4
graph6-string:  FK?}W

Adjacency matrix:
[0 0 0 1 0 0 1]
[0 0 1 0 0 0 1]
[0 1 0 0 0 1 0]
[1 0 0 0 0 1 0]
[0 0 0 0 0 1 1]
[0 0 1 1 1 0 1]
[1 1 0 0 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1  1 -1  1 -1 -1  1]
[ 1  1  1 -1 -1 -1  1]
[-1  1  1  1 -1  1 -1]
[ 1 -1  1  1 -1  1 -1]
[-1 -1 -1 -1  1  1  1]
[-1 -1  1  1  1  1 -1]
[ 1  1 -1 -1  1 -1  1]

======================================

     vertices:  9
        edges:  9
automorphisms:  18
graph6-string:  HHOOSIA

Adjacency matrix:
[0 0 0 0 0 0 0 1 1]
[0 0 1 0 1 0 0 0 0]
[0 1 0 1 0 0 0 0 0]
[0 0 1 0 0 1 0 0 0]
[0 1 0 0 0 0 1 0 0]
[0 0 0 1 0 0 0 1 0]
[0 0 0 0 1 0 0 0 1]
[1 0 0 0 0 1 0 0 0]
[1 0 0 0 0 0 1 0 0]

(2x)Inverse of the Adjacency matrix:
[ 1  1  1 -1 -1 -1 -1  1  1]
[ 1  1  1 -1  1 -1 -1  1 -1]
[ 1  1  1  1 -1 -1 -1 -1  1]
[-1 -1  1  1 -1  1  1 -1  1]
[-1  1 -1 -1  1  1  1  1 -1]
[-1 -1 -1  1  1  1  1  1 -1]
[-1 -1 -1  1  1  1  1 -1  1]
[ 1  1 -1 -1  1  1 -1  1 -1]
[ 1 -1  1  1 -1 -1  1 -1  1]

======================================

     vertices:  9
        edges:  11
automorphisms:  4
graph6-string:  H@QCBC\

Adjacency matrix:
[0 0 0 0 0 1 1 0 0]
[0 0 0 0 1 0 0 1 0]
[0 0 0 1 0 0 0 1 0]
[0 0 1 0 0 0 0 0 1]
[0 1 0 0 0 0 0 0 1]
[1 0 0 0 0 0 0 0 1]
[1 0 0 0 0 0 0 1 0]
[0 1 1 0 0 0 1 0 1]
[0 0 0 1 1 1 0 1 0]

(2x)Inverse of the Adjacency matrix:
[-1 -1 -1 -1 -1  1  1  1  1]
[-1 -1 -1 -1  1 -1  1  1  1]
[-1 -1 -1  1 -1 -1  1  1  1]
[-1 -1  1 -1 -1  1 -1  1  1]
[-1  1 -1 -1 -1  1 -1  1  1]
[ 1 -1 -1  1  1 -1  1 -1  1]
[ 1  1  1 -1 -1  1 -1  1 -1]
[ 1  1  1  1  1 -1  1 -1 -1]
[ 1  1  1  1  1  1 -1 -1 -1]

======================================

     vertices:  9
        edges:  13
automorphisms:  2
graph6-string:  HK@KPKV

Adjacency matrix:
[0 0 0 1 0 0 1 0 0]
[0 0 1 0 0 1 0 0 0]
[0 1 0 0 0 0 0 1 0]
[1 0 0 0 0 0 0 0 1]
[0 0 0 0 0 1 1 0 0]
[0 1 0 0 1 0 0 1 1]
[1 0 0 0 1 0 0 1 1]
[0 0 1 0 0 1 1 0 1]
[0 0 0 1 0 1 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1  1  1  1  1 -1  1 -1 -1]
[ 1  1  1  1  1  1 -1 -1 -1]
[ 1  1  1 -1 -1 -1  1  1 -1]
[ 1  1 -1  1 -1  1 -1 -1  1]
[ 1  1 -1 -1  1  1  1 -1 -1]
[-1  1 -1  1  1  1 -1 -1  1]
[ 1 -1  1 -1  1 -1  1  1 -1]
[-1 -1  1 -1 -1 -1  1  1  1]
[-1 -1 -1  1 -1  1 -1  1  1]

======================================

     vertices:  9
        edges:  13
automorphisms:  2
graph6-string:  H_?hiiJ

Adjacency matrix:
[0 1 0 0 0 0 0 0 1]
[1 0 0 0 0 0 0 1 0]
[0 0 0 0 0 1 1 0 0]
[0 0 0 0 0 0 1 1 0]
[0 0 0 0 0 1 0 0 1]
[0 0 1 0 1 0 1 1 0]
[0 0 1 1 0 1 0 0 1]
[0 1 0 1 0 1 0 0 1]
[1 0 0 0 1 0 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1  1  1 -1 -1 -1  1 -1  1]
[ 1  1  1 -1 -1  1 -1  1 -1]
[ 1  1  1 -1 -1  1  1 -1 -1]
[-1 -1 -1  1 -1 -1  1  1  1]
[-1 -1 -1 -1  1  1 -1  1  1]
[-1  1  1 -1  1  1 -1  1 -1]
[ 1 -1  1  1 -1 -1  1 -1  1]
[-1  1 -1  1  1  1 -1  1 -1]
[ 1 -1 -1  1  1 -1  1 -1  1]

======================================

     vertices:  9
        edges:  13
automorphisms:  2
graph6-string:  HK?@OnN

Adjacency matrix:
[0 0 0 1 0 0 0 0 1]
[0 0 1 0 0 0 0 0 1]
[0 1 0 0 0 0 1 0 0]
[1 0 0 0 0 0 0 1 0]
[0 0 0 0 0 0 1 0 1]
[0 0 0 0 0 0 0 1 1]
[0 0 1 0 1 0 0 1 1]
[0 0 0 1 0 1 1 0 1]
[1 1 0 0 1 1 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1  1 -1  1  1 -1 -1 -1  1]
[ 1  1  1 -1 -1  1 -1 -1  1]
[-1  1  1  1 -1 -1  1  1 -1]
[ 1 -1  1  1 -1 -1  1  1 -1]
[ 1 -1 -1 -1  1 -1  1 -1  1]
[-1  1 -1 -1 -1  1 -1  1  1]
[-1 -1  1  1  1 -1  1  1 -1]
[-1 -1  1  1 -1  1  1  1 -1]
[ 1  1 -1 -1  1  1 -1 -1  1]

======================================

     vertices:  9
        edges:  15
automorphisms:  6
graph6-string:  H@SicmM

Adjacency matrix:
[0 0 0 0 0 0 0 1 1]
[0 0 0 0 1 0 1 0 0]
[0 0 0 1 0 1 0 0 0]
[0 0 1 0 1 0 1 1 0]
[0 1 0 1 0 1 0 0 1]
[0 0 1 0 1 0 0 1 1]
[0 1 0 1 0 0 0 1 1]
[1 0 0 1 0 1 1 0 0]
[1 0 0 0 1 1 1 0 0]

(2x)Inverse of the Adjacency matrix:
[-1 -1 -1 -1 -1  1  1  1  1]
[-1 -1 -1  1  1 -1  1 -1  1]
[-1 -1 -1  1  1  1 -1  1 -1]
[-1  1  1 -1 -1  1  1  1 -1]
[-1  1  1 -1 -1  1  1 -1  1]
[ 1 -1  1  1  1 -1 -1 -1  1]
[ 1  1 -1  1  1 -1 -1  1 -1]
[ 1 -1  1  1 -1 -1  1 -1  1]
[ 1  1 -1 -1  1  1 -1  1 -1]

======================================

     vertices:  9
        edges:  17
automorphisms:  2
graph6-string:  H?DSZu|

Adjacency matrix:
[0 0 0 0 0 0 1 0 1]
[0 0 0 0 0 1 0 1 0]
[0 0 0 0 0 0 0 1 1]
[0 0 0 0 1 1 0 1 1]
[0 0 0 1 0 0 1 1 1]
[0 1 0 1 0 0 1 0 1]
[1 0 0 0 1 1 0 1 0]
[0 1 1 1 1 0 1 0 1]
[1 0 1 1 1 1 0 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1  1 -1 -1  1  1 -1  1]
[-1  1  1 -1 -1  1  1  1 -1]
[ 1  1  1 -1 -1 -1 -1  1  1]
[-1 -1 -1  1  1  1 -1 -1  1]
[-1 -1 -1  1  1 -1  1  1 -1]
[ 1  1 -1  1 -1  1 -1 -1  1]
[ 1  1 -1 -1  1 -1  1  1 -1]
[-1  1  1 -1  1 -1  1  1 -1]
[ 1 -1  1  1 -1  1 -1 -1  1]

======================================

     vertices:  9
        edges:  17
automorphisms:  2
graph6-string:  H@GR[z{

Adjacency matrix:
[0 0 0 0 0 0 0 1 1]
[0 0 0 0 0 0 1 0 1]
[0 0 0 1 1 0 1 0 1]
[0 0 1 0 0 1 0 1 1]
[0 0 1 0 0 0 1 1 1]
[0 0 0 1 0 0 1 1 1]
[0 1 1 0 1 1 0 0 0]
[1 0 0 1 1 1 0 0 0]
[1 1 1 1 1 1 0 0 0]

(2x)Inverse of the Adjacency matrix:
[ 1  1 -1 -1  1 -1 -1  1  1]
[ 1  1 -1 -1 -1  1  1 -1  1]
[-1 -1  1  1  1 -1 -1 -1  1]
[-1 -1  1  1 -1  1 -1 -1  1]
[ 1 -1  1 -1  1 -1  1  1 -1]
[-1  1 -1  1 -1  1  1  1 -1]
[-1  1 -1 -1  1  1  1  1 -1]
[ 1 -1 -1 -1  1  1  1  1 -1]
[ 1  1  1  1 -1 -1 -1 -1  1]

======================================

     vertices:  9
        edges:  18
automorphisms:  72
graph6-string:  HBYleVS

Adjacency matrix:
[0 0 0 0 0 1 1 1 1]
[0 0 0 1 1 0 0 1 1]
[0 0 0 1 1 1 1 0 0]
[0 1 1 0 0 0 1 0 1]
[0 1 1 0 0 1 0 1 0]
[1 0 1 0 1 0 0 0 1]
[1 0 1 1 0 0 0 1 0]
[1 1 0 0 1 0 1 0 0]
[1 1 0 1 0 1 0 0 0]

(4x)Inverse of the Adjacency matrix:
[ 1 -1 -1 -1 -1  1  1  1  1]
[-1  1 -1  1  1 -1 -1  1  1]
[-1 -1  1  1  1  1  1 -1 -1]
[-1  1  1  1 -1 -1  1 -1  1]
[-1  1  1 -1  1  1 -1  1 -1]
[ 1 -1  1 -1  1  1 -1 -1  1]
[ 1 -1  1  1 -1 -1  1  1 -1]
[ 1  1 -1 -1  1 -1  1  1 -1]
[ 1  1 -1  1 -1  1 -1 -1  1]

======================================

     vertices:  11
        edges:  11
automorphisms:  22
graph6-string:  J?AEB?oE?W?

Adjacency matrix:
[0 0 0 0 0 1 1 0 0 0 0]
[0 0 0 0 0 0 1 1 0 0 0]
[0 0 0 0 0 0 0 1 1 0 0]
[0 0 0 0 0 0 0 0 1 1 0]
[0 0 0 0 0 0 0 0 0 1 1]
[1 0 0 0 0 0 0 0 0 0 1]
[1 1 0 0 0 0 0 0 0 0 0]
[0 1 1 0 0 0 0 0 0 0 0]
[0 0 1 1 0 0 0 0 0 0 0]
[0 0 0 1 1 0 0 0 0 0 0]
[0 0 0 0 1 1 0 0 0 0 0]

(2x)Inverse of the Adjacency matrix:
[-1  1 -1  1 -1  1  1 -1  1 -1  1]
[ 1 -1  1 -1  1 -1  1  1 -1  1 -1]
[-1  1 -1  1 -1  1 -1  1  1 -1  1]
[ 1 -1  1 -1  1 -1  1 -1  1  1 -1]
[-1  1 -1  1 -1  1 -1  1 -1  1  1]
[ 1 -1  1 -1  1 -1  1 -1  1 -1  1]
[ 1  1 -1  1 -1  1 -1  1 -1  1 -1]
[-1  1  1 -1  1 -1  1 -1  1 -1  1]
[ 1 -1  1  1 -1  1 -1  1 -1  1 -1]
[-1  1 -1  1  1 -1  1 -1  1 -1  1]
[ 1 -1  1 -1  1  1 -1  1 -1  1 -1]

======================================

     vertices:  11
        edges:  13
automorphisms:  2
graph6-string:  J?AAD?oU?[_

Adjacency matrix:
[0 0 0 0 0 1 0 1 0 0 0]
[0 0 0 0 0 0 1 0 0 1 0]
[0 0 0 0 0 0 0 1 1 0 0]
[0 0 0 0 0 0 0 0 1 1 0]
[0 0 0 0 0 0 0 0 0 1 1]
[1 0 0 0 0 0 0 0 0 0 1]
[0 1 0 0 0 0 0 0 0 0 1]
[1 0 1 0 0 0 0 0 0 0 0]
[0 0 1 1 0 0 0 0 0 0 0]
[0 1 0 1 1 0 0 0 0 0 1]
[0 0 0 0 1 1 1 0 0 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1  1 -1  1 -1  1 -1  1 -1  1 -1]
[ 1  1 -1  1 -1 -1  1  1 -1  1 -1]
[-1 -1  1 -1  1 -1  1  1  1 -1  1]
[ 1  1 -1  1 -1  1 -1 -1  1  1 -1]
[-1 -1  1 -1  1 -1 -1  1 -1  1  1]
[ 1 -1 -1  1 -1  1  1 -1  1 -1  1]
[-1  1  1 -1 -1  1  1 -1  1 -1  1]
[ 1  1  1 -1  1 -1 -1  1 -1  1 -1]
[-1 -1  1  1 -1  1  1 -1  1 -1  1]
[ 1  1 -1  1  1 -1 -1  1 -1  1 -1]
[-1 -1  1 -1  1  1  1 -1  1 -1  1]

======================================

     vertices:  11
        edges:  13
automorphisms:  4
graph6-string:  J?AA@_gs?[_

Adjacency matrix:
[0 0 0 0 0 1 0 0 0 1 0]
[0 0 0 0 0 0 1 0 0 1 0]
[0 0 0 0 0 0 0 1 1 0 0]
[0 0 0 0 0 0 0 1 0 1 0]
[0 0 0 0 0 0 0 0 1 0 1]
[1 0 0 0 0 0 0 0 0 0 1]
[0 1 0 0 0 0 0 0 0 0 1]
[0 0 1 1 0 0 0 0 0 0 0]
[0 0 1 0 1 0 0 0 0 0 0]
[1 1 0 1 0 0 0 0 0 0 1]
[0 0 0 0 1 1 1 0 0 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1  1  1 -1 -1  1 -1 -1  1  1 -1]
[ 1  1  1 -1 -1 -1  1 -1  1  1 -1]
[ 1  1  1 -1 -1  1  1  1  1 -1 -1]
[-1 -1 -1  1  1 -1 -1  1 -1  1  1]
[-1 -1 -1  1  1 -1 -1 -1  1  1  1]
[ 1 -1  1 -1 -1  1  1  1 -1 -1  1]
[-1  1  1 -1 -1  1  1  1 -1 -1  1]
[-1 -1  1  1 -1  1  1  1 -1 -1  1]
[ 1  1  1 -1  1 -1 -1 -1  1  1 -1]
[ 1  1 -1  1  1 -1 -1 -1  1  1 -1]
[-1 -1 -1  1  1  1  1  1 -1 -1  1]

======================================

     vertices:  11
        edges:  15
automorphisms:  2
graph6-string:  J?AAD@oFOV?

Adjacency matrix:
[0 0 0 0 0 1 0 1 0 0 0]
[0 0 0 0 0 0 1 0 1 0 0]
[0 0 0 0 0 0 0 1 1 0 0]
[0 0 0 0 0 0 0 0 1 1 0]
[0 0 0 0 0 0 0 0 0 1 1]
[1 0 0 0 0 0 0 0 0 1 0]
[0 1 0 0 0 0 0 0 0 0 1]
[1 0 1 0 0 0 0 0 0 1 1]
[0 1 1 1 0 0 0 0 0 0 1]
[0 0 0 1 1 1 0 1 0 0 0]
[0 0 0 0 1 0 1 1 1 0 0]

(2x)Inverse of the Adjacency matrix:
[-1  1  1 -1 -1  1  1  1 -1  1 -1]
[ 1 -1 -1  1 -1  1  1 -1  1 -1  1]
[ 1 -1 -1  1 -1 -1 -1  1  1 -1  1]
[-1  1  1 -1  1  1 -1 -1  1  1 -1]
[-1 -1 -1  1 -1 -1  1  1 -1  1  1]
[ 1  1 -1  1 -1 -1  1  1 -1  1 -1]
[ 1  1 -1 -1  1  1 -1 -1  1 -1  1]
[ 1 -1  1 -1  1  1 -1 -1  1 -1  1]
[-1  1  1  1 -1 -1  1  1 -1  1 -1]
[ 1 -1 -1  1  1  1 -1 -1  1 -1  1]
[-1  1  1 -1  1 -1  1  1 -1  1 -1]

======================================

     vertices:  11
        edges:  15
automorphisms:  8
graph6-string:  J?AA@_gw@{_

Adjacency matrix:
[0 0 0 0 0 1 0 0 0 1 0]
[0 0 0 0 0 0 1 0 0 1 0]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 1 0 0 1]
[0 0 0 0 0 0 0 0 1 0 1]
[1 0 0 0 0 0 0 0 0 0 1]
[0 1 0 0 0 0 0 0 0 0 1]
[0 0 1 1 0 0 0 0 0 0 0]
[0 0 1 0 1 0 0 0 0 0 0]
[1 1 1 0 0 0 0 0 0 0 1]
[0 0 1 1 1 1 1 0 0 1 0]

(2x)Inverse of the Adjacency matrix:
[-1 -1  1 -1 -1  1 -1 -1 -1  1  1]
[-1 -1  1 -1 -1 -1  1 -1 -1  1  1]
[ 1  1 -1  1  1 -1 -1  1  1  1 -1]
[-1 -1  1 -1 -1  1  1  1 -1 -1  1]
[-1 -1  1 -1 -1  1  1 -1  1 -1  1]
[ 1 -1 -1  1  1 -1 -1 -1 -1  1  1]
[-1  1 -1  1  1 -1 -1 -1 -1  1  1]
[-1 -1  1  1 -1 -1 -1 -1 -1  1  1]
[-1 -1  1 -1  1 -1 -1 -1 -1  1  1]
[ 1  1  1 -1 -1  1  1  1  1 -1 -1]
[ 1  1 -1  1  1  1  1  1  1 -1 -1]

======================================

     vertices:  11
        edges:  15
automorphisms:  2
graph6-string:  J?AEB?oZBo?

Adjacency matrix:
[0 0 0 0 0 1 1 0 0 0 0]
[0 0 0 0 0 0 1 1 0 1 1]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 0 1 0 1]
[0 0 0 0 0 0 0 0 0 1 1]
[1 0 0 0 0 0 0 0 0 1 0]
[1 1 0 0 0 0 0 0 0 0 0]
[0 1 1 0 0 0 0 0 0 0 0]
[0 0 1 1 0 0 0 0 0 0 0]
[0 1 1 0 1 1 0 0 0 0 0]
[0 1 1 1 1 0 0 0 0 0 0]

(2x)Inverse of the Adjacency matrix:
[-1  1 -1  1 -1  1  1 -1  1  1 -1]
[ 1 -1  1 -1  1 -1  1  1 -1 -1  1]
[-1  1 -1  1 -1  1 -1  1  1  1 -1]
[ 1 -1  1 -1  1 -1  1 -1  1 -1  1]
[-1  1 -1  1 -1  1 -1 -1 -1  1  1]
[ 1 -1  1 -1  1 -1  1 -1  1  1 -1]
[ 1  1 -1  1 -1  1 -1  1 -1 -1  1]
[-1  1  1 -1 -1 -1  1 -1  1  1 -1]
[ 1 -1  1  1 -1  1 -1  1 -1 -1  1]
[ 1 -1  1 -1  1  1 -1  1 -1 -1  1]
[-1  1 -1  1  1 -1  1 -1  1  1 -1]

======================================

     vertices:  11
        edges:  15
automorphisms:  2
graph6-string:  J?AE@bGJC`_

Adjacency matrix:
[0 0 0 0 0 1 1 0 1 0 1]
[0 0 0 0 0 0 1 0 1 0 0]
[0 0 0 0 0 0 0 1 0 1 0]
[0 0 0 0 0 0 0 1 0 0 1]
[0 0 0 0 0 0 0 0 1 1 0]
[1 0 0 0 0 0 0 0 0 1 0]
[1 1 0 0 0 0 0 0 0 0 0]
[0 0 1 1 0 0 0 0 0 0 0]
[1 1 0 0 1 0 0 0 0 0 1]
[0 0 1 0 1 1 0 0 0 0 1]
[1 0 0 1 0 0 0 0 1 1 0]

(2x)Inverse of the Adjacency matrix:
[-1  1 -1  1 -1  1  1 -1 -1  1  1]
[ 1 -1  1 -1  1 -1  1  1  1 -1 -1]
[-1  1 -1  1  1  1  1  1 -1  1 -1]
[ 1 -1  1 -1 -1 -1 -1  1  1 -1  1]
[-1  1  1 -1 -1 -1 -1 -1  1  1  1]
[ 1 -1  1 -1 -1 -1  1 -1 -1  1  1]
[ 1  1  1 -1 -1  1 -1  1  1 -1 -1]
[-1  1  1  1 -1 -1  1 -1 -1  1  1]
[-1  1 -1  1  1 -1  1 -1 -1  1  1]
[ 1 -1  1 -1  1  1 -1  1  1 -1 -1]
[ 1 -1 -1  1  1  1 -1  1  1 -1 -1]

======================================

     vertices:  11
        edges:  15
automorphisms:  2
graph6-string:  J?ABA_g{BW?

Adjacency matrix:
[0 0 0 0 0 1 0 0 0 1 0]
[0 0 0 0 0 0 1 1 0 1 1]
[0 0 0 0 0 0 1 0 1 1 1]
[0 0 0 0 0 0 0 1 0 1 0]
[0 0 0 0 0 0 0 0 1 0 1]
[1 0 0 0 0 0 0 0 0 0 1]
[0 1 1 0 0 0 0 0 0 0 0]
[0 1 0 1 0 0 0 0 0 0 0]
[0 0 1 0 1 0 0 0 0 0 0]
[1 1 1 1 0 0 0 0 0 0 0]
[0 1 1 0 1 1 0 0 0 0 0]

(2x)Inverse of the Adjacency matrix:
[-1 -1  1  1 -1  1 -1 -1 -1  1  1]
[-1 -1  1  1 -1  1  1  1 -1 -1  1]
[ 1  1 -1 -1  1 -1  1 -1  1  1 -1]
[ 1  1 -1 -1  1 -1 -1  1  1  1 -1]
[-1 -1  1  1 -1  1 -1  1  1 -1  1]
[ 1  1 -1 -1  1 -1 -1 -1 -1  1  1]
[-1  1  1 -1 -1 -1 -1 -1 -1  1  1]
[-1  1 -1  1  1 -1 -1 -1 -1  1  1]
[-1 -1  1  1  1 -1 -1 -1 -1  1  1]
[ 1 -1  1  1 -1  1  1  1  1 -1 -1]
[ 1  1 -1 -1  1  1  1  1  1 -1 -1]

======================================

     vertices:  11
        edges:  17
automorphisms:  2
graph6-string:  J?AA@BOiC~_

Adjacency matrix:
[0 0 0 0 0 1 0 0 1 1 1]
[0 0 0 0 0 0 1 0 1 0 0]
[0 0 0 0 0 0 0 1 0 1 0]
[0 0 0 0 0 0 0 0 1 0 1]
[0 0 0 0 0 0 0 0 0 1 1]
[1 0 0 0 0 0 0 0 0 0 1]
[0 1 0 0 0 0 0 0 0 0 1]
[0 0 1 0 0 0 0 0 0 0 1]
[1 1 0 1 0 0 0 0 0 0 1]
[1 0 1 0 1 0 0 0 0 0 1]
[1 0 0 1 1 1 1 1 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1  1  1 -1 -1  1 -1 -1  1  1 -1]
[ 1  1  1 -1 -1 -1  1 -1  1  1 -1]
[ 1  1  1 -1 -1 -1 -1  1  1  1 -1]
[-1 -1 -1  1  1 -1 -1  1  1 -1  1]
[-1 -1 -1  1  1 -1  1 -1 -1  1  1]
[ 1 -1 -1 -1 -1  1  1  1 -1 -1  1]
[-1  1 -1 -1  1  1  1  1 -1 -1  1]
[-1 -1  1  1 -1  1  1  1 -1 -1  1]
[ 1  1  1  1 -1 -1 -1 -1  1  1 -1]
[ 1  1  1 -1  1 -1 -1 -1  1  1 -1]
[-1 -1 -1  1  1  1  1  1 -1 -1  1]

======================================

     vertices:  11
        edges:  17
automorphisms:  12
graph6-string:  J?AAD@OaT}_

Adjacency matrix:
[0 0 0 0 0 1 0 1 0 1 1]
[0 0 0 0 0 0 1 0 1 0 0]
[0 0 0 0 0 0 0 1 0 0 1]
[0 0 0 0 0 0 0 0 1 0 1]
[0 0 0 0 0 0 0 0 0 1 1]
[1 0 0 0 0 0 0 0 0 0 1]
[0 1 0 0 0 0 0 0 0 0 1]
[1 0 1 0 0 0 0 0 0 1 1]
[0 1 0 1 0 0 0 0 0 0 0]
[1 0 0 0 1 0 0 1 0 0 1]
[1 0 1 1 1 1 1 1 0 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1  1 -1 -1 -1  1 -1  1  1  1 -1]
[ 1  1 -1 -1 -1 -1  1  1  1  1 -1]
[-1 -1  1  1 -1 -1  1  1 -1 -1  1]
[-1 -1  1  1  1  1 -1 -1  1 -1  1]
[-1 -1 -1  1  1 -1  1 -1 -1  1  1]
[ 1 -1 -1  1 -1  1  1 -1 -1 -1  1]
[-1  1  1 -1  1  1  1 -1 -1 -1  1]
[ 1  1  1 -1 -1 -1 -1  1  1  1 -1]
[ 1  1 -1  1 -1 -1 -1  1  1  1 -1]
[ 1  1 -1 -1  1 -1 -1  1  1  1 -1]
[-1 -1  1  1  1  1  1 -1 -1 -1  1]

======================================

     vertices:  11
        edges:  17
automorphisms:  2
graph6-string:  J?AAD@OzEs_

Adjacency matrix:
[0 0 0 0 0 1 0 1 0 1 1]
[0 0 0 0 0 0 1 0 1 1 1]
[0 0 0 0 0 0 0 1 0 1 0]
[0 0 0 0 0 0 0 0 1 0 1]
[0 0 0 0 0 0 0 0 0 1 1]
[1 0 0 0 0 0 0 0 0 1 0]
[0 1 0 0 0 0 0 0 0 0 1]
[1 0 1 0 0 0 0 0 0 0 0]
[0 1 0 1 0 0 0 0 0 0 0]
[1 1 1 0 1 1 0 0 0 0 1]
[1 1 0 1 1 0 1 0 0 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1 -1  1 -1  1  1  1 -1 -1  1]
[-1  1  1 -1 -1  1  1 -1  1  1 -1]
[-1  1  1 -1  1 -1 -1  1  1  1 -1]
[ 1 -1 -1  1  1 -1 -1  1  1 -1  1]
[-1 -1  1  1  1 -1 -1 -1 -1  1  1]
[ 1  1 -1 -1 -1  1 -1 -1  1  1 -1]
[ 1  1 -1 -1 -1 -1  1  1 -1 -1  1]
[ 1 -1  1  1 -1 -1  1  1 -1 -1  1]
[-1  1  1  1 -1  1 -1 -1  1  1 -1]
[-1  1  1 -1  1  1 -1 -1  1  1 -1]
[ 1 -1 -1  1  1 -1  1  1 -1 -1  1]

======================================

     vertices:  11
        edges:  17
automorphisms:  1
graph6-string:  J?AAD?o}D[_

Adjacency matrix:
[0 0 0 0 0 1 0 1 0 1 1]
[0 0 0 0 0 0 1 0 0 1 0]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 0 1 1 0]
[0 0 0 0 0 0 0 0 0 1 1]
[1 0 0 0 0 0 0 0 0 0 1]
[0 1 0 0 0 0 0 0 0 0 1]
[1 0 1 0 0 0 0 0 0 0 0]
[0 0 1 1 0 0 0 0 0 0 0]
[1 1 1 1 1 0 0 0 0 0 1]
[1 0 1 0 1 1 1 0 0 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1  1 -1  1 -1  1 -1  1 -1  1 -1]
[ 1  1 -1  1 -1 -1  1  1 -1  1 -1]
[-1 -1  1 -1  1 -1  1  1  1 -1  1]
[ 1  1 -1  1 -1  1 -1 -1  1  1 -1]
[-1 -1  1 -1  1 -1 -1 -1 -1  1  1]
[ 1 -1 -1  1 -1  1  1 -1  1 -1  1]
[-1  1  1 -1 -1  1  1 -1  1 -1  1]
[ 1  1  1 -1 -1 -1 -1  1 -1  1 -1]
[-1 -1  1  1 -1  1  1 -1  1 -1  1]
[ 1  1 -1  1  1 -1 -1  1 -1  1 -1]
[-1 -1  1 -1  1  1  1 -1  1 -1  1]

======================================

     vertices:  11
        edges:  17
automorphisms:  2
graph6-string:  J?AAD?o]P]_

Adjacency matrix:
[0 0 0 0 0 1 0 1 0 0 0]
[0 0 0 0 0 0 1 0 0 1 0]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 0 1 1 0]
[0 0 0 0 0 0 0 0 0 1 1]
[1 0 0 0 0 0 0 0 0 0 1]
[0 1 0 0 0 0 0 0 0 0 1]
[1 0 1 0 0 0 0 0 0 1 1]
[0 0 1 1 0 0 0 0 0 0 0]
[0 1 1 1 1 0 0 1 0 0 1]
[0 0 1 0 1 1 1 1 0 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1  1 -1  1 -1  1 -1  1 -1  1 -1]
[ 1  1 -1  1 -1 -1  1  1 -1  1 -1]
[-1 -1  1 -1 -1 -1  1  1  1 -1  1]
[ 1  1 -1  1  1  1 -1 -1  1  1 -1]
[-1 -1 -1  1  1  1 -1 -1 -1  1  1]
[ 1 -1 -1  1  1  1  1 -1  1 -1  1]
[-1  1  1 -1 -1  1  1 -1  1 -1  1]
[ 1  1  1 -1 -1 -1 -1  1 -1  1 -1]
[-1 -1  1  1 -1  1  1 -1  1 -1  1]
[ 1  1 -1  1  1 -1 -1  1 -1  1 -1]
[-1 -1  1 -1  1  1  1 -1  1 -1  1]

======================================

     vertices:  11
        edges:  17
automorphisms:  1
graph6-string:  J?AAD@ojDt?

Adjacency matrix:
[0 0 0 0 0 1 0 1 0 1 1]
[0 0 0 0 0 0 1 0 1 0 0]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 0 1 0 1]
[0 0 0 0 0 0 0 0 0 1 1]
[1 0 0 0 0 0 0 0 0 1 0]
[0 1 0 0 0 0 0 0 0 0 1]
[1 0 1 0 0 0 0 0 0 0 0]
[0 1 1 1 0 0 0 0 0 0 1]
[1 0 1 0 1 1 0 0 0 0 0]
[1 0 1 1 1 0 1 0 1 0 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1 -1  1 -1  1  1  1 -1 -1  1]
[-1  1  1 -1 -1  1  1 -1  1  1 -1]
[-1  1  1 -1  1 -1 -1  1  1  1 -1]
[ 1 -1 -1  1 -1  1 -1 -1  1 -1  1]
[-1 -1  1 -1  1 -1  1 -1 -1  1  1]
[ 1  1 -1  1 -1  1 -1 -1  1  1 -1]
[ 1  1 -1 -1  1 -1  1  1 -1 -1  1]
[ 1 -1  1 -1 -1 -1  1  1 -1 -1  1]
[-1  1  1  1 -1  1 -1 -1  1  1 -1]
[-1  1  1 -1  1  1 -1 -1  1  1 -1]
[ 1 -1 -1  1  1 -1  1  1 -1 -1  1]

======================================

     vertices:  11
        edges:  17
automorphisms:  1
graph6-string:  J?AAD@oRQv?

Adjacency matrix:
[0 0 0 0 0 1 0 1 0 0 0]
[0 0 0 0 0 0 1 0 1 1 1]
[0 0 0 0 0 0 0 1 1 0 0]
[0 0 0 0 0 0 0 0 1 0 1]
[0 0 0 0 0 0 0 0 0 1 1]
[1 0 0 0 0 0 0 0 0 1 0]
[0 1 0 0 0 0 0 0 0 0 1]
[1 0 1 0 0 0 0 0 0 1 1]
[0 1 1 1 0 0 0 0 0 0 1]
[0 1 0 0 1 1 0 1 0 0 0]
[0 1 0 1 1 0 1 1 1 0 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1 -1  1 -1  1  1  1 -1 -1  1]
[-1  1  1 -1 -1  1  1 -1  1  1 -1]
[-1  1  1 -1 -1 -1 -1  1  1  1 -1]
[ 1 -1 -1  1  1  1 -1 -1  1 -1  1]
[-1 -1 -1  1  1 -1 -1  1 -1  1  1]
[ 1  1 -1  1 -1  1 -1 -1  1  1 -1]
[ 1  1 -1 -1 -1 -1  1  1 -1 -1  1]
[ 1 -1  1 -1  1 -1  1  1 -1 -1  1]
[-1  1  1  1 -1  1 -1 -1  1  1 -1]
[-1  1  1 -1  1  1 -1 -1  1  1 -1]
[ 1 -1 -1  1  1 -1  1  1 -1 -1  1]

======================================

     vertices:  11
        edges:  17
automorphisms:  1
graph6-string:  J?AAD@oJPv?

Adjacency matrix:
[0 0 0 0 0 1 0 1 0 0 0]
[0 0 0 0 0 0 1 0 1 0 0]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 0 1 0 1]
[0 0 0 0 0 0 0 0 0 1 1]
[1 0 0 0 0 0 0 0 0 1 0]
[0 1 0 0 0 0 0 0 0 0 1]
[1 0 1 0 0 0 0 0 0 1 1]
[0 1 1 1 0 0 0 0 0 0 1]
[0 0 1 0 1 1 0 1 0 0 0]
[0 0 1 1 1 0 1 1 1 0 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1 -1  1 -1  1  1  1 -1 -1  1]
[-1  1  1 -1 -1  1  1 -1  1  1 -1]
[-1  1  1 -1 -1 -1 -1  1  1  1 -1]
[ 1 -1 -1  1  1  1 -1 -1  1 -1  1]
[-1 -1 -1  1  1  1  1 -1 -1  1  1]
[ 1  1 -1  1  1  1 -1 -1  1  1 -1]
[ 1  1 -1 -1  1 -1  1  1 -1 -1  1]
[ 1 -1  1 -1 -1 -1  1  1 -1 -1  1]
[-1  1  1  1 -1  1 -1 -1  1  1 -1]
[-1  1  1 -1  1  1 -1 -1  1  1 -1]
[ 1 -1 -1  1  1 -1  1  1 -1 -1  1]

======================================

     vertices:  11
        edges:  17
automorphisms:  1
graph6-string:  J?AA@b_mD\?

Adjacency matrix:
[0 0 0 0 0 1 0 0 1 1 1]
[0 0 0 0 0 0 1 0 1 0 0]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 1 0 1 0]
[0 0 0 0 0 0 0 0 0 1 1]
[1 0 0 0 0 0 0 0 0 0 1]
[0 1 0 0 0 0 0 0 0 0 1]
[0 0 1 1 0 0 0 0 0 0 0]
[1 1 1 0 0 0 0 0 0 0 1]
[1 0 1 1 1 0 0 0 0 0 0]
[1 0 1 0 1 1 1 0 1 0 0]

(2x)Inverse of the Adjacency matrix:
[ 1  1 -1  1 -1  1 -1 -1  1  1 -1]
[ 1  1 -1  1 -1 -1  1 -1  1  1 -1]
[-1 -1  1 -1  1 -1 -1  1  1 -1  1]
[ 1  1 -1  1 -1  1  1  1 -1  1 -1]
[-1 -1  1 -1  1 -1  1 -1 -1  1  1]
[ 1 -1 -1  1 -1  1  1  1 -1 -1  1]
[-1  1 -1  1  1  1  1  1 -1 -1  1]
[-1 -1  1  1 -1  1  1  1 -1 -1  1]
[ 1  1  1 -1 -1 -1 -1 -1  1  1 -1]
[ 1  1 -1  1  1 -1 -1 -1  1  1 -1]
[-1 -1  1 -1  1  1  1  1 -1 -1  1]

======================================

     vertices:  11
        edges:  17
automorphisms:  2
graph6-string:  J?AA@qoY@N_

Adjacency matrix:
[0 0 0 0 0 1 0 0 1 0 0]
[0 0 0 0 0 0 1 0 0 1 0]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 1 1 0 0]
[0 0 0 0 0 0 0 1 0 1 0]
[1 0 0 0 0 0 0 0 0 0 1]
[0 1 0 0 0 0 0 0 0 0 1]
[0 0 1 1 1 0 0 0 0 0 1]
[1 0 1 1 0 0 0 0 0 0 1]
[0 1 1 0 1 0 0 0 0 0 1]
[0 0 1 0 0 1 1 1 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1  1 -1  1  1  1 -1 -1  1  1 -1]
[ 1  1 -1  1  1 -1  1 -1  1  1 -1]
[-1 -1  1 -1 -1 -1 -1 -1  1  1  1]
[ 1  1 -1  1  1 -1  1  1  1 -1 -1]
[ 1  1 -1  1  1  1 -1  1 -1  1 -1]
[ 1 -1 -1 -1  1  1  1  1 -1 -1  1]
[-1  1 -1  1 -1  1  1  1 -1 -1  1]
[-1 -1 -1  1  1  1  1  1 -1 -1  1]
[ 1  1  1  1 -1 -1 -1 -1  1  1 -1]
[ 1  1  1 -1  1 -1 -1 -1  1  1 -1]
[-1 -1  1 -1 -1  1  1  1 -1 -1  1]

======================================

     vertices:  11
        edges:  17
automorphisms:  1
graph6-string:  J?AEB?oyFw?

Adjacency matrix:
[0 0 0 0 0 1 1 0 0 1 1]
[0 0 0 0 0 0 1 1 0 1 1]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 0 1 0 1]
[0 0 0 0 0 0 0 0 0 1 1]
[1 0 0 0 0 0 0 0 0 0 1]
[1 1 0 0 0 0 0 0 0 0 0]
[0 1 1 0 0 0 0 0 0 0 0]
[0 0 1 1 0 0 0 0 0 0 0]
[1 1 1 0 1 0 0 0 0 0 0]
[1 1 1 1 1 1 0 0 0 0 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1  1 -1 -1  1  1 -1  1  1 -1]
[-1  1 -1  1  1 -1  1  1 -1 -1  1]
[ 1 -1  1 -1 -1  1 -1  1  1  1 -1]
[-1  1 -1  1  1 -1  1 -1  1 -1  1]
[-1  1 -1  1  1 -1 -1 -1 -1  1  1]
[ 1 -1  1 -1 -1  1 -1  1 -1 -1  1]
[ 1  1 -1  1 -1 -1  1 -1  1  1 -1]
[-1  1  1 -1 -1  1 -1  1 -1 -1  1]
[ 1 -1  1  1 -1 -1  1 -1  1  1 -1]
[ 1 -1  1 -1  1 -1  1 -1  1  1 -1]
[-1  1 -1  1  1  1 -1  1 -1 -1  1]

======================================

     vertices:  11
        edges:  17
automorphisms:  1
graph6-string:  J?AEB?oYb{?

Adjacency matrix:
[0 0 0 0 0 1 1 0 0 0 0]
[0 0 0 0 0 0 1 1 0 1 1]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 0 1 0 1]
[0 0 0 0 0 0 0 0 0 1 1]
[1 0 0 0 0 0 0 0 0 0 1]
[1 1 0 0 0 0 0 0 0 1 1]
[0 1 1 0 0 0 0 0 0 0 0]
[0 0 1 1 0 0 0 0 0 0 0]
[0 1 1 0 1 0 1 0 0 0 0]
[0 1 1 1 1 1 1 0 0 0 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1  1 -1 -1  1  1 -1  1  1 -1]
[-1  1 -1  1 -1 -1  1  1 -1 -1  1]
[ 1 -1  1 -1  1  1 -1  1  1  1 -1]
[-1  1 -1  1 -1 -1  1 -1  1 -1  1]
[-1 -1  1 -1  1  1 -1 -1 -1  1  1]
[ 1 -1  1 -1  1  1 -1  1 -1 -1  1]
[ 1  1 -1  1 -1 -1  1 -1  1  1 -1]
[-1  1  1 -1 -1  1 -1  1 -1 -1  1]
[ 1 -1  1  1 -1 -1  1 -1  1  1 -1]
[ 1 -1  1 -1  1 -1  1 -1  1  1 -1]
[-1  1 -1  1  1  1 -1  1 -1 -1  1]

======================================

     vertices:  11
        edges:  17
automorphisms:  1
graph6-string:  J?AEB?oas}?

Adjacency matrix:
[0 0 0 0 0 1 1 0 0 1 1]
[0 0 0 0 0 0 1 1 0 0 0]
[0 0 0 0 0 0 0 1 1 0 0]
[0 0 0 0 0 0 0 0 1 0 1]
[0 0 0 0 0 0 0 0 0 1 1]
[1 0 0 0 0 0 0 0 0 0 1]
[1 1 0 0 0 0 0 0 0 1 1]
[0 1 1 0 0 0 0 0 0 1 1]
[0 0 1 1 0 0 0 0 0 0 0]
[1 0 0 0 1 0 1 1 0 0 0]
[1 0 0 1 1 1 1 1 0 0 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1  1 -1 -1  1  1 -1  1  1 -1]
[-1  1 -1  1 -1 -1  1  1 -1 -1  1]
[ 1 -1  1 -1 -1  1 -1  1  1  1 -1]
[-1  1 -1  1  1 -1  1 -1  1 -1  1]
[-1 -1 -1  1  1 -1 -1  1 -1  1  1]
[ 1 -1  1 -1 -1  1 -1  1 -1 -1  1]
[ 1  1 -1  1 -1 -1  1 -1  1  1 -1]
[-1  1  1 -1  1  1 -1  1 -1 -1  1]
[ 1 -1  1  1 -1 -1  1 -1  1  1 -1]
[ 1 -1  1 -1  1 -1  1 -1  1  1 -1]
[-1  1 -1  1  1  1 -1  1 -1 -1  1]

======================================

     vertices:  11
        edges:  17
automorphisms:  2
graph6-string:  J?AE@poJ`F?

Adjacency matrix:
[0 0 0 0 0 1 1 0 0 0 0]
[0 0 0 0 0 0 1 0 1 0 0]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 1 1 0 0]
[0 0 0 0 0 0 0 1 0 1 0]
[1 0 0 0 0 0 0 0 0 1 0]
[1 1 0 0 0 0 0 0 0 1 1]
[0 0 1 1 1 0 0 0 0 0 1]
[0 1 1 1 0 0 0 0 0 0 1]
[0 0 1 0 1 1 1 0 0 0 0]
[0 0 1 0 0 0 1 1 1 0 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1 -1  1 -1  1  1  1 -1 -1  1]
[-1  1 -1  1  1 -1  1 -1  1  1 -1]
[-1 -1  1 -1 -1  1 -1 -1  1  1  1]
[ 1  1 -1  1  1  1 -1  1  1 -1 -1]
[-1  1 -1  1  1 -1  1  1 -1  1 -1]
[ 1 -1  1  1 -1  1 -1 -1  1  1 -1]
[ 1  1 -1 -1  1 -1  1  1 -1 -1  1]
[ 1 -1 -1  1  1 -1  1  1 -1 -1  1]
[-1  1  1  1 -1  1 -1 -1  1  1 -1]
[-1  1  1 -1  1  1 -1 -1  1  1 -1]
[ 1 -1  1 -1 -1 -1  1  1 -1 -1  1]

======================================

     vertices:  11
        edges:  17
automorphisms:  1
graph6-string:  J?ABAaI[A\_

Adjacency matrix:
[0 0 0 0 0 1 0 0 1 0 0]
[0 0 0 0 0 0 1 1 0 1 1]
[0 0 0 0 0 0 1 0 0 1 0]
[0 0 0 0 0 0 0 1 0 1 0]
[0 0 0 0 0 0 0 0 1 0 1]
[1 0 0 0 0 0 0 0 0 0 1]
[0 1 1 0 0 0 0 0 1 0 1]
[0 1 0 1 0 0 0 0 0 0 0]
[1 0 0 0 1 0 1 0 0 0 1]
[0 1 1 1 0 0 0 0 0 0 1]
[0 1 0 0 1 1 1 0 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1  1  1 -1  1  1  1  1 -1 -1]
[-1  1 -1 -1 -1  1  1  1 -1 -1  1]
[ 1 -1  1  1 -1 -1  1 -1  1  1 -1]
[ 1 -1  1  1  1 -1 -1  1  1  1 -1]
[-1 -1 -1  1  1 -1 -1 -1  1  1  1]
[ 1  1 -1 -1 -1  1 -1 -1 -1  1  1]
[ 1  1  1 -1 -1 -1  1  1  1 -1 -1]
[ 1  1 -1  1 -1 -1  1  1  1 -1 -1]
[ 1 -1  1  1  1 -1  1  1  1 -1 -1]
[-1 -1  1  1  1  1 -1 -1 -1  1  1]
[-1  1 -1 -1  1  1 -1 -1 -1  1  1]

======================================

     vertices:  11
        edges:  17
automorphisms:  1
graph6-string:  J?ABAbgjF_?

Adjacency matrix:
[0 0 0 0 0 1 0 0 1 1 1]
[0 0 0 0 0 0 1 1 1 0 1]
[0 0 0 0 0 0 1 0 1 1 1]
[0 0 0 0 0 0 0 1 0 0 1]
[0 0 0 0 0 0 0 0 1 1 0]
[1 0 0 0 0 0 0 0 0 1 0]
[0 1 1 0 0 0 0 0 0 0 0]
[0 1 0 1 0 0 0 0 0 0 0]
[1 1 1 0 1 0 0 0 0 0 0]
[1 0 1 0 1 1 0 0 0 0 0]
[1 1 1 1 0 0 0 0 0 0 0]

(2x)Inverse of the Adjacency matrix:
[ 1  1 -1 -1 -1  1 -1 -1  1 -1  1]
[ 1  1 -1 -1 -1  1  1  1  1 -1 -1]
[-1 -1  1  1  1 -1  1 -1 -1  1  1]
[-1 -1  1  1  1 -1 -1  1 -1  1  1]
[-1 -1  1  1  1 -1 -1  1  1  1 -1]
[ 1  1 -1 -1 -1  1  1  1 -1  1 -1]
[-1  1  1 -1 -1  1  1  1 -1  1 -1]
[-1  1 -1  1  1  1  1  1 -1  1 -1]
[ 1  1 -1 -1  1 -1 -1 -1  1 -1  1]
[-1 -1  1  1  1  1  1  1 -1  1 -1]
[ 1 -1  1  1 -1 -1 -1 -1  1 -1  1]

======================================

     vertices:  11
        edges:  17
automorphisms:  2
graph6-string:  J?AB?rO[Ax_

Adjacency matrix:
[0 0 0 0 0 1 0 0 1 0 0]
[0 0 0 0 0 0 1 0 1 1 1]
[0 0 0 0 0 0 1 0 0 1 0]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 1 0 0 1]
[1 0 0 0 0 0 0 0 0 0 1]
[0 1 1 0 0 0 0 0 0 0 0]
[0 0 0 1 1 0 0 0 0 0 0]
[1 1 0 1 0 0 0 0 0 0 1]
[0 1 1 1 0 0 0 0 0 0 1]
[0 1 0 1 1 1 0 0 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1  1  1 -1  1  1  1  1 -1 -1]
[-1  1 -1 -1  1 -1  1 -1  1 -1  1]
[ 1 -1  1  1 -1  1  1  1 -1  1 -1]
[ 1 -1  1  1 -1 -1 -1  1  1  1 -1]
[-1  1 -1 -1  1  1  1  1 -1 -1  1]
[ 1 -1  1 -1  1  1 -1 -1 -1  1  1]
[ 1  1  1 -1  1 -1  1  1  1 -1 -1]
[ 1 -1  1  1  1 -1  1  1  1 -1 -1]
[ 1  1 -1  1 -1 -1  1  1  1 -1 -1]
[-1 -1  1  1 -1  1 -1 -1 -1  1  1]
[-1  1 -1 -1  1  1 -1 -1 -1  1  1]

======================================

     vertices:  11
        edges:  17
automorphisms:  4
graph6-string:  J?AB?rS{Eo?

Adjacency matrix:
[0 0 0 0 0 1 0 0 1 1 1]
[0 0 0 0 0 0 1 0 1 1 1]
[0 0 0 0 0 0 1 0 0 1 0]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 1 0 0 1]
[1 0 0 0 0 0 0 0 1 0 0]
[0 1 1 0 0 0 0 0 0 0 0]
[0 0 0 1 1 0 0 0 0 0 0]
[1 1 0 1 0 1 0 0 0 0 0]
[1 1 1 1 0 0 0 0 0 0 0]
[1 1 0 1 1 0 0 0 0 0 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1  1 -1  1  1 -1 -1 -1  1  1]
[-1  1 -1  1 -1 -1  1 -1  1 -1  1]
[ 1 -1  1 -1  1  1  1  1 -1  1 -1]
[-1  1 -1  1 -1 -1 -1  1  1  1 -1]
[ 1 -1  1 -1  1  1  1  1 -1 -1  1]
[ 1 -1  1 -1  1  1  1  1  1 -1 -1]
[-1  1  1 -1  1  1  1  1  1 -1 -1]
[-1 -1  1  1  1  1  1  1  1 -1 -1]
[-1  1 -1  1 -1  1  1  1  1 -1 -1]
[ 1 -1  1  1 -1 -1 -1 -1 -1  1  1]
[ 1  1 -1 -1  1 -1 -1 -1 -1  1  1]

======================================

     vertices:  11
        edges:  17
automorphisms:  1
graph6-string:  J?BD?pW{E`?

Adjacency matrix:
[0 0 0 0 0 1 1 0 0 1 1]
[0 0 0 0 0 1 0 0 1 1 1]
[0 0 0 0 0 0 1 0 0 1 0]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 1 1 0 0]
[1 1 0 0 0 0 0 0 0 0 0]
[1 0 1 0 0 0 0 0 0 0 0]
[0 0 0 1 1 0 0 0 0 0 0]
[0 1 0 1 1 0 0 0 0 0 1]
[1 1 1 1 0 0 0 0 0 0 0]
[1 1 0 1 0 0 0 0 1 0 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1 -1  1 -1  1  1  1 -1 -1  1]
[-1  1  1 -1  1  1 -1 -1  1  1 -1]
[-1  1  1 -1  1 -1  1 -1  1  1 -1]
[ 1 -1 -1  1 -1 -1 -1  1 -1  1  1]
[-1  1  1 -1  1  1  1  1  1 -1 -1]
[ 1  1 -1 -1  1  1 -1  1 -1  1 -1]
[ 1 -1  1 -1  1 -1  1 -1  1 -1  1]
[ 1 -1 -1  1  1  1 -1  1 -1  1 -1]
[-1  1  1 -1  1 -1  1 -1  1 -1  1]
[-1  1  1  1 -1  1 -1  1 -1  1 -1]
[ 1 -1 -1  1 -1 -1  1 -1  1 -1  1]

======================================

     vertices:  11
        edges:  17
automorphisms:  1
graph6-string:  J?BD?pWL_l?

Adjacency matrix:
[0 0 0 0 0 1 1 0 0 0 0]
[0 0 0 0 0 1 0 0 1 0 0]
[0 0 0 0 0 0 1 0 0 1 0]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 1 1 0 0]
[1 1 0 0 0 0 0 0 0 1 1]
[1 0 1 0 0 0 0 0 0 1 1]
[0 0 0 1 1 0 0 0 0 0 0]
[0 1 0 1 1 0 0 0 0 0 1]
[0 0 1 1 0 1 1 0 0 0 0]
[0 0 0 1 0 1 1 0 1 0 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1 -1 -1  1  1  1  1 -1 -1  1]
[-1  1  1 -1  1  1 -1 -1  1  1 -1]
[-1  1  1 -1  1 -1  1 -1  1  1 -1]
[-1 -1 -1  1 -1  1 -1  1 -1  1  1]
[ 1  1  1 -1  1 -1  1  1  1 -1 -1]
[ 1  1 -1  1 -1  1 -1  1 -1  1 -1]
[ 1 -1  1 -1  1 -1  1 -1  1 -1  1]
[ 1 -1 -1  1  1  1 -1  1 -1  1 -1]
[-1  1  1 -1  1 -1  1 -1  1 -1  1]
[-1  1  1  1 -1  1 -1  1 -1  1 -1]
[ 1 -1 -1  1 -1 -1  1 -1  1 -1  1]

======================================

     vertices:  11
        edges:  17
automorphisms:  2
graph6-string:  J?`@CbOISN_

Adjacency matrix:
[0 0 0 0 1 0 0 1 1 0 1]
[0 0 0 0 0 1 0 0 1 0 0]
[0 0 0 0 0 0 1 0 0 1 0]
[0 0 0 0 0 0 0 1 1 0 0]
[1 0 0 0 0 0 0 0 0 1 0]
[0 1 0 0 0 0 0 0 0 0 1]
[0 0 1 0 0 0 0 0 0 0 1]
[1 0 0 1 0 0 0 0 0 1 1]
[1 1 0 1 0 0 0 0 0 0 1]
[0 0 1 0 1 0 0 1 0 0 1]
[1 0 0 0 0 1 1 1 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1 -1 -1  1 -1  1 -1  1 -1  1]
[-1  1  1  1  1  1 -1 -1  1  1 -1]
[-1  1  1  1  1 -1  1 -1  1  1 -1]
[-1  1  1  1 -1 -1 -1  1  1  1 -1]
[ 1  1  1 -1  1 -1 -1 -1  1  1 -1]
[-1  1 -1 -1 -1  1 -1  1 -1  1  1]
[ 1 -1  1 -1 -1 -1  1 -1  1 -1  1]
[-1 -1 -1  1 -1  1 -1  1 -1  1  1]
[ 1  1  1  1  1 -1  1 -1  1 -1 -1]
[-1  1  1  1  1  1 -1  1 -1  1 -1]
[ 1 -1 -1 -1 -1  1  1  1 -1 -1  1]

======================================

     vertices:  11
        edges:  19
automorphisms:  8
graph6-string:  J?AAFBO}?^_

Adjacency matrix:
[0 0 0 0 0 1 0 1 1 1 0]
[0 0 0 0 0 0 1 1 1 1 0]
[0 0 0 0 0 0 0 1 0 1 0]
[0 0 0 0 0 0 0 0 1 1 0]
[0 0 0 0 0 0 0 0 0 1 1]
[1 0 0 0 0 0 0 0 0 0 1]
[0 1 0 0 0 0 0 0 0 0 1]
[1 1 1 0 0 0 0 0 0 0 1]
[1 1 0 1 0 0 0 0 0 0 1]
[1 1 1 1 1 0 0 0 0 0 1]
[0 0 0 0 1 1 1 1 1 1 0]

(2x)Inverse of the Adjacency matrix:
[-1 -1  1  1 -1  1 -1  1  1 -1  1]
[-1 -1  1  1 -1 -1  1  1  1 -1  1]
[ 1  1 -1 -1  1 -1 -1  1 -1  1 -1]
[ 1  1 -1 -1  1 -1 -1 -1  1  1 -1]
[-1 -1  1  1 -1  1  1 -1 -1  1  1]
[ 1 -1 -1 -1  1 -1 -1  1  1 -1  1]
[-1  1 -1 -1  1 -1 -1  1  1 -1  1]
[ 1  1  1 -1 -1  1  1 -1 -1  1 -1]
[ 1  1 -1  1 -1  1  1 -1 -1  1 -1]
[-1 -1  1  1  1 -1 -1  1  1 -1  1]
[ 1  1 -1 -1  1  1  1 -1 -1  1 -1]

======================================

     vertices:  11
        edges:  19
automorphisms:  1
graph6-string:  J?AAF@Sa~o_

Adjacency matrix:
[0 0 0 0 0 1 0 1 0 1 1]
[0 0 0 0 0 0 1 1 1 0 1]
[0 0 0 0 0 0 0 1 0 0 1]
[0 0 0 0 0 0 0 0 1 0 1]
[0 0 0 0 0 0 0 0 0 1 1]
[1 0 0 0 0 0 0 0 1 0 0]
[0 1 0 0 0 0 0 0 0 1 0]
[1 1 1 0 0 0 0 0 0 1 0]
[0 1 0 1 0 1 0 0 0 1 0]
[1 0 0 0 1 0 1 1 1 0 1]
[1 1 1 1 1 0 0 0 0 1 0]

(2x)Inverse of the Adjacency matrix:
[-1 -1  1 -1  1  1 -1  1  1  1 -1]
[-1 -1  1  1 -1 -1  1  1  1  1 -1]
[ 1  1 -1  1 -1 -1 -1  1 -1 -1  1]
[-1  1  1 -1  1  1 -1 -1  1 -1  1]
[ 1 -1 -1  1 -1 -1  1 -1 -1  1  1]
[ 1 -1 -1  1 -1 -1 -1  1  1  1 -1]
[-1  1 -1 -1  1 -1 -1  1  1  1 -1]
[ 1  1  1 -1 -1  1  1 -1 -1 -1  1]
[ 1  1 -1  1 -1  1  1 -1 -1 -1  1]
[ 1  1 -1 -1  1  1  1 -1 -1 -1  1]
[-1 -1  1  1  1 -1 -1  1  1  1 -1]

======================================

     vertices:  11
        edges:  19
automorphisms:  1
graph6-string:  J?AEBBoJfs?

Adjacency matrix:
[0 0 0 0 0 1 1 0 1 0 1]
[0 0 0 0 0 0 1 1 1 0 1]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 0 1 0 1]
[0 0 0 0 0 0 0 0 0 1 1]
[1 0 0 0 0 0 0 0 0 1 0]
[1 1 0 0 0 0 0 0 0 1 1]
[0 1 1 0 0 0 0 0 0 0 0]
[1 1 1 1 0 0 0 0 0 0 0]
[0 0 1 0 1 1 1 0 0 0 0]
[1 1 1 1 1 0 1 0 0 0 0]

(2x)Inverse of the Adjacency matrix:
[-1  1 -1  1 -1  1  1 -1  1  1 -1]
[ 1 -1  1 -1 -1 -1  1  1 -1 -1  1]
[-1  1 -1  1  1  1 -1  1  1  1 -1]
[ 1 -1  1 -1  1 -1 -1 -1  1 -1  1]
[-1 -1  1  1 -1 -1  1 -1 -1  1  1]
[ 1 -1  1 -1 -1 -1  1 -1  1  1 -1]
[ 1  1 -1 -1  1  1 -1  1 -1 -1  1]
[-1  1  1 -1 -1 -1  1 -1  1  1 -1]
[ 1 -1  1  1 -1  1 -1  1 -1 -1  1]
[ 1 -1  1 -1  1  1 -1  1 -1 -1  1]
[-1  1 -1  1  1 -1  1 -1  1  1 -1]

======================================

     vertices:  11
        edges:  19
automorphisms:  2
graph6-string:  J?AEB@sJb{?

Adjacency matrix:
[0 0 0 0 0 1 1 0 0 0 0]
[0 0 0 0 0 0 1 1 1 0 1]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 0 1 0 1]
[0 0 0 0 0 0 0 0 0 1 1]
[1 0 0 0 0 0 0 0 1 1 1]
[1 1 0 0 0 0 0 0 0 1 1]
[0 1 1 0 0 0 0 0 0 0 0]
[0 1 1 1 0 1 0 0 0 0 0]
[0 0 1 0 1 1 1 0 0 0 0]
[0 1 1 1 1 1 1 0 0 0 0]

(2x)Inverse of the Adjacency matrix:
[-1  1 -1 -1 -1  1  1 -1  1  1 -1]
[ 1 -1  1  1 -1 -1  1  1 -1 -1  1]
[-1  1 -1 -1  1  1 -1  1  1  1 -1]
[-1  1 -1 -1  1  1 -1 -1  1 -1  1]
[-1 -1  1  1 -1 -1  1 -1 -1  1  1]
[ 1 -1  1  1 -1 -1  1 -1  1  1 -1]
[ 1  1 -1 -1  1  1 -1  1 -1 -1  1]
[-1  1  1 -1 -1 -1  1 -1  1  1 -1]
[ 1 -1  1  1 -1  1 -1  1 -1 -1  1]
[ 1 -1  1 -1  1  1 -1  1 -1 -1  1]
[-1  1 -1  1  1 -1  1 -1  1  1 -1]

======================================

     vertices:  11
        edges:  19
automorphisms:  2
graph6-string:  J?ABA_Yubh_

Adjacency matrix:
[0 0 0 0 0 1 0 0 0 1 0]
[0 0 0 0 0 0 1 1 0 1 1]
[0 0 0 0 0 0 1 0 0 0 1]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 0 1 1 0]
[1 0 0 0 0 0 0 0 0 0 1]
[0 1 1 0 0 0 0 0 1 1 0]
[0 1 0 1 0 0 0 0 0 0 0]
[0 0 0 1 1 0 1 0 0 0 1]
[1 1 0 1 1 0 1 0 0 0 1]
[0 1 1 1 0 1 0 0 1 1 0]

(2x)Inverse of the Adjacency matrix:
[-1  1 -1 -1  1  1 -1 -1 -1  1  1]
[ 1 -1  1  1 -1 -1  1  1 -1  1 -1]
[-1  1 -1 -1 -1  1  1 -1  1 -1  1]
[-1  1 -1 -1  1  1 -1  1  1 -1  1]
[ 1 -1 -1  1 -1 -1  1 -1  1  1 -1]
[ 1 -1  1  1 -1 -1 -1 -1 -1  1  1]
[-1  1  1 -1  1 -1 -1 -1 -1  1  1]
[-1  1 -1  1 -1 -1 -1 -1 -1  1  1]
[-1 -1  1  1  1 -1 -1 -1 -1  1  1]
[ 1  1 -1 -1  1  1  1  1  1 -1 -1]
[ 1 -1  1  1 -1  1  1  1  1 -1 -1]

======================================

     vertices:  11
        edges:  19
automorphisms:  1
graph6-string:  J?BD?oslFp?

Adjacency matrix:
[0 0 0 0 0 1 1 0 0 1 1]
[0 0 0 0 0 1 0 0 0 0 1]
[0 0 0 0 0 0 1 0 1 1 1]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 1 0 0 1]
[1 1 0 0 0 0 0 0 1 1 0]
[1 0 1 0 0 0 0 0 0 0 0]
[0 0 0 1 1 0 0 0 0 0 0]
[0 0 1 1 0 1 0 0 0 0 1]
[1 0 1 1 0 1 0 0 0 0 0]
[1 1 1 1 1 0 0 0 1 0 0]

(2x)Inverse of the Adjacency matrix:
[-1  1  1 -1  1  1  1  1 -1  1 -1]
[ 1 -1 -1 -1  1  1 -1 -1  1 -1  1]
[ 1 -1 -1  1 -1 -1  1 -1  1 -1  1]
[-1 -1  1 -1  1  1 -1  1  1  1 -1]
[ 1  1 -1  1 -1 -1  1  1 -1 -1  1]
[ 1  1 -1  1 -1 -1 -1 -1 -1  1  1]
[ 1 -1  1 -1  1 -1 -1 -1 -1  1  1]
[ 1 -1 -1  1  1 -1 -1 -1 -1  1  1]
[-1  1  1  1 -1 -1 -1 -1 -1  1  1]
[ 1 -1 -1  1 -1  1  1  1  1 -1 -1]
[-1  1  1 -1  1  1  1  1  1 -1 -1]

======================================

     vertices:  11
        edges:  19
automorphisms:  2
graph6-string:  J?B@eQwj@Y?

Adjacency matrix:
[0 0 0 0 0 1 0 1 1 1 0]
[0 0 0 0 0 1 0 1 0 0 0]
[0 0 0 0 0 0 1 0 1 1 1]
[0 0 0 0 0 0 1 0 1 0 0]
[0 0 0 0 0 0 0 1 1 1 1]
[1 1 0 0 0 0 0 0 0 1 1]
[0 0 1 1 0 0 0 0 0 0 0]
[1 1 0 0 1 0 0 0 0 0 1]
[1 0 1 1 1 0 0 0 0 0 0]
[1 0 1 0 1 1 0 0 0 0 0]
[0 0 1 0 1 1 0 1 0 0 0]

(2x)Inverse of the Adjacency matrix:
[-1  1 -1  1  1  1 -1 -1  1  1 -1]
[ 1 -1 -1  1 -1  1  1  1 -1 -1  1]
[-1 -1 -1  1  1  1  1 -1 -1  1  1]
[ 1  1  1 -1 -1 -1  1  1  1 -1 -1]
[ 1 -1  1 -1 -1 -1 -1  1  1 -1  1]
[ 1  1  1 -1 -1 -1  1  1 -1  1 -1]
[-1  1  1  1 -1  1 -1 -1  1 -1  1]
[-1  1 -1  1  1  1 -1 -1  1 -1  1]
[ 1 -1 -1  1  1 -1  1  1 -1  1 -1]
[ 1 -1  1 -1 -1  1 -1 -1  1 -1  1]
[-1  1  1 -1  1 -1  1  1 -1  1 -1]

======================================

     vertices:  11
        edges:  21
automorphisms:  2
graph6-string:  J?AADBoR]v_

Adjacency matrix:
[0 0 0 0 0 1 0 1 1 0 1]
[0 0 0 0 0 0 1 0 1 1 1]
[0 0 0 0 0 0 0 1 1 0 0]
[0 0 0 0 0 0 0 0 1 0 1]
[0 0 0 0 0 0 0 0 0 1 1]
[1 0 0 0 0 0 0 0 0 1 0]
[0 1 0 0 0 0 0 0 0 0 1]
[1 0 1 0 0 0 0 0 0 1 1]
[1 1 1 1 0 0 0 0 0 1 1]
[0 1 0 0 1 1 0 1 1 0 1]
[1 1 0 1 1 0 1 1 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1 -1  1 -1  1  1  1 -1 -1  1]
[-1  1  1 -1 -1  1  1 -1  1  1 -1]
[-1  1  1 -1 -1 -1 -1  1  1  1 -1]
[ 1 -1 -1  1  1 -1 -1 -1  1 -1  1]
[-1 -1 -1  1  1 -1 -1  1 -1  1  1]
[ 1  1 -1 -1 -1  1 -1 -1  1  1 -1]
[ 1  1 -1 -1 -1 -1  1  1 -1 -1  1]
[ 1 -1  1 -1  1 -1  1  1 -1 -1  1]
[-1  1  1  1 -1  1 -1 -1  1  1 -1]
[-1  1  1 -1  1  1 -1 -1  1  1 -1]
[ 1 -1 -1  1  1 -1  1  1 -1 -1  1]

======================================

     vertices:  11
        edges:  21
automorphisms:  1
graph6-string:  J?AADAsZT}_

Adjacency matrix:
[0 0 0 0 0 1 0 1 1 0 1]
[0 0 0 0 0 0 1 0 0 1 0]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 0 1 0 1]
[0 0 0 0 0 0 0 0 0 1 1]
[1 0 0 0 0 0 0 0 1 1 1]
[0 1 0 0 0 0 0 0 0 0 1]
[1 0 1 0 0 0 0 0 0 1 1]
[1 0 1 1 0 1 0 0 0 0 0]
[0 1 1 0 1 1 0 1 0 0 1]
[1 0 1 1 1 1 1 1 0 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1 -1 -1 -1  1  1  1 -1 -1  1]
[-1  1  1 -1 -1  1  1 -1  1  1 -1]
[-1  1  1  1 -1 -1 -1  1  1  1 -1]
[-1 -1  1  1  1 -1  1 -1  1 -1  1]
[-1 -1 -1  1  1  1 -1 -1 -1  1  1]
[ 1  1 -1 -1  1  1 -1 -1  1  1 -1]
[ 1  1 -1  1 -1 -1  1  1 -1 -1  1]
[ 1 -1  1 -1 -1 -1  1  1 -1 -1  1]
[-1  1  1  1 -1  1 -1 -1  1  1 -1]
[-1  1  1 -1  1  1 -1 -1  1  1 -1]
[ 1 -1 -1  1  1 -1  1  1 -1 -1  1]

======================================

     vertices:  11
        edges:  21
automorphisms:  1
graph6-string:  J?AADAsR[~_

Adjacency matrix:
[0 0 0 0 0 1 0 1 1 0 1]
[0 0 0 0 0 0 1 0 0 1 0]
[0 0 0 0 0 0 0 1 1 0 0]
[0 0 0 0 0 0 0 0 1 0 1]
[0 0 0 0 0 0 0 0 0 1 1]
[1 0 0 0 0 0 0 0 1 1 1]
[0 1 0 0 0 0 0 0 0 0 1]
[1 0 1 0 0 0 0 0 0 1 1]
[1 0 1 1 0 1 0 0 0 1 1]
[0 1 0 0 1 1 0 1 1 0 1]
[1 0 0 1 1 1 1 1 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1 -1 -1 -1  1  1  1 -1 -1  1]
[-1  1  1 -1 -1  1  1 -1  1  1 -1]
[-1  1  1  1 -1 -1 -1  1  1  1 -1]
[-1 -1  1  1  1 -1  1 -1  1 -1  1]
[-1 -1 -1  1  1 -1 -1  1 -1  1  1]
[ 1  1 -1 -1 -1  1 -1 -1  1  1 -1]
[ 1  1 -1  1 -1 -1  1  1 -1 -1  1]
[ 1 -1  1 -1  1 -1  1  1 -1 -1  1]
[-1  1  1  1 -1  1 -1 -1  1  1 -1]
[-1  1  1 -1  1  1 -1 -1  1  1 -1]
[ 1 -1 -1  1  1 -1  1  1 -1 -1  1]

======================================

     vertices:  11
        edges:  21
automorphisms:  1
graph6-string:  J?AAFAs~B]?

Adjacency matrix:
[0 0 0 0 0 1 0 1 1 1 0]
[0 0 0 0 0 0 1 1 0 1 1]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 0 1 1 0]
[0 0 0 0 0 0 0 0 0 1 1]
[1 0 0 0 0 0 0 0 1 1 1]
[0 1 0 0 0 0 0 0 0 0 1]
[1 1 1 0 0 0 0 0 0 0 1]
[1 0 1 1 0 1 0 0 0 0 0]
[1 1 1 1 1 1 0 0 0 0 0]
[0 1 1 0 1 1 1 1 0 0 0]

(2x)Inverse of the Adjacency matrix:
[ 1  1 -1 -1 -1  1 -1  1 -1  1 -1]
[ 1  1 -1  1 -1 -1  1  1 -1  1 -1]
[-1 -1  1  1  1 -1 -1  1  1 -1  1]
[-1  1  1  1 -1 -1  1 -1  1  1 -1]
[-1 -1  1 -1  1  1 -1 -1 -1  1  1]
[ 1 -1 -1 -1  1  1  1 -1  1 -1  1]
[-1  1 -1  1 -1  1  1 -1  1 -1  1]
[ 1  1  1 -1 -1 -1 -1  1 -1  1 -1]
[-1 -1  1  1 -1  1  1 -1  1 -1  1]
[ 1  1 -1  1  1 -1 -1  1 -1  1 -1]
[-1 -1  1 -1  1  1  1 -1  1 -1  1]

======================================

     vertices:  11
        edges:  21
automorphisms:  1
graph6-string:  J?AAFBw|@V_

Adjacency matrix:
[0 0 0 0 0 1 0 1 1 1 0]
[0 0 0 0 0 0 1 1 1 1 0]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 0 1 1 0]
[0 0 0 0 0 0 0 0 1 0 1]
[1 0 0 0 0 0 0 0 0 1 0]
[0 1 0 0 0 0 0 0 0 0 1]
[1 1 1 0 0 0 0 0 0 0 1]
[1 1 1 1 1 0 0 0 0 0 1]
[1 1 1 1 0 1 0 0 0 0 1]
[0 0 1 0 1 0 1 1 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1  1 -1 -1  1  1 -1  1  1 -1 -1]
[ 1  1 -1  1 -1 -1  1  1  1 -1 -1]
[-1 -1  1  1 -1 -1 -1  1 -1  1  1]
[-1  1  1  1 -1 -1 -1 -1  1  1 -1]
[ 1 -1 -1 -1  1  1  1 -1  1 -1  1]
[ 1 -1 -1 -1  1  1  1 -1 -1  1  1]
[-1  1 -1 -1  1  1  1 -1 -1  1  1]
[ 1  1  1 -1 -1 -1 -1  1  1 -1 -1]
[ 1  1 -1  1  1 -1 -1  1  1 -1 -1]
[-1 -1  1  1 -1  1  1 -1 -1  1  1]
[-1 -1  1 -1  1  1  1 -1 -1  1  1]

======================================

     vertices:  11
        edges:  21
automorphisms:  1
graph6-string:  J?AAFB[|?^_

Adjacency matrix:
[0 0 0 0 0 1 0 1 1 1 0]
[0 0 0 0 0 0 1 1 1 1 0]
[0 0 0 0 0 0 0 1 0 1 0]
[0 0 0 0 0 0 0 0 1 1 0]
[0 0 0 0 0 0 0 0 1 0 1]
[1 0 0 0 0 0 0 0 1 1 1]
[0 1 0 0 0 0 0 0 0 0 1]
[1 1 1 0 0 0 0 0 0 0 1]
[1 1 0 1 1 1 0 0 0 0 1]
[1 1 1 1 0 1 0 0 0 0 1]
[0 0 0 0 1 1 1 1 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1  1 -1 -1 -1  1 -1  1  1 -1 -1]
[ 1  1 -1  1 -1 -1  1  1  1 -1 -1]
[-1 -1  1  1  1 -1 -1  1 -1  1  1]
[-1  1  1  1  1 -1 -1 -1  1  1 -1]
[-1 -1  1  1  1 -1 -1  1  1 -1  1]
[ 1 -1 -1 -1 -1  1  1 -1 -1  1  1]
[-1  1 -1 -1 -1  1  1 -1 -1  1  1]
[ 1  1  1 -1  1 -1 -1  1  1 -1 -1]
[ 1  1 -1  1  1 -1 -1  1  1 -1 -1]
[-1 -1  1  1 -1  1  1 -1 -1  1  1]
[-1 -1  1 -1  1  1  1 -1 -1  1  1]

======================================

     vertices:  11
        edges:  21
automorphisms:  2
graph6-string:  J?AAF@tVO^_

Adjacency matrix:
[0 0 0 0 0 1 0 1 0 0 0]
[0 0 0 0 0 0 1 1 1 1 0]
[0 0 0 0 0 0 0 1 1 0 0]
[0 0 0 0 0 0 0 0 1 1 0]
[0 0 0 0 0 0 0 0 0 1 1]
[1 0 0 0 0 0 0 0 1 1 1]
[0 1 0 0 0 0 0 0 0 0 1]
[1 1 1 0 0 0 0 0 1 1 1]
[0 1 1 1 0 1 0 1 0 0 1]
[0 1 0 1 1 1 0 1 0 0 1]
[0 0 0 0 1 1 1 1 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1  1 -1 -1 -1  1 -1  1 -1  1 -1]
[ 1  1 -1  1 -1 -1  1  1 -1  1 -1]
[-1 -1  1 -1  1 -1 -1  1  1 -1  1]
[-1  1 -1  1 -1  1 -1 -1  1  1 -1]
[-1 -1  1 -1  1 -1 -1  1 -1  1  1]
[ 1 -1 -1  1 -1  1  1 -1  1 -1  1]
[-1  1 -1 -1 -1  1  1 -1  1 -1  1]
[ 1  1  1 -1  1 -1 -1  1 -1  1 -1]
[-1 -1  1  1 -1  1  1 -1  1 -1  1]
[ 1  1 -1  1  1 -1 -1  1 -1  1 -1]
[-1 -1  1 -1  1  1  1 -1  1 -1  1]

======================================

     vertices:  11
        edges:  21
automorphisms:  1
graph6-string:  J?AADb_}B^_

Adjacency matrix:
[0 0 0 0 0 1 0 1 1 1 0]
[0 0 0 0 0 0 1 0 1 1 1]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 1 0 1 0]
[0 0 0 0 0 0 0 0 0 1 1]
[1 0 0 0 0 0 0 0 0 0 1]
[0 1 0 0 0 0 0 0 0 0 1]
[1 0 1 1 0 0 0 0 0 0 1]
[1 1 1 0 0 0 0 0 0 0 1]
[1 1 1 1 1 0 0 0 0 0 1]
[0 1 1 0 1 1 1 1 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1  1 -1  1 -1  1 -1 -1  1  1 -1]
[ 1  1 -1  1 -1 -1  1 -1  1  1 -1]
[-1 -1  1 -1  1 -1 -1  1  1 -1  1]
[ 1  1 -1  1 -1 -1  1  1 -1  1 -1]
[-1 -1  1 -1  1  1 -1 -1 -1  1  1]
[ 1 -1 -1 -1  1  1  1  1 -1 -1  1]
[-1  1 -1  1 -1  1  1  1 -1 -1  1]
[-1 -1  1  1 -1  1  1  1 -1 -1  1]
[ 1  1  1 -1 -1 -1 -1 -1  1  1 -1]
[ 1  1 -1  1  1 -1 -1 -1  1  1 -1]
[-1 -1  1 -1  1  1  1  1 -1 -1  1]

======================================

     vertices:  11
        edges:  21
automorphisms:  1
graph6-string:  J?AADbwybJ_

Adjacency matrix:
[0 0 0 0 0 1 0 1 1 1 0]
[0 0 0 0 0 0 1 0 1 1 1]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 1 1 0 0]
[0 0 0 0 0 0 0 0 1 1 0]
[1 0 0 0 0 0 0 0 0 0 1]
[0 1 0 0 0 0 0 0 0 1 0]
[1 0 1 1 0 0 0 0 0 0 1]
[1 1 1 1 1 0 0 0 0 0 1]
[1 1 1 0 1 0 1 0 0 0 1]
[0 1 1 0 0 1 0 1 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1 -1  1  1  1  1  1 -1  1 -1]
[-1  1 -1  1 -1  1  1 -1  1 -1  1]
[-1 -1  1 -1  1 -1 -1  1 -1  1  1]
[ 1  1 -1  1 -1 -1  1  1  1 -1 -1]
[ 1 -1  1 -1  1 -1 -1 -1  1  1 -1]
[ 1  1 -1 -1 -1  1 -1 -1  1 -1  1]
[ 1  1 -1  1 -1 -1  1  1 -1  1 -1]
[ 1 -1  1  1 -1 -1  1  1 -1  1 -1]
[-1  1 -1  1  1  1 -1 -1  1 -1  1]
[ 1 -1  1 -1  1 -1  1  1 -1  1 -1]
[-1  1  1 -1 -1  1 -1 -1  1 -1  1]

======================================

     vertices:  11
        edges:  21
automorphisms:  1
graph6-string:  J?AADa{z@N_

Adjacency matrix:
[0 0 0 0 0 1 0 1 1 1 0]
[0 0 0 0 0 0 1 0 0 1 0]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 1 1 0 0]
[0 0 0 0 0 0 0 0 1 1 0]
[1 0 0 0 0 0 0 0 1 1 1]
[0 1 0 0 0 0 0 0 0 0 1]
[1 0 1 1 0 0 0 0 0 0 1]
[1 0 1 1 1 1 0 0 0 0 1]
[1 1 1 0 1 1 0 0 0 0 1]
[0 0 1 0 0 1 1 1 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1  1 -1  1 -1  1 -1  1 -1  1 -1]
[ 1  1 -1  1  1 -1  1  1 -1  1 -1]
[-1 -1  1 -1  1 -1 -1  1 -1  1  1]
[ 1  1 -1  1  1 -1  1  1  1 -1 -1]
[-1  1  1  1  1 -1 -1 -1  1  1 -1]
[ 1 -1 -1 -1 -1  1  1 -1  1 -1  1]
[-1  1 -1  1 -1  1  1 -1  1 -1  1]
[ 1  1  1  1 -1 -1 -1  1 -1  1 -1]
[-1 -1 -1  1  1  1  1 -1  1 -1  1]
[ 1  1  1 -1  1 -1 -1  1 -1  1 -1]
[-1 -1  1 -1 -1  1  1 -1  1 -1  1]

======================================

     vertices:  11
        edges:  21
automorphisms:  1
graph6-string:  J?AAD_|ZPN_

Adjacency matrix:
[0 0 0 0 0 1 0 1 0 0 0]
[0 0 0 0 0 0 1 0 0 1 0]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 1 1 0 0]
[0 0 0 0 0 0 0 0 1 1 0]
[1 0 0 0 0 0 0 0 1 1 1]
[0 1 0 0 0 0 0 0 0 0 1]
[1 0 1 1 0 0 0 0 1 1 1]
[0 0 1 1 1 1 0 1 0 0 1]
[0 1 1 0 1 1 0 1 0 0 1]
[0 0 1 0 0 1 1 1 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1  1 -1  1 -1  1 -1  1 -1  1 -1]
[ 1  1 -1  1  1 -1  1  1 -1  1 -1]
[-1 -1  1 -1 -1 -1 -1  1 -1  1  1]
[ 1  1 -1  1  1 -1  1  1  1 -1 -1]
[-1  1 -1  1  1  1 -1 -1  1  1 -1]
[ 1 -1 -1 -1  1  1  1 -1  1 -1  1]
[-1  1 -1  1 -1  1  1 -1  1 -1  1]
[ 1  1  1  1 -1 -1 -1  1 -1  1 -1]
[-1 -1 -1  1  1  1  1 -1  1 -1  1]
[ 1  1  1 -1  1 -1 -1  1 -1  1 -1]
[-1 -1  1 -1 -1  1  1 -1  1 -1  1]

======================================

     vertices:  11
        edges:  21
automorphisms:  1
graph6-string:  J?AE@b_yb|_

Adjacency matrix:
[0 0 0 0 0 1 1 0 1 1 0]
[0 0 0 0 0 0 1 0 1 1 1]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 1 0 0 1]
[0 0 0 0 0 0 0 0 0 1 1]
[1 0 0 0 0 0 0 0 0 0 1]
[1 1 0 0 0 0 0 0 0 1 1]
[0 0 1 1 0 0 0 0 0 0 0]
[1 1 1 0 0 0 0 0 0 0 1]
[1 1 1 0 1 0 1 0 0 0 1]
[0 1 1 1 1 1 1 0 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1  1 -1 -1  1  1  1 -1  1 -1]
[-1  1 -1  1 -1 -1  1 -1  1 -1  1]
[ 1 -1  1 -1  1 -1 -1  1  1  1 -1]
[-1  1 -1  1 -1  1  1  1 -1 -1  1]
[-1 -1  1 -1  1  1 -1 -1 -1  1  1]
[ 1 -1 -1  1  1  1 -1 -1  1 -1  1]
[ 1  1 -1  1 -1 -1  1  1 -1  1 -1]
[ 1 -1  1  1 -1 -1  1  1 -1  1 -1]
[-1  1  1 -1 -1  1 -1 -1  1 -1  1]
[ 1 -1  1 -1  1 -1  1  1 -1  1 -1]
[-1  1 -1  1  1  1 -1 -1  1 -1  1]

======================================

     vertices:  11
        edges:  21
automorphisms:  1
graph6-string:  J?AE@b_yRz_

Adjacency matrix:
[0 0 0 0 0 1 1 0 1 1 0]
[0 0 0 0 0 0 1 0 1 1 1]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 1 0 0 1]
[0 0 0 0 0 0 0 0 0 1 1]
[1 0 0 0 0 0 0 0 0 0 1]
[1 1 0 0 0 0 0 0 0 0 0]
[0 0 1 1 0 0 0 0 0 1 1]
[1 1 1 0 0 0 0 0 0 0 1]
[1 1 1 0 1 0 0 1 0 0 1]
[0 1 1 1 1 1 0 1 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1  1 -1 -1  1  1  1 -1  1 -1]
[-1  1 -1  1  1 -1  1 -1  1 -1  1]
[ 1 -1  1 -1 -1 -1 -1  1  1  1 -1]
[-1  1 -1  1 -1  1  1  1 -1 -1  1]
[-1  1 -1 -1  1  1 -1 -1 -1  1  1]
[ 1 -1 -1  1  1  1 -1 -1  1 -1  1]
[ 1  1 -1  1 -1 -1  1  1 -1  1 -1]
[ 1 -1  1  1 -1 -1  1  1 -1  1 -1]
[-1  1  1 -1 -1  1 -1 -1  1 -1  1]
[ 1 -1  1 -1  1 -1  1  1 -1  1 -1]
[-1  1 -1  1  1  1 -1 -1  1 -1  1]

======================================

     vertices:  11
        edges:  21
automorphisms:  1
graph6-string:  J?AE@bc^f[?

Adjacency matrix:
[0 0 0 0 0 1 1 0 1 0 1]
[0 0 0 0 0 0 1 0 1 1 1]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 1 0 1 0]
[0 0 0 0 0 0 0 0 0 1 1]
[1 0 0 0 0 0 0 0 1 1 1]
[1 1 0 0 0 0 0 0 0 1 1]
[0 0 1 1 0 0 0 0 0 0 0]
[1 1 1 0 0 1 0 0 0 0 0]
[0 1 1 1 1 1 1 0 0 0 0]
[1 1 1 0 1 1 1 0 0 0 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1 -1  1 -1  1  1  1 -1 -1  1]
[-1  1  1 -1 -1 -1  1 -1  1  1 -1]
[-1  1  1 -1  1 -1 -1  1  1 -1  1]
[ 1 -1 -1  1 -1  1  1  1 -1  1 -1]
[-1 -1  1 -1  1  1 -1 -1 -1  1  1]
[ 1 -1 -1  1  1  1 -1 -1  1  1 -1]
[ 1  1 -1  1 -1 -1  1  1 -1 -1  1]
[ 1 -1  1  1 -1 -1  1  1 -1 -1  1]
[-1  1  1 -1 -1  1 -1 -1  1  1 -1]
[-1  1 -1  1  1  1 -1 -1  1  1 -1]
[ 1 -1  1 -1  1 -1  1  1 -1 -1  1]

======================================

     vertices:  11
        edges:  21
automorphisms:  1
graph6-string:  J?AE@bc^VY?

Adjacency matrix:
[0 0 0 0 0 1 1 0 1 0 1]
[0 0 0 0 0 0 1 0 1 1 1]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 1 0 1 0]
[0 0 0 0 0 0 0 0 0 1 1]
[1 0 0 0 0 0 0 0 1 1 1]
[1 1 0 0 0 0 0 0 0 0 0]
[0 0 1 1 0 0 0 0 0 1 1]
[1 1 1 0 0 1 0 0 0 0 0]
[0 1 1 1 1 1 0 1 0 0 0]
[1 1 1 0 1 1 0 1 0 0 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1 -1  1 -1  1  1  1 -1 -1  1]
[-1  1  1 -1  1 -1  1 -1  1  1 -1]
[-1  1  1 -1 -1 -1 -1  1  1 -1  1]
[ 1 -1 -1  1 -1  1  1  1 -1  1 -1]
[-1  1 -1 -1  1  1 -1 -1 -1  1  1]
[ 1 -1 -1  1  1  1 -1 -1  1  1 -1]
[ 1  1 -1  1 -1 -1  1  1 -1 -1  1]
[ 1 -1  1  1 -1 -1  1  1 -1 -1  1]
[-1  1  1 -1 -1  1 -1 -1  1  1 -1]
[-1  1 -1  1  1  1 -1 -1  1  1 -1]
[ 1 -1  1 -1  1 -1  1  1 -1 -1  1]

======================================

     vertices:  11
        edges:  21
automorphisms:  1
graph6-string:  J?AE@bi}BL_

Adjacency matrix:
[0 0 0 0 0 1 1 0 1 1 0]
[0 0 0 0 0 0 1 0 1 1 1]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 1 0 1 0]
[0 0 0 0 0 0 0 0 1 1 0]
[1 0 0 0 0 0 0 0 0 0 1]
[1 1 0 0 0 0 0 0 1 0 1]
[0 0 1 1 0 0 0 0 0 0 0]
[1 1 1 0 1 0 1 0 0 0 1]
[1 1 1 1 1 0 0 0 0 0 1]
[0 1 1 0 0 1 1 0 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1 -1  1  1  1  1  1  1 -1 -1]
[-1  1 -1  1 -1 -1  1 -1 -1  1  1]
[-1 -1  1 -1  1  1 -1  1  1 -1  1]
[ 1  1 -1  1 -1 -1  1  1 -1  1 -1]
[ 1 -1  1 -1  1 -1 -1 -1  1  1 -1]
[ 1 -1  1 -1 -1  1 -1 -1 -1  1  1]
[ 1  1 -1  1 -1 -1  1  1  1 -1 -1]
[ 1 -1  1  1 -1 -1  1  1  1 -1 -1]
[ 1 -1  1 -1  1 -1  1  1  1 -1 -1]
[-1  1 -1  1  1  1 -1 -1 -1  1  1]
[-1  1  1 -1 -1  1 -1 -1 -1  1  1]

======================================

     vertices:  11
        edges:  21
automorphisms:  1
graph6-string:  J?AEB`e^@]_

Adjacency matrix:
[0 0 0 0 0 1 1 0 0 0 0]
[0 0 0 0 0 0 1 1 1 1 0]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 1 0 1 0]
[0 0 0 0 0 0 0 0 0 1 1]
[1 0 0 0 0 0 0 0 1 1 1]
[1 1 0 0 0 0 0 0 1 0 1]
[0 1 1 1 0 0 0 0 0 0 1]
[0 1 1 0 0 1 1 0 0 0 0]
[0 1 1 1 1 1 0 0 0 0 1]
[0 0 1 0 1 1 1 1 0 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1 -1  1 -1  1  1  1 -1 -1  1]
[-1  1 -1  1  1 -1  1 -1  1  1 -1]
[-1 -1  1 -1 -1  1 -1  1  1 -1  1]
[ 1  1 -1  1 -1  1 -1  1 -1  1 -1]
[-1  1 -1 -1  1 -1  1 -1 -1  1  1]
[ 1 -1  1  1 -1  1 -1 -1  1  1 -1]
[ 1  1 -1 -1  1 -1  1  1 -1 -1  1]
[ 1 -1  1  1 -1 -1  1  1 -1 -1  1]
[-1  1  1 -1 -1  1 -1 -1  1  1 -1]
[-1  1 -1  1  1  1 -1 -1  1  1 -1]
[ 1 -1  1 -1  1 -1  1  1 -1 -1  1]

======================================

     vertices:  11
        edges:  21
automorphisms:  2
graph6-string:  J?AE@roJlF_

Adjacency matrix:
[0 0 0 0 0 1 1 0 1 0 1]
[0 0 0 0 0 0 1 0 1 0 0]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 1 1 0 0]
[0 0 0 0 0 0 0 1 0 1 0]
[1 0 0 0 0 0 0 0 0 1 0]
[1 1 0 0 0 0 0 0 0 1 1]
[0 0 1 1 1 0 0 0 0 0 1]
[1 1 1 1 0 0 0 0 0 1 1]
[0 0 1 0 1 1 1 0 1 0 1]
[1 0 1 0 0 0 1 1 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1 -1  1 -1  1  1  1 -1 -1  1]
[-1  1 -1  1  1 -1  1 -1  1  1 -1]
[-1 -1  1 -1 -1 -1 -1 -1  1  1  1]
[ 1  1 -1  1  1  1 -1  1  1 -1 -1]
[-1  1 -1  1  1  1  1  1 -1  1 -1]
[ 1 -1 -1  1  1  1 -1 -1  1  1 -1]
[ 1  1 -1 -1  1 -1  1  1 -1 -1  1]
[ 1 -1 -1  1  1 -1  1  1 -1 -1  1]
[-1  1  1  1 -1  1 -1 -1  1  1 -1]
[-1  1  1 -1  1  1 -1 -1  1  1 -1]
[ 1 -1  1 -1 -1 -1  1  1 -1 -1  1]

======================================

     vertices:  11
        edges:  21
automorphisms:  1
graph6-string:  J?AEDFWtVS_

Adjacency matrix:
[0 0 0 0 0 1 1 1 1 1 1]
[0 0 0 0 0 0 1 0 1 1 1]
[0 0 0 0 0 0 0 1 0 0 1]
[0 0 0 0 0 0 0 0 1 1 0]
[0 0 0 0 0 0 0 0 1 0 1]
[1 0 0 0 0 0 0 0 0 1 0]
[1 1 0 0 0 0 0 1 0 0 1]
[1 0 1 0 0 0 1 0 0 1 0]
[1 1 0 1 1 0 0 0 0 0 0]
[1 1 0 1 0 1 0 1 0 0 1]
[1 1 1 0 1 0 1 0 0 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1 -1 -1  1  1  1  1  1 -1 -1]
[-1  1 -1  1 -1 -1  1 -1 -1  1  1]
[-1 -1  1  1  1 -1 -1  1 -1  1  1]
[-1  1  1  1 -1 -1 -1  1  1  1 -1]
[ 1 -1  1 -1  1  1 -1 -1  1 -1  1]
[ 1 -1 -1 -1  1  1 -1 -1 -1  1  1]
[ 1  1 -1 -1 -1 -1  1  1  1 -1 -1]
[ 1 -1  1  1 -1 -1  1  1  1 -1 -1]
[ 1 -1 -1  1  1 -1  1  1  1 -1 -1]
[-1  1  1  1 -1  1 -1 -1 -1  1  1]
[-1  1  1 -1  1  1 -1 -1 -1  1  1]

======================================

     vertices:  11
        edges:  21
automorphisms:  1
graph6-string:  J?ABAbYff`_

Adjacency matrix:
[0 0 0 0 0 1 0 0 1 1 1]
[0 0 0 0 0 0 1 1 1 0 1]
[0 0 0 0 0 0 1 0 0 0 1]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 0 1 1 0]
[1 0 0 0 0 0 0 0 0 1 0]
[0 1 1 0 0 0 0 0 1 1 0]
[0 1 0 1 0 0 0 0 0 0 0]
[1 1 0 1 1 0 1 0 0 0 1]
[1 0 0 1 1 1 1 0 0 0 1]
[1 1 1 1 0 0 0 0 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1  1 -1 -1 -1  1 -1 -1  1 -1  1]
[ 1  1 -1 -1 -1  1  1  1  1 -1 -1]
[-1 -1  1  1 -1 -1  1 -1 -1  1  1]
[-1 -1  1  1  1 -1 -1  1 -1  1  1]
[-1 -1 -1  1  1 -1  1 -1  1  1 -1]
[ 1  1 -1 -1 -1  1  1  1 -1  1 -1]
[-1  1  1 -1  1  1  1  1 -1  1 -1]
[-1  1 -1  1 -1  1  1  1 -1  1 -1]
[ 1  1 -1 -1  1 -1 -1 -1  1 -1  1]
[-1 -1  1  1  1  1  1  1 -1  1 -1]
[ 1 -1  1  1 -1 -1 -1 -1  1 -1  1]

======================================

     vertices:  11
        edges:  21
automorphisms:  1
graph6-string:  J?ABEbg{HZ_

Adjacency matrix:
[0 0 0 0 0 1 0 1 1 1 0]
[0 0 0 0 0 0 1 1 1 1 0]
[0 0 0 0 0 0 1 0 1 1 1]
[0 0 0 0 0 0 0 1 0 1 0]
[0 0 0 0 0 0 0 0 1 0 1]
[1 0 0 0 0 0 0 0 0 0 1]
[0 1 1 0 0 0 0 0 0 0 0]
[1 1 0 1 0 0 0 0 0 0 1]
[1 1 1 0 1 0 0 0 0 1 1]
[1 1 1 1 0 0 0 0 1 0 1]
[0 0 1 0 1 1 0 1 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1  1 -1 -1 -1  1 -1 -1  1  1 -1]
[ 1  1 -1 -1  1 -1  1  1  1 -1 -1]
[-1 -1  1  1 -1  1  1 -1 -1  1  1]
[-1 -1  1  1 -1 -1 -1  1 -1  1  1]
[-1  1 -1 -1  1 -1 -1  1  1 -1  1]
[ 1 -1  1 -1 -1  1  1  1 -1 -1  1]
[-1  1  1 -1 -1  1  1  1 -1 -1  1]
[-1  1 -1  1  1  1  1  1 -1 -1  1]
[ 1  1 -1 -1  1 -1 -1 -1  1  1 -1]
[ 1 -1  1  1 -1 -1 -1 -1  1  1 -1]
[-1 -1  1  1  1  1  1  1 -1 -1  1]

======================================

     vertices:  11
        edges:  21
automorphisms:  1
graph6-string:  J?ABEbW{Gz_

Adjacency matrix:
[0 0 0 0 0 1 0 1 1 1 0]
[0 0 0 0 0 0 1 1 1 1 0]
[0 0 0 0 0 0 1 0 0 1 0]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 0 1 0 1]
[1 0 0 0 0 0 0 0 0 0 1]
[0 1 1 0 0 0 0 0 0 0 0]
[1 1 0 1 0 0 0 0 0 0 1]
[1 1 0 1 1 0 0 0 0 1 1]
[1 1 1 1 0 0 0 0 1 0 1]
[0 0 0 1 1 1 0 1 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1  1 -1 -1 -1  1 -1 -1  1  1 -1]
[ 1  1 -1 -1  1 -1  1  1  1 -1 -1]
[-1 -1  1  1 -1  1  1 -1 -1  1  1]
[-1 -1  1  1 -1 -1 -1  1 -1  1  1]
[-1  1 -1 -1  1  1  1 -1  1 -1  1]
[ 1 -1  1 -1  1  1  1  1 -1 -1  1]
[-1  1  1 -1  1  1  1  1 -1 -1  1]
[-1  1 -1  1 -1  1  1  1 -1 -1  1]
[ 1  1 -1 -1  1 -1 -1 -1  1  1 -1]
[ 1 -1  1  1 -1 -1 -1 -1  1  1 -1]
[-1 -1  1  1  1  1  1  1 -1 -1  1]

======================================

     vertices:  11
        edges:  21
automorphisms:  1
graph6-string:  J?ABEa[\Uw_

Adjacency matrix:
[0 0 0 0 0 1 0 1 1 0 1]
[0 0 0 0 0 0 1 1 0 1 1]
[0 0 0 0 0 0 1 0 0 1 0]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 0 1 0 1]
[1 0 0 0 0 0 0 0 1 1 1]
[0 1 1 0 0 0 0 0 0 0 0]
[1 1 0 1 0 0 0 0 0 1 0]
[1 0 0 1 1 1 0 0 0 0 0]
[0 1 1 1 0 1 0 1 0 0 1]
[1 1 0 1 1 1 0 0 0 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1  1 -1 -1 -1  1  1  1  1 -1 -1]
[ 1  1 -1 -1  1 -1  1  1 -1 -1  1]
[-1 -1  1  1 -1  1  1 -1  1  1 -1]
[-1 -1  1  1  1 -1 -1  1  1  1 -1]
[-1  1 -1  1  1 -1  1 -1  1 -1  1]
[ 1 -1  1 -1 -1  1 -1 -1 -1  1  1]
[ 1  1  1 -1  1 -1  1  1  1 -1 -1]
[ 1  1 -1  1 -1 -1  1  1  1 -1 -1]
[ 1 -1  1  1  1 -1  1  1  1 -1 -1]
[-1 -1  1  1 -1  1 -1 -1 -1  1  1]
[-1  1 -1 -1  1  1 -1 -1 -1  1  1]

======================================

     vertices:  11
        edges:  21
automorphisms:  1
graph6-string:  J?ABEbIB~`_

Adjacency matrix:
[0 0 0 0 0 1 0 1 1 0 1]
[0 0 0 0 0 0 1 1 1 0 1]
[0 0 0 0 0 0 1 0 0 0 1]
[0 0 0 0 0 0 0 1 0 0 1]
[0 0 0 0 0 0 0 0 1 1 0]
[1 0 0 0 0 0 0 0 0 1 0]
[0 1 1 0 0 0 0 0 1 1 0]
[1 1 0 1 0 0 0 0 0 1 0]
[1 1 0 0 1 0 1 0 0 1 1]
[0 0 0 0 1 1 1 1 1 0 1]
[1 1 1 1 0 0 0 0 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1  1 -1 -1 -1  1 -1 -1  1 -1  1]
[ 1  1 -1 -1 -1 -1  1  1  1 -1 -1]
[-1 -1  1  1 -1  1  1 -1 -1  1  1]
[-1 -1  1  1  1 -1 -1  1 -1  1  1]
[-1 -1 -1  1  1 -1 -1 -1  1  1  1]
[ 1 -1  1 -1 -1  1  1  1 -1  1 -1]
[-1  1  1 -1 -1  1  1  1 -1  1 -1]
[-1  1 -1  1 -1  1  1  1 -1  1 -1]
[ 1  1 -1 -1  1 -1 -1 -1  1 -1  1]
[-1 -1  1  1  1  1  1  1 -1  1 -1]
[ 1 -1  1  1  1 -1 -1 -1  1 -1  1]

======================================

     vertices:  11
        edges:  21
automorphisms:  1
graph6-string:  J?ABCrS\Uw_

Adjacency matrix:
[0 0 0 0 0 1 0 1 1 0 1]
[0 0 0 0 0 0 1 0 1 1 1]
[0 0 0 0 0 0 1 0 0 1 0]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 1 0 0 1]
[1 0 0 0 0 0 0 0 1 1 1]
[0 1 1 0 0 0 0 0 0 0 0]
[1 0 0 1 1 0 0 0 0 1 0]
[1 1 0 1 0 1 0 0 0 0 0]
[0 1 1 1 0 1 0 1 0 0 1]
[1 1 0 1 1 1 0 0 0 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1  1 -1  1  1  1  1  1 -1 -1]
[-1  1 -1  1  1 -1  1 -1  1 -1  1]
[ 1 -1  1 -1 -1  1  1  1 -1  1 -1]
[-1  1 -1  1 -1 -1 -1  1  1  1 -1]
[ 1  1 -1 -1  1 -1  1  1 -1 -1  1]
[ 1 -1  1 -1 -1  1 -1 -1 -1  1  1]
[ 1  1  1 -1  1 -1  1  1  1 -1 -1]
[ 1 -1  1  1  1 -1  1  1  1 -1 -1]
[ 1  1 -1  1 -1 -1  1  1  1 -1 -1]
[-1 -1  1  1 -1  1 -1 -1 -1  1  1]
[-1  1 -1 -1  1  1 -1 -1 -1  1  1]

======================================

     vertices:  11
        edges:  21
automorphisms:  1
graph6-string:  J?ABCpTuN`_

Adjacency matrix:
[0 0 0 0 0 1 0 1 0 1 1]
[0 0 0 0 0 0 1 0 1 1 1]
[0 0 0 0 0 0 1 0 0 0 1]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 1 0 1 0]
[1 0 0 0 0 0 0 0 1 0 0]
[0 1 1 0 0 0 0 0 0 0 0]
[1 0 0 1 1 0 0 0 1 0 0]
[0 1 0 1 0 1 0 1 0 1 1]
[1 1 0 1 1 0 0 0 1 0 1]
[1 1 1 1 0 0 0 0 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1  1 -1  1  1 -1 -1 -1  1  1]
[-1  1 -1 -1  1  1  1 -1  1  1 -1]
[ 1 -1  1  1 -1 -1  1  1 -1 -1  1]
[-1 -1  1  1 -1 -1 -1  1  1 -1  1]
[ 1  1 -1 -1  1 -1  1  1 -1  1 -1]
[ 1  1 -1 -1 -1  1  1  1  1 -1 -1]
[-1  1  1 -1  1  1  1  1  1 -1 -1]
[-1 -1  1  1  1  1  1  1  1 -1 -1]
[-1  1 -1  1 -1  1  1  1  1 -1 -1]
[ 1  1 -1 -1  1 -1 -1 -1 -1  1  1]
[ 1 -1  1  1 -1 -1 -1 -1 -1  1  1]

======================================

     vertices:  11
        edges:  21
automorphisms:  1
graph6-string:  J?ABApwcyl_

Adjacency matrix:
[0 0 0 0 0 1 0 0 0 1 0]
[0 0 0 0 0 0 1 1 1 0 1]
[0 0 0 0 0 0 1 0 1 0 0]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 1 1 0 0]
[1 0 0 0 0 0 0 0 0 0 1]
[0 1 1 0 0 0 0 0 0 1 1]
[0 1 0 1 1 0 0 0 0 1 0]
[0 1 1 1 1 0 0 0 0 1 1]
[1 0 0 1 0 0 1 1 1 0 1]
[0 1 0 1 0 1 1 0 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1  1 -1  1  1  1  1 -1  1 -1]
[-1  1 -1 -1  1  1  1  1 -1 -1  1]
[ 1 -1  1 -1  1 -1  1 -1  1  1 -1]
[-1 -1 -1  1 -1 -1 -1 -1  1  1  1]
[ 1  1  1 -1  1  1 -1  1  1 -1 -1]
[ 1  1 -1 -1  1  1 -1 -1  1 -1  1]
[ 1  1  1 -1 -1 -1  1  1 -1  1 -1]
[ 1  1 -1 -1  1 -1  1  1 -1  1 -1]
[-1 -1  1  1  1  1 -1 -1  1 -1  1]
[ 1 -1  1  1 -1 -1  1  1 -1  1 -1]
[-1  1 -1  1 -1  1 -1 -1  1 -1  1]

======================================

     vertices:  11
        edges:  21
automorphisms:  1
graph6-string:  J?ABCdY]am_

Adjacency matrix:
[0 0 0 0 0 1 0 1 0 0 0]
[0 0 0 0 0 0 1 0 1 1 1]
[0 0 0 0 0 0 1 0 0 1 0]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 0 1 1 0]
[1 0 0 0 0 0 0 0 0 0 1]
[0 1 1 0 0 0 0 1 1 1 1]
[1 0 0 1 0 0 1 0 0 0 1]
[0 1 0 1 1 0 1 0 0 0 0]
[0 1 1 1 1 0 1 0 0 0 1]
[0 1 0 1 0 1 1 1 0 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1  1 -1  1  1  1  1  1 -1 -1]
[-1  1 -1 -1 -1  1  1 -1  1 -1  1]
[ 1 -1  1 -1  1 -1  1  1 -1  1 -1]
[-1 -1 -1  1  1 -1 -1  1 -1  1  1]
[ 1 -1  1  1  1  1 -1 -1  1  1 -1]
[ 1  1 -1 -1  1  1 -1 -1 -1  1  1]
[ 1  1  1 -1 -1 -1  1  1  1 -1 -1]
[ 1 -1  1  1 -1 -1  1  1  1 -1 -1]
[ 1  1 -1 -1  1 -1  1  1  1 -1 -1]
[-1 -1  1  1  1  1 -1 -1 -1  1  1]
[-1  1 -1  1 -1  1 -1 -1 -1  1  1]

======================================

     vertices:  11
        edges:  21
automorphisms:  2
graph6-string:  J?AB?vSufa_

Adjacency matrix:
[0 0 0 0 0 1 0 0 1 1 1]
[0 0 0 0 0 0 1 0 1 1 1]
[0 0 0 0 0 0 1 0 0 0 1]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 1 0 1 0]
[1 0 0 0 0 0 0 0 1 0 0]
[0 1 1 0 0 0 0 1 0 1 0]
[0 0 0 1 1 0 1 0 0 0 1]
[1 1 0 1 0 1 0 0 0 0 0]
[1 1 0 1 1 0 1 0 0 0 1]
[1 1 1 1 0 0 0 1 0 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1  1 -1  1  1 -1 -1 -1  1  1]
[-1  1 -1  1 -1 -1  1 -1  1  1 -1]
[ 1 -1  1 -1 -1  1  1  1 -1 -1  1]
[-1  1 -1  1 -1 -1 -1  1  1 -1  1]
[ 1 -1 -1 -1  1  1  1  1 -1  1 -1]
[ 1 -1  1 -1  1  1  1  1  1 -1 -1]
[-1  1  1 -1  1  1  1  1  1 -1 -1]
[-1 -1  1  1  1  1  1  1  1 -1 -1]
[-1  1 -1  1 -1  1  1  1  1 -1 -1]
[ 1  1 -1 -1  1 -1 -1 -1 -1  1  1]
[ 1 -1  1  1 -1 -1 -1 -1 -1  1  1]

======================================

     vertices:  11
        edges:  21
automorphisms:  1
graph6-string:  J?AFE`g}@N_

Adjacency matrix:
[0 0 0 0 0 1 1 1 0 1 0]
[0 0 0 0 0 0 1 1 1 1 0]
[0 0 0 0 0 0 1 0 1 1 1]
[0 0 0 0 0 0 0 1 0 1 0]
[0 0 0 0 0 0 0 0 1 1 0]
[1 0 0 0 0 0 0 0 0 0 1]
[1 1 1 0 0 0 0 0 0 0 1]
[1 1 0 1 0 0 0 0 0 0 1]
[0 1 1 0 1 0 0 0 0 0 1]
[1 1 1 1 1 0 0 0 0 0 1]
[0 0 1 0 0 1 1 1 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1  1 -1 -1  1  1  1 -1 -1  1 -1]
[ 1  1 -1 -1  1 -1  1  1  1 -1 -1]
[-1 -1  1  1 -1 -1  1 -1 -1  1  1]
[-1 -1  1  1 -1 -1 -1  1 -1  1  1]
[ 1  1 -1 -1  1  1 -1 -1  1  1 -1]
[ 1 -1 -1 -1  1  1 -1  1  1 -1  1]
[ 1  1  1 -1 -1 -1  1 -1 -1  1 -1]
[-1  1 -1  1 -1  1 -1  1  1 -1  1]
[-1  1 -1 -1  1  1 -1  1  1 -1  1]
[ 1 -1  1  1  1 -1  1 -1 -1  1 -1]
[-1 -1  1  1 -1  1 -1  1  1 -1  1]

======================================

     vertices:  11
        edges:  21
automorphisms:  2
graph6-string:  J?B@fAozAZ_

Adjacency matrix:
[0 0 0 0 0 1 0 1 1 1 0]
[0 0 0 0 0 1 0 1 0 1 1]
[0 0 0 0 0 0 1 1 1 1 0]
[0 0 0 0 0 0 1 0 1 0 0]
[0 0 0 0 0 0 0 0 0 1 1]
[1 1 0 0 0 0 0 0 0 1 1]
[0 0 1 1 0 0 0 0 0 0 0]
[1 1 1 0 0 0 0 0 0 0 1]
[1 0 1 1 0 0 0 0 0 0 1]
[1 1 1 0 1 1 0 0 0 0 1]
[0 1 0 0 1 1 0 1 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1  1 -1 -1  1 -1 -1  1  1 -1]
[-1  1 -1  1 -1  1  1  1 -1 -1  1]
[ 1 -1  1 -1  1 -1  1  1 -1  1 -1]
[-1  1 -1  1 -1  1  1 -1  1 -1  1]
[-1 -1  1 -1  1 -1 -1 -1  1  1  1]
[ 1  1 -1  1 -1  1  1 -1 -1  1 -1]
[-1  1  1  1 -1  1  1 -1 -1  1 -1]
[-1  1  1 -1 -1 -1 -1  1  1 -1  1]
[ 1 -1 -1  1  1 -1 -1  1  1 -1  1]
[ 1 -1  1 -1  1  1  1 -1 -1  1 -1]
[-1  1 -1  1  1 -1 -1  1  1 -1  1]

======================================

     vertices:  11
        edges:  21
automorphisms:  2
graph6-string:  J?B@fAon?z_

Adjacency matrix:
[0 0 0 0 0 1 0 1 1 1 0]
[0 0 0 0 0 1 0 1 0 0 0]
[0 0 0 0 0 0 1 1 1 1 0]
[0 0 0 0 0 0 1 0 1 1 1]
[0 0 0 0 0 0 0 0 0 1 1]
[1 1 0 0 0 0 0 0 0 1 1]
[0 0 1 1 0 0 0 0 0 0 0]
[1 1 1 0 0 0 0 0 0 0 1]
[1 0 1 1 0 0 0 0 0 0 1]
[1 0 1 1 1 1 0 0 0 0 1]
[0 0 0 1 1 1 0 1 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1  1 -1 -1  1 -1 -1  1  1 -1]
[-1  1 -1  1 -1  1  1  1 -1 -1  1]
[ 1 -1  1 -1  1 -1  1  1 -1  1 -1]
[-1  1 -1  1 -1  1  1 -1  1 -1  1]
[-1 -1  1 -1  1 -1 -1  1 -1  1  1]
[ 1  1 -1  1 -1  1  1 -1 -1  1 -1]
[-1  1  1  1 -1  1  1 -1 -1  1 -1]
[-1  1  1 -1  1 -1 -1  1  1 -1  1]
[ 1 -1 -1  1 -1 -1 -1  1  1 -1  1]
[ 1 -1  1 -1  1  1  1 -1 -1  1 -1]
[-1  1 -1  1  1 -1 -1  1  1 -1  1]

======================================

     vertices:  11
        edges:  21
automorphisms:  1
graph6-string:  J?B@cZ_[^W_

Adjacency matrix:
[0 0 0 0 0 1 0 1 1 0 1]
[0 0 0 0 0 1 0 0 1 1 1]
[0 0 0 0 0 0 1 0 1 1 1]
[0 0 0 0 0 0 1 0 0 1 0]
[0 0 0 0 0 0 0 1 0 0 1]
[1 1 0 0 0 0 0 1 0 0 1]
[0 0 1 1 0 0 0 0 0 0 0]
[1 0 0 0 1 1 0 0 0 1 0]
[1 1 1 0 0 0 0 0 0 1 0]
[0 1 1 1 0 0 0 1 1 0 1]
[1 1 1 0 1 1 0 0 0 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1  1 -1 -1  1  1  1  1 -1 -1]
[-1  1 -1  1 -1  1 -1 -1 -1  1  1]
[ 1 -1  1 -1  1 -1  1 -1  1 -1  1]
[-1  1 -1  1 -1  1  1  1 -1  1 -1]
[-1 -1  1 -1  1 -1 -1  1 -1  1  1]
[ 1  1 -1  1 -1  1  1 -1 -1 -1  1]
[ 1 -1  1  1 -1  1  1 -1 -1 -1  1]
[ 1 -1 -1  1  1 -1 -1  1  1  1 -1]
[ 1 -1  1 -1 -1 -1 -1  1  1  1 -1]
[-1  1 -1  1  1 -1 -1  1  1  1 -1]
[-1  1  1 -1  1  1  1 -1 -1 -1  1]

======================================

     vertices:  11
        edges:  21
automorphisms:  1
graph6-string:  J?B@`Yos\w_

Adjacency matrix:
[0 0 0 0 0 1 0 0 1 1 1]
[0 0 0 0 0 1 0 0 0 1 0]
[0 0 0 0 0 0 1 1 1 0 1]
[0 0 0 0 0 0 1 0 1 1 1]
[0 0 0 0 0 0 0 1 0 0 1]
[1 1 0 0 0 0 0 1 0 0 1]
[0 0 1 1 0 0 0 0 0 0 0]
[0 0 1 0 1 1 0 0 0 1 0]
[1 0 1 1 0 0 0 0 0 1 0]
[1 1 0 1 0 0 0 1 1 0 1]
[1 0 1 1 1 1 0 0 0 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1  1 -1 -1  1 -1 -1  1 -1  1]
[-1  1 -1  1 -1  1  1  1 -1  1 -1]
[ 1 -1  1 -1 -1  1  1  1  1 -1 -1]
[-1  1 -1  1  1 -1  1 -1 -1  1  1]
[-1 -1 -1  1  1 -1 -1  1 -1  1  1]
[ 1  1  1 -1 -1  1  1 -1 -1 -1  1]
[-1  1  1  1 -1  1  1 -1 -1 -1  1]
[-1  1  1 -1  1 -1 -1  1  1  1 -1]
[ 1 -1  1 -1 -1 -1 -1  1  1  1 -1]
[-1  1 -1  1  1 -1 -1  1  1  1 -1]
[ 1 -1 -1  1  1  1  1 -1 -1 -1  1]

======================================

     vertices:  11
        edges:  21
automorphisms:  2
graph6-string:  J?`DAboQ{N_

Adjacency matrix:
[0 0 0 0 1 0 1 0 1 0 1]
[0 0 0 0 0 1 0 1 1 1 0]
[0 0 0 0 0 0 1 0 1 0 0]
[0 0 0 0 0 0 0 1 1 0 0]
[1 0 0 0 0 0 0 0 0 1 0]
[0 1 0 0 0 0 0 0 0 0 1]
[1 0 1 0 0 0 0 0 0 1 1]
[0 1 0 1 0 0 0 0 0 1 1]
[1 1 1 1 0 0 0 0 0 1 1]
[0 1 0 0 1 0 1 1 1 0 1]
[1 0 0 0 0 1 1 1 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1 -1  1  1  1 -1 -1  1 -1  1]
[-1  1  1 -1  1  1 -1 -1  1  1 -1]
[-1  1  1 -1 -1 -1  1 -1  1  1 -1]
[ 1 -1 -1  1 -1 -1 -1  1  1 -1  1]
[ 1  1 -1 -1  1 -1 -1 -1  1  1 -1]
[ 1  1 -1 -1 -1  1 -1 -1  1 -1  1]
[-1 -1  1 -1 -1 -1  1  1 -1  1  1]
[-1 -1 -1  1 -1 -1  1  1 -1  1  1]
[ 1  1  1  1  1  1 -1 -1  1 -1 -1]
[-1  1  1 -1  1 -1  1  1 -1  1 -1]
[ 1 -1 -1  1 -1  1  1  1 -1 -1  1]

======================================

     vertices:  11
        edges:  21
automorphisms:  4
graph6-string:  J?`DAboB}F_

Adjacency matrix:
[0 0 0 0 1 0 1 0 1 0 1]
[0 0 0 0 0 1 0 1 1 0 1]
[0 0 0 0 0 0 1 0 1 0 0]
[0 0 0 0 0 0 0 1 1 0 0]
[1 0 0 0 0 0 0 0 0 1 0]
[0 1 0 0 0 0 0 0 0 1 0]
[1 0 1 0 0 0 0 0 0 1 1]
[0 1 0 1 0 0 0 0 0 1 1]
[1 1 1 1 0 0 0 0 0 1 1]
[0 0 0 0 1 1 1 1 1 0 1]
[1 1 0 0 0 0 1 1 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1  1 -1 -1  1 -1 -1 -1  1 -1  1]
[ 1  1 -1 -1 -1  1 -1 -1  1 -1  1]
[-1 -1  1  1 -1  1  1 -1  1  1 -1]
[-1 -1  1  1  1 -1 -1  1  1  1 -1]
[ 1 -1 -1  1  1  1 -1 -1  1  1 -1]
[-1  1  1 -1  1  1 -1 -1  1  1 -1]
[-1 -1  1 -1 -1 -1  1  1 -1  1  1]
[-1 -1 -1  1 -1 -1  1  1 -1  1  1]
[ 1  1  1  1  1  1 -1 -1  1 -1 -1]
[-1 -1  1  1  1  1  1  1 -1  1 -1]
[ 1  1 -1 -1 -1 -1  1  1 -1 -1  1]

======================================

     vertices:  11
        edges:  21
automorphisms:  2
graph6-string:  J?`D@_yw[N_

Adjacency matrix:
[0 0 0 0 1 0 1 0 0 1 1]
[0 0 0 0 0 1 0 0 0 1 0]
[0 0 0 0 0 0 1 1 1 1 0]
[0 0 0 0 0 0 0 1 1 0 0]
[1 0 0 0 0 0 0 0 1 0 0]
[0 1 0 0 0 0 0 0 0 0 1]
[1 0 1 0 0 0 0 0 1 0 1]
[0 0 1 1 0 0 0 0 0 1 1]
[0 0 1 1 1 0 1 0 0 1 1]
[1 1 1 0 0 0 0 1 1 0 1]
[1 0 0 0 0 1 1 1 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1 -1 -1  1 -1 -1  1 -1  1  1]
[-1  1  1 -1  1  1 -1 -1  1  1 -1]
[-1  1  1 -1 -1 -1  1 -1  1  1 -1]
[-1 -1 -1  1  1  1 -1  1  1 -1  1]
[ 1  1 -1  1  1 -1 -1 -1  1  1 -1]
[-1  1 -1  1 -1  1  1 -1  1 -1  1]
[-1 -1  1 -1 -1  1  1 -1  1 -1  1]
[ 1 -1 -1  1 -1 -1 -1  1 -1  1  1]
[-1  1  1  1  1  1  1 -1  1 -1 -1]
[ 1  1  1 -1  1 -1 -1  1 -1  1 -1]
[ 1 -1 -1  1 -1  1  1  1 -1 -1  1]

======================================

     vertices:  11
        edges:  23
automorphisms:  2
graph6-string:  J?AEFBs^`^?

Adjacency matrix:
[0 0 0 0 0 1 1 1 1 0 0]
[0 0 0 0 0 0 1 1 1 1 0]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 0 1 1 0]
[0 0 0 0 0 0 0 0 0 1 1]
[1 0 0 0 0 0 0 0 1 1 1]
[1 1 0 0 0 0 0 0 0 1 1]
[1 1 1 0 0 0 0 0 0 0 1]
[1 1 1 1 0 1 0 0 0 0 1]
[0 1 1 1 1 1 1 0 0 0 0]
[0 0 1 0 1 1 1 1 1 0 0]

(2x)Inverse of the Adjacency matrix:
[-1  1 -1 -1 -1  1  1 -1  1 -1  1]
[ 1 -1  1  1 -1 -1  1  1 -1  1 -1]
[-1  1 -1  1  1 -1 -1  1  1 -1  1]
[-1  1  1 -1 -1  1 -1 -1  1  1 -1]
[-1 -1  1 -1 -1  1  1 -1 -1  1  1]
[ 1 -1 -1  1  1 -1  1 -1  1 -1  1]
[ 1  1 -1 -1  1  1 -1  1 -1  1 -1]
[-1  1  1 -1 -1 -1  1 -1  1 -1  1]
[ 1 -1  1  1 -1  1 -1  1 -1  1 -1]
[-1  1 -1  1  1 -1  1 -1  1 -1  1]
[ 1 -1  1 -1  1  1 -1  1 -1  1 -1]

======================================

     vertices:  11
        edges:  23
automorphisms:  1
graph6-string:  J?`DFBw]_^_

Adjacency matrix:
[0 0 0 0 1 0 1 1 1 0 0]
[0 0 0 0 0 1 0 1 1 1 0]
[0 0 0 0 0 0 1 1 1 1 0]
[0 0 0 0 0 0 0 0 1 1 0]
[1 0 0 0 0 0 0 0 1 1 1]
[0 1 0 0 0 0 0 0 0 0 1]
[1 0 1 0 0 0 0 0 0 1 1]
[1 1 1 0 0 0 0 0 0 0 1]
[1 1 1 1 1 0 0 0 0 0 1]
[0 1 1 1 1 0 1 0 0 0 1]
[0 0 0 0 1 1 1 1 1 1 0]

(2x)Inverse of the Adjacency matrix:
[-1 -1  1 -1  1 -1 -1  1  1 -1  1]
[-1 -1  1  1 -1  1 -1  1  1 -1  1]
[ 1  1 -1  1 -1 -1  1  1 -1  1 -1]
[-1  1  1 -1  1 -1 -1 -1  1  1 -1]
[ 1 -1 -1  1 -1  1  1 -1  1 -1  1]
[-1  1 -1 -1  1 -1 -1  1 -1  1  1]
[-1 -1  1 -1  1 -1 -1  1 -1  1  1]
[ 1  1  1 -1 -1  1  1 -1  1 -1 -1]
[ 1  1 -1  1  1 -1 -1  1 -1  1 -1]
[-1 -1  1  1 -1  1  1 -1  1 -1  1]
[ 1  1 -1 -1  1  1  1 -1 -1  1 -1]

======================================

     vertices:  11
        edges:  25
automorphisms:  1
graph6-string:  J?AAF@t~T^_

Adjacency matrix:
[0 0 0 0 0 1 0 1 0 1 1]
[0 0 0 0 0 0 1 1 1 1 0]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 0 1 1 0]
[0 0 0 0 0 0 0 0 0 1 1]
[1 0 0 0 0 0 0 0 1 1 1]
[0 1 0 0 0 0 0 0 0 0 1]
[1 1 1 0 0 0 0 0 1 1 1]
[0 1 1 1 0 1 0 1 0 0 1]
[1 1 1 1 1 1 0 1 0 0 1]
[1 0 1 0 1 1 1 1 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1  1 -1 -1 -1  1 -1  1 -1  1 -1]
[ 1  1 -1  1 -1 -1  1  1 -1  1 -1]
[-1 -1  1 -1  1 -1 -1  1  1 -1  1]
[-1  1 -1  1  1  1 -1 -1  1  1 -1]
[-1 -1  1  1  1 -1  1 -1 -1  1  1]
[ 1 -1 -1  1 -1  1  1 -1  1 -1  1]
[-1  1 -1 -1  1  1  1 -1  1 -1  1]
[ 1  1  1 -1 -1 -1 -1  1 -1  1 -1]
[-1 -1  1  1 -1  1  1 -1  1 -1  1]
[ 1  1 -1  1  1 -1 -1  1 -1  1 -1]
[-1 -1  1 -1  1  1  1 -1  1 -1  1]

======================================

     vertices:  11
        edges:  25
automorphisms:  2
graph6-string:  J?AAFAvZv}?

Adjacency matrix:
[0 0 0 0 0 1 0 1 1 0 1]
[0 0 0 0 0 0 1 1 0 1 1]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 0 1 0 1]
[0 0 0 0 0 0 0 0 0 1 1]
[1 0 0 0 0 0 0 0 1 1 1]
[0 1 0 0 0 0 0 0 1 1 1]
[1 1 1 0 0 0 0 0 1 1 1]
[1 0 1 1 0 1 1 1 0 0 0]
[0 1 1 0 1 1 1 1 0 0 0]
[1 1 1 1 1 1 1 1 0 0 0]

(2x)Inverse of the Adjacency matrix:
[ 1  1 -1 -1 -1  1 -1  1 -1 -1  1]
[ 1  1 -1 -1 -1 -1  1  1 -1 -1  1]
[-1 -1  1  1  1 -1 -1  1  1  1 -1]
[-1 -1  1  1  1 -1  1 -1  1 -1  1]
[-1 -1  1  1  1  1 -1 -1 -1  1  1]
[ 1 -1 -1 -1  1  1  1 -1  1  1 -1]
[-1  1 -1  1 -1  1  1 -1  1  1 -1]
[ 1  1  1 -1 -1 -1 -1  1 -1 -1  1]
[-1 -1  1  1 -1  1  1 -1  1  1 -1]
[-1 -1  1 -1  1  1  1 -1  1  1 -1]
[ 1  1 -1  1  1 -1 -1  1 -1 -1  1]

======================================

     vertices:  11
        edges:  25
automorphisms:  1
graph6-string:  J?AEDFq}f^?

Adjacency matrix:
[0 0 0 0 0 1 1 1 1 1 1]
[0 0 0 0 0 0 1 0 1 1 1]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 0 1 1 0]
[0 0 0 0 0 0 0 0 0 1 1]
[1 0 0 0 0 0 0 0 0 0 1]
[1 1 0 0 0 0 0 1 1 1 1]
[1 0 1 0 0 0 1 0 0 0 1]
[1 1 1 1 0 0 1 0 0 0 1]
[1 1 1 1 1 0 1 0 0 0 0]
[1 1 1 0 1 1 1 1 1 0 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1 -1  1 -1  1  1  1 -1  1 -1]
[-1  1 -1 -1  1 -1  1 -1  1 -1  1]
[-1 -1  1  1  1 -1 -1  1  1 -1  1]
[ 1 -1  1  1 -1  1 -1 -1  1  1 -1]
[-1  1  1 -1  1  1 -1 -1 -1  1  1]
[ 1 -1 -1  1  1  1 -1 -1  1 -1  1]
[ 1  1 -1 -1 -1 -1  1  1 -1  1 -1]
[ 1 -1  1 -1 -1 -1  1  1 -1  1 -1]
[-1  1  1  1 -1  1 -1 -1  1 -1  1]
[ 1 -1 -1  1  1 -1  1  1 -1  1 -1]
[-1  1  1 -1  1  1 -1 -1  1 -1  1]

======================================

     vertices:  11
        edges:  25
automorphisms:  1
graph6-string:  J?AEFJojv}?

Adjacency matrix:
[0 0 0 0 0 1 1 1 1 1 1]
[0 0 0 0 0 0 1 1 1 0 1]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 0 1 0 1]
[0 0 0 0 0 0 0 0 0 1 1]
[1 0 0 0 0 0 0 1 0 1 1]
[1 1 0 0 0 0 0 0 0 1 1]
[1 1 1 0 0 1 0 0 0 1 1]
[1 1 1 1 0 0 0 0 0 0 0]
[1 0 1 0 1 1 1 1 0 0 0]
[1 1 1 1 1 1 1 1 0 0 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1 -1  1 -1  1  1 -1  1  1 -1]
[-1  1  1 -1 -1 -1  1  1 -1 -1  1]
[-1  1  1 -1  1 -1 -1  1  1  1 -1]
[ 1 -1 -1  1  1  1 -1 -1  1 -1  1]
[-1 -1  1  1  1 -1  1 -1 -1  1  1]
[ 1 -1 -1  1 -1  1 -1  1 -1 -1  1]
[ 1  1 -1 -1  1 -1  1 -1  1  1 -1]
[-1  1  1 -1 -1  1 -1  1 -1 -1  1]
[ 1 -1  1  1 -1 -1  1 -1  1  1 -1]
[ 1 -1  1 -1  1 -1  1 -1  1  1 -1]
[-1  1 -1  1  1  1 -1  1 -1 -1  1]

======================================

     vertices:  11
        edges:  25
automorphisms:  1
graph6-string:  J?AEFJoJz~?

Adjacency matrix:
[0 0 0 0 0 1 1 1 1 0 0]
[0 0 0 0 0 0 1 1 1 0 1]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 0 1 0 1]
[0 0 0 0 0 0 0 0 0 1 1]
[1 0 0 0 0 0 0 1 0 1 1]
[1 1 0 0 0 0 0 0 0 1 1]
[1 1 1 0 0 1 0 0 0 1 1]
[1 1 1 1 0 0 0 0 0 1 1]
[0 0 1 0 1 1 1 1 1 0 0]
[0 1 1 1 1 1 1 1 1 0 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1 -1  1 -1  1  1 -1  1  1 -1]
[-1  1  1 -1 -1 -1  1  1 -1 -1  1]
[-1  1  1 -1 -1 -1 -1  1  1  1 -1]
[ 1 -1 -1  1  1  1 -1 -1  1 -1  1]
[-1 -1 -1  1  1  1  1 -1 -1  1  1]
[ 1 -1 -1  1  1  1 -1  1 -1 -1  1]
[ 1  1 -1 -1  1 -1  1 -1  1  1 -1]
[-1  1  1 -1 -1  1 -1  1 -1 -1  1]
[ 1 -1  1  1 -1 -1  1 -1  1  1 -1]
[ 1 -1  1 -1  1 -1  1 -1  1  1 -1]
[-1  1 -1  1  1  1 -1  1 -1 -1  1]

======================================

     vertices:  11
        edges:  25
automorphisms:  1
graph6-string:  J?ABCdVvVz?

Adjacency matrix:
[0 0 0 0 0 1 0 1 0 1 1]
[0 0 0 0 0 0 1 0 1 1 1]
[0 0 0 0 0 0 1 0 0 0 1]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 0 0 1 1]
[1 0 0 0 0 0 0 0 1 1 1]
[0 1 1 0 0 0 0 1 1 0 0]
[1 0 0 1 0 0 1 0 1 1 1]
[0 1 0 1 0 1 1 1 0 0 1]
[1 1 0 1 1 1 0 1 0 0 0]
[1 1 1 1 1 1 0 1 1 0 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1  1 -1 -1  1  1  1 -1  1 -1]
[-1  1 -1 -1  1  1  1 -1  1  1 -1]
[ 1 -1  1 -1  1 -1  1  1 -1 -1  1]
[-1 -1 -1  1  1 -1 -1  1  1 -1  1]
[-1  1  1  1  1 -1 -1 -1 -1  1  1]
[ 1  1 -1 -1 -1  1 -1 -1  1 -1  1]
[ 1  1  1 -1 -1 -1  1  1 -1  1 -1]
[ 1 -1  1  1 -1 -1  1  1 -1  1 -1]
[-1  1 -1  1 -1  1 -1 -1  1 -1  1]
[ 1  1 -1 -1  1 -1  1  1 -1  1 -1]
[-1 -1  1  1  1  1 -1 -1  1 -1  1]

======================================

     vertices:  11
        edges:  25
automorphisms:  1
graph6-string:  J?ABCdVVr~?

Adjacency matrix:
[0 0 0 0 0 1 0 1 0 0 0]
[0 0 0 0 0 0 1 0 1 1 1]
[0 0 0 0 0 0 1 0 0 0 1]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 0 0 1 1]
[1 0 0 0 0 0 0 0 1 1 1]
[0 1 1 0 0 0 0 1 1 1 1]
[1 0 0 1 0 0 1 0 1 1 1]
[0 1 0 1 0 1 1 1 0 0 1]
[0 1 0 1 1 1 1 1 0 0 0]
[0 1 1 1 1 1 1 1 1 0 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1  1 -1 -1  1  1  1 -1  1 -1]
[-1  1 -1 -1 -1  1  1 -1  1  1 -1]
[ 1 -1  1 -1  1 -1  1  1 -1 -1  1]
[-1 -1 -1  1  1 -1 -1  1  1 -1  1]
[-1 -1  1  1  1  1 -1 -1 -1  1  1]
[ 1  1 -1 -1  1  1 -1 -1  1 -1  1]
[ 1  1  1 -1 -1 -1  1  1 -1  1 -1]
[ 1 -1  1  1 -1 -1  1  1 -1  1 -1]
[-1  1 -1  1 -1  1 -1 -1  1 -1  1]
[ 1  1 -1 -1  1 -1  1  1 -1  1 -1]
[-1 -1  1  1  1  1 -1 -1  1 -1  1]

======================================

     vertices:  11
        edges:  25
automorphisms:  1
graph6-string:  J?BFDrs}Cl_

Adjacency matrix:
[0 0 0 0 0 1 1 1 1 1 1]
[0 0 0 0 0 1 1 0 1 1 0]
[0 0 0 0 0 0 1 1 1 1 0]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 1 0 1 0]
[1 1 0 0 0 0 0 0 1 0 1]
[1 1 1 0 0 0 0 0 0 0 1]
[1 0 1 1 1 0 0 0 0 0 0]
[1 1 1 1 0 1 0 0 0 0 1]
[1 1 1 1 1 0 0 0 0 0 1]
[1 0 0 1 0 1 1 0 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1 -1 -1  1  1  1  1 -1 -1  1]
[-1  1  1 -1  1  1 -1 -1  1  1 -1]
[-1  1  1  1 -1 -1  1  1  1 -1 -1]
[-1 -1  1  1 -1 -1 -1 -1  1  1  1]
[ 1  1 -1 -1  1  1 -1  1 -1  1 -1]
[ 1  1 -1 -1  1  1 -1  1  1 -1 -1]
[ 1 -1  1 -1 -1 -1  1 -1 -1  1  1]
[ 1 -1  1 -1  1  1 -1  1  1 -1 -1]
[-1  1  1  1 -1  1 -1  1  1 -1 -1]
[-1  1 -1  1  1 -1  1 -1 -1  1  1]
[ 1 -1 -1  1 -1 -1  1 -1 -1  1  1]

======================================

     vertices:  11
        edges:  25
automorphisms:  1
graph6-string:  J?B@ljbzAZ_

Adjacency matrix:
[0 0 0 0 0 1 0 1 1 1 0]
[0 0 0 0 0 1 0 0 1 1 1]
[0 0 0 0 0 0 1 1 1 1 0]
[0 0 0 0 0 0 1 1 0 0 0]
[0 0 0 0 0 0 0 0 0 1 1]
[1 1 0 0 0 0 1 1 0 1 1]
[0 0 1 1 0 1 0 0 1 0 0]
[1 0 1 1 0 1 0 0 1 0 1]
[1 1 1 0 0 0 1 1 0 0 1]
[1 1 1 0 1 1 0 0 0 0 1]
[0 1 0 0 1 1 0 1 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1  1 -1 -1  1 -1  1 -1  1 -1]
[-1  1 -1 -1 -1  1  1 -1  1 -1  1]
[ 1 -1  1 -1  1 -1  1 -1  1  1 -1]
[-1 -1 -1  1  1  1  1  1 -1 -1  1]
[-1 -1  1  1  1 -1 -1  1 -1  1  1]
[ 1  1 -1  1 -1  1  1 -1 -1  1 -1]
[-1  1  1  1 -1  1  1 -1 -1  1 -1]
[ 1 -1 -1  1  1 -1 -1  1  1 -1  1]
[-1  1  1 -1 -1 -1 -1  1  1 -1  1]
[ 1 -1  1 -1  1  1  1 -1 -1  1 -1]
[-1  1 -1  1  1 -1 -1  1  1 -1  1]

======================================

     vertices:  11
        edges:  25
automorphisms:  1
graph6-string:  J?B@ljbn?z_

Adjacency matrix:
[0 0 0 0 0 1 0 1 1 1 0]
[0 0 0 0 0 1 0 0 1 0 0]
[0 0 0 0 0 0 1 1 1 1 0]
[0 0 0 0 0 0 1 1 0 1 1]
[0 0 0 0 0 0 0 0 0 1 1]
[1 1 0 0 0 0 1 1 0 1 1]
[0 0 1 1 0 1 0 0 1 0 0]
[1 0 1 1 0 1 0 0 1 0 1]
[1 1 1 0 0 0 1 1 0 0 1]
[1 0 1 1 1 1 0 0 0 0 1]
[0 0 0 1 1 1 0 1 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1  1 -1 -1  1 -1  1 -1  1 -1]
[-1  1 -1 -1  1  1  1 -1  1 -1  1]
[ 1 -1  1 -1  1 -1  1 -1  1  1 -1]
[-1 -1 -1  1 -1  1  1  1 -1 -1  1]
[-1  1  1 -1  1 -1 -1 -1  1  1  1]
[ 1  1 -1  1 -1  1  1 -1 -1  1 -1]
[-1  1  1  1 -1  1  1 -1 -1  1 -1]
[ 1 -1 -1  1 -1 -1 -1  1  1 -1  1]
[-1  1  1 -1  1 -1 -1  1  1 -1  1]
[ 1 -1  1 -1  1  1  1 -1 -1  1 -1]
[-1  1 -1  1  1 -1 -1  1  1 -1  1]

======================================

     vertices:  11
        edges:  25
automorphisms:  1
graph6-string:  J?`DEEd{^v?

Adjacency matrix:
[0 0 0 0 1 0 1 1 1 1 1]
[0 0 0 0 0 1 0 1 0 1 1]
[0 0 0 0 0 0 1 0 1 1 1]
[0 0 0 0 0 0 0 0 0 1 1]
[1 0 0 0 0 0 0 0 0 0 1]
[0 1 0 0 0 0 0 0 1 0 0]
[1 0 1 0 0 0 0 1 0 0 1]
[1 1 0 0 0 0 1 0 1 1 1]
[1 0 1 0 0 1 0 1 0 1 1]
[1 1 1 1 0 0 0 1 1 0 0]
[1 1 1 1 1 0 1 1 1 0 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1 -1 -1  1 -1 -1  1  1  1 -1]
[-1  1 -1  1 -1  1  1  1 -1 -1  1]
[-1 -1  1  1 -1  1  1 -1  1 -1  1]
[-1  1  1  1  1 -1 -1 -1 -1  1  1]
[ 1 -1 -1  1  1  1 -1 -1  1 -1  1]
[-1  1  1 -1  1  1 -1 -1  1 -1  1]
[-1  1  1 -1 -1 -1  1  1 -1 -1  1]
[ 1  1 -1 -1 -1 -1  1  1 -1  1 -1]
[ 1 -1  1 -1  1  1 -1 -1  1  1 -1]
[ 1 -1 -1  1 -1 -1 -1  1  1  1 -1]
[-1  1  1  1  1  1  1 -1 -1 -1  1]

======================================

     vertices:  11
        edges:  25
automorphisms:  1
graph6-string:  J?`FDrh}CN_

Adjacency matrix:
[0 0 0 0 1 0 1 1 1 1 1]
[0 0 0 0 0 1 1 0 1 1 0]
[0 0 0 0 0 0 1 1 1 1 0]
[0 0 0 0 0 0 0 1 0 1 0]
[1 0 0 0 0 0 0 1 1 1 0]
[0 1 0 0 0 0 0 0 0 0 1]
[1 1 1 0 0 0 0 0 0 0 1]
[1 0 1 1 1 0 0 0 1 0 1]
[1 1 1 0 1 0 0 1 0 0 1]
[1 1 1 1 1 0 0 0 0 0 1]
[1 0 0 0 0 1 1 1 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1 -1 -1  1 -1  1 -1 -1  1  1]
[-1  1  1 -1  1  1 -1 -1  1  1 -1]
[-1  1  1  1 -1 -1  1  1  1 -1 -1]
[-1 -1  1  1 -1  1 -1  1 -1  1  1]
[ 1  1 -1 -1  1 -1 -1 -1  1  1 -1]
[-1  1 -1  1 -1  1 -1  1  1 -1  1]
[ 1 -1  1 -1 -1 -1  1 -1 -1  1  1]
[-1 -1  1  1 -1  1 -1  1  1 -1  1]
[-1  1  1 -1  1  1 -1  1  1 -1 -1]
[ 1  1 -1  1  1 -1  1 -1 -1  1 -1]
[ 1 -1 -1  1 -1  1  1  1 -1 -1  1]

======================================

     vertices:  11
        edges:  25
automorphisms:  2
graph6-string:  J?`F?}]xQV_

Adjacency matrix:
[0 0 0 0 1 0 1 0 1 1 0]
[0 0 0 0 0 1 1 0 0 1 1]
[0 0 0 0 0 0 1 0 0 1 0]
[0 0 0 0 0 0 0 1 1 0 0]
[1 0 0 0 0 0 0 1 1 0 1]
[0 1 0 0 0 0 0 1 1 1 0]
[1 1 1 0 0 0 0 1 1 0 1]
[0 0 0 1 1 1 1 0 0 1 1]
[1 0 0 1 1 1 1 0 0 0 1]
[1 1 1 0 0 1 0 1 0 0 1]
[0 1 0 0 1 0 1 1 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1  1 -1  1  1 -1 -1  1  1 -1]
[-1  1 -1 -1 -1  1  1 -1  1 -1  1]
[ 1 -1  1  1 -1 -1  1  1 -1  1 -1]
[-1 -1  1  1 -1  1  1  1  1 -1 -1]
[ 1 -1 -1 -1  1 -1 -1  1 -1  1  1]
[ 1  1 -1  1 -1  1 -1 -1  1  1 -1]
[-1  1  1  1 -1 -1  1 -1  1 -1  1]
[-1 -1  1  1  1 -1 -1  1 -1  1  1]
[ 1  1 -1  1 -1  1  1 -1  1 -1 -1]
[ 1 -1  1 -1  1  1 -1  1 -1  1 -1]
[-1  1 -1 -1  1 -1  1  1 -1 -1  1]

======================================

     vertices:  11
        edges:  25
automorphisms:  1
graph6-string:  J?`Df`jy_^_

Adjacency matrix:
[0 0 0 0 1 0 1 1 0 1 0]
[0 0 0 0 0 1 0 1 1 1 0]
[0 0 0 0 0 0 1 1 1 1 0]
[0 0 0 0 0 0 1 1 0 0 0]
[1 0 0 0 0 0 0 0 1 1 1]
[0 1 0 0 0 0 0 0 0 0 1]
[1 0 1 1 0 0 0 0 1 1 1]
[1 1 1 1 0 0 0 0 1 0 1]
[0 1 1 0 1 0 1 1 0 0 1]
[1 1 1 0 1 0 1 0 0 0 1]
[0 0 0 0 1 1 1 1 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1  1 -1  1  1 -1 -1  1 -1  1 -1]
[ 1  1  1 -1 -1  1 -1  1 -1  1 -1]
[-1  1  1 -1 -1 -1  1 -1  1  1 -1]
[ 1 -1 -1  1 -1  1  1  1 -1 -1  1]
[ 1 -1 -1 -1  1 -1 -1  1  1 -1  1]
[-1  1 -1  1 -1  1  1 -1 -1  1  1]
[-1 -1  1  1 -1  1  1 -1 -1  1  1]
[ 1  1 -1  1  1 -1 -1  1  1 -1 -1]
[-1 -1  1 -1  1 -1 -1  1  1 -1  1]
[ 1  1  1 -1 -1  1  1 -1 -1  1 -1]
[-1 -1 -1  1  1  1  1 -1  1 -1  1]

======================================

     vertices:  11
        edges:  25
automorphisms:  1
graph6-string:  J?b@d_lB~V_

Adjacency matrix:
[0 0 0 0 1 1 0 1 0 0 1]
[0 0 0 0 0 1 0 0 0 0 1]
[0 0 0 0 0 0 1 1 1 0 1]
[0 0 0 0 0 0 1 1 0 0 0]
[1 0 0 0 0 0 0 0 1 1 1]
[1 1 0 0 0 0 0 0 1 1 0]
[0 0 1 1 0 0 0 0 0 1 1]
[1 0 1 1 0 0 0 0 1 1 1]
[0 0 1 0 1 1 0 1 0 1 1]
[0 0 0 0 1 1 1 1 1 0 1]
[1 1 1 0 1 0 1 1 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1  1 -1  1  1 -1 -1  1 -1 -1  1]
[ 1  1  1 -1 -1  1  1 -1 -1 -1  1]
[-1  1  1 -1 -1 -1 -1  1  1 -1  1]
[ 1 -1 -1  1 -1  1  1  1 -1  1 -1]
[ 1 -1 -1 -1  1 -1  1 -1 -1  1  1]
[-1  1 -1  1 -1  1 -1  1  1  1 -1]
[-1  1 -1  1  1 -1  1 -1 -1  1  1]
[ 1 -1  1  1 -1  1 -1  1  1 -1 -1]
[-1 -1  1 -1 -1  1 -1  1  1  1 -1]
[-1 -1 -1  1  1  1  1 -1  1  1 -1]
[ 1  1  1 -1  1 -1  1 -1 -1 -1  1]

======================================

     vertices:  11
        edges:  25
automorphisms:  1
graph6-string:  J?b@fRJydb_

Adjacency matrix:
[0 0 0 0 1 1 0 1 1 1 1]
[0 0 0 0 0 1 0 1 1 1 0]
[0 0 0 0 0 0 1 1 0 1 1]
[0 0 0 0 0 0 1 0 0 0 1]
[1 0 0 0 0 0 0 1 1 1 0]
[1 1 0 0 0 0 0 0 0 0 0]
[0 0 1 1 0 0 0 0 1 1 0]
[1 1 1 0 1 0 0 0 1 0 1]
[1 1 0 0 1 0 1 1 0 0 1]
[1 1 1 0 1 0 1 0 0 0 1]
[1 0 1 1 0 0 0 1 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1 -1  1  1  1 -1 -1 -1  1  1]
[-1  1  1 -1 -1  1  1  1  1 -1 -1]
[-1  1  1 -1 -1 -1 -1  1 -1  1  1]
[ 1 -1 -1  1 -1  1  1 -1  1 -1  1]
[ 1 -1 -1 -1  1 -1  1 -1  1  1 -1]
[ 1  1 -1  1 -1  1 -1 -1 -1  1  1]
[-1  1 -1  1  1 -1  1 -1  1  1 -1]
[-1  1  1 -1 -1 -1 -1  1  1 -1  1]
[-1  1 -1  1  1 -1  1  1  1 -1 -1]
[ 1 -1  1 -1  1  1  1 -1 -1  1 -1]
[ 1 -1  1  1 -1  1 -1  1 -1 -1  1]

======================================

     vertices:  11
        edges:  25
automorphisms:  2
graph6-string:  J?bFB`uZeF_

Adjacency matrix:
[0 0 0 0 1 1 1 0 0 0 1]
[0 0 0 0 0 1 1 1 1 1 1]
[0 0 0 0 0 0 1 1 1 1 0]
[0 0 0 0 0 0 0 1 1 0 0]
[1 0 0 0 0 0 0 0 0 1 0]
[1 1 0 0 0 0 0 0 1 1 0]
[1 1 1 0 0 0 0 0 1 1 1]
[0 1 1 1 0 0 0 0 0 0 1]
[0 1 1 1 0 1 1 0 0 0 1]
[0 1 1 0 1 1 1 0 0 0 1]
[1 1 0 0 0 0 1 1 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1 -1  1  1 -1  1 -1  1 -1  1]
[-1  1 -1 -1 -1  1 -1  1 -1  1  1]
[-1 -1  1  1  1 -1  1 -1  1  1 -1]
[ 1 -1  1  1  1  1 -1  1  1 -1 -1]
[ 1 -1  1  1  1  1 -1  1 -1  1 -1]
[-1  1 -1  1  1  1 -1 -1  1  1 -1]
[ 1 -1  1 -1 -1 -1  1 -1  1 -1  1]
[-1  1 -1  1  1 -1 -1  1 -1  1  1]
[ 1 -1  1  1 -1  1  1 -1  1 -1 -1]
[-1  1  1 -1  1  1 -1  1 -1  1 -1]
[ 1  1 -1 -1 -1 -1  1  1 -1 -1  1]

======================================

     vertices:  11
        edges:  25
automorphisms:  1
graph6-string:  J?`bErsvBp_

Adjacency matrix:
[0 0 0 0 1 0 0 1 1 1 0]
[0 0 0 0 0 1 1 1 1 1 1]
[0 0 0 0 0 1 1 0 1 0 1]
[0 0 0 0 0 0 0 1 1 1 1]
[1 0 0 0 0 0 0 1 0 1 1]
[0 1 1 0 0 0 0 0 1 1 0]
[0 1 1 0 0 0 0 0 0 0 0]
[1 1 0 1 1 0 0 0 0 0 0]
[1 1 1 1 0 1 0 0 0 0 1]
[1 1 0 1 1 1 0 0 0 0 1]
[0 1 1 1 1 0 0 0 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1  1 -1  1  1 -1  1  1 -1 -1]
[-1  1 -1  1 -1  1  1  1 -1  1 -1]
[ 1 -1  1 -1  1 -1  1 -1  1 -1  1]
[-1  1 -1  1 -1 -1 -1  1  1 -1  1]
[ 1 -1  1 -1  1 -1  1 -1 -1  1  1]
[ 1  1 -1 -1 -1  1 -1 -1  1  1 -1]
[-1  1  1 -1  1 -1  1  1 -1 -1  1]
[ 1  1 -1  1 -1 -1  1  1  1 -1 -1]
[ 1 -1  1  1 -1  1 -1  1  1 -1 -1]
[-1  1 -1 -1  1  1 -1 -1 -1  1  1]
[-1 -1  1  1  1 -1  1 -1 -1  1  1]

======================================

     vertices:  11
        edges:  25
automorphisms:  2
graph6-string:  J?`afbT|BR_

Adjacency matrix:
[0 0 0 0 1 0 0 1 1 1 0]
[0 0 0 0 0 1 1 1 1 1 1]
[0 0 0 0 0 1 0 1 0 1 1]
[0 0 0 0 0 0 1 1 1 1 0]
[1 0 0 0 0 0 0 0 0 0 1]
[0 1 1 0 0 0 0 0 1 1 0]
[0 1 0 1 0 0 0 0 0 0 0]
[1 1 1 1 0 0 0 0 1 0 1]
[1 1 0 1 0 1 0 1 0 0 1]
[1 1 1 1 0 1 0 0 0 0 1]
[0 1 1 0 1 0 0 1 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1 -1  1  1  1 -1 -1  1  1 -1]
[-1  1 -1 -1  1  1  1 -1  1 -1  1]
[-1 -1  1  1 -1 -1 -1  1 -1  1  1]
[ 1 -1  1  1 -1 -1  1  1 -1  1 -1]
[ 1  1 -1 -1  1 -1  1 -1 -1  1  1]
[ 1  1 -1 -1 -1  1 -1 -1  1  1 -1]
[-1  1 -1  1  1 -1  1 -1 -1  1  1]
[-1 -1  1  1 -1 -1 -1  1  1 -1  1]
[ 1  1 -1 -1 -1  1 -1  1  1 -1 -1]
[ 1 -1  1  1  1  1  1 -1 -1  1 -1]
[-1  1  1 -1  1 -1  1  1 -1 -1  1]

======================================

     vertices:  11
        edges:  25
automorphisms:  1
graph6-string:  J?`ebPy}Eb_

Adjacency matrix:
[0 0 0 0 1 0 1 0 0 1 1]
[0 0 0 0 0 1 1 1 1 1 1]
[0 0 0 0 0 1 0 1 1 1 0]
[0 0 0 0 0 0 1 0 1 1 1]
[1 0 0 0 0 0 0 1 1 1 0]
[0 1 1 0 0 0 0 0 0 0 0]
[1 1 0 1 0 0 0 0 1 0 0]
[0 1 1 0 1 0 0 0 0 0 1]
[0 1 1 1 1 0 1 0 0 0 1]
[1 1 1 1 1 0 0 0 0 0 1]
[1 1 0 1 0 0 0 1 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1  1 -1 -1  1  1  1 -1 -1  1 -1]
[ 1  1 -1 -1 -1  1  1  1 -1 -1  1]
[-1 -1  1  1  1  1 -1 -1  1  1 -1]
[-1 -1  1  1 -1 -1 -1 -1  1  1  1]
[ 1 -1  1 -1  1 -1  1  1  1 -1 -1]
[ 1  1  1 -1 -1  1  1 -1 -1  1 -1]
[ 1  1 -1 -1  1  1  1 -1  1 -1 -1]
[-1  1 -1 -1  1 -1 -1  1  1 -1  1]
[-1 -1  1  1  1 -1  1  1  1 -1 -1]
[ 1 -1  1  1 -1  1 -1 -1 -1  1  1]
[-1  1 -1  1 -1 -1 -1  1 -1  1  1]

======================================

     vertices:  11
        edges:  29
automorphisms:  12
graph6-string:  J?AEDFv~v^?

Adjacency matrix:
[0 0 0 0 0 1 1 1 1 1 1]
[0 0 0 0 0 0 1 0 1 1 1]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 0 1 1 0]
[0 0 0 0 0 0 0 0 0 1 1]
[1 0 0 0 0 0 0 0 1 1 1]
[1 1 0 0 0 0 0 1 1 1 1]
[1 0 1 0 0 0 1 0 1 1 1]
[1 1 1 1 0 1 1 1 0 0 1]
[1 1 1 1 1 1 1 1 0 0 0]
[1 1 1 0 1 1 1 1 1 0 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1 -1 -1 -1  1  1  1 -1  1 -1]
[-1  1 -1  1  1 -1  1 -1  1 -1  1]
[-1 -1  1  1  1 -1 -1  1  1 -1  1]
[-1  1  1  1 -1  1 -1 -1  1  1 -1]
[-1  1  1 -1  1  1 -1 -1 -1  1  1]
[ 1 -1 -1  1  1  1 -1 -1  1 -1  1]
[ 1  1 -1 -1 -1 -1  1  1 -1  1 -1]
[ 1 -1  1 -1 -1 -1  1  1 -1  1 -1]
[-1  1  1  1 -1  1 -1 -1  1 -1  1]
[ 1 -1 -1  1  1 -1  1  1 -1  1 -1]
[-1  1  1 -1  1  1 -1 -1  1 -1  1]

======================================

     vertices:  11
        edges:  29
automorphisms:  1
graph6-string:  J?BDDjs~u~?

Adjacency matrix:
[0 0 0 0 0 1 1 1 1 1 1]
[0 0 0 0 0 1 0 0 1 1 1]
[0 0 0 0 0 0 1 1 1 1 0]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 0 0 1 1]
[1 1 0 0 0 0 0 1 1 1 1]
[1 0 1 0 0 0 0 0 0 1 1]
[1 0 1 1 0 1 0 0 0 1 1]
[1 1 1 1 0 1 0 0 0 0 1]
[1 1 1 1 1 1 1 1 0 0 0]
[1 1 0 1 1 1 1 1 1 0 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1 -1 -1 -1  1  1  1 -1 -1  1]
[-1  1  1 -1  1  1 -1 -1  1  1 -1]
[-1  1  1  1 -1 -1  1 -1  1  1 -1]
[-1 -1  1  1  1 -1 -1  1  1 -1  1]
[-1  1 -1  1  1 -1  1 -1 -1  1  1]
[ 1  1 -1 -1 -1  1 -1  1 -1  1 -1]
[ 1 -1  1 -1  1 -1  1 -1  1 -1  1]
[ 1 -1 -1  1 -1  1 -1  1 -1  1 -1]
[-1  1  1  1 -1 -1  1 -1  1 -1  1]
[-1  1  1 -1  1  1 -1  1 -1  1 -1]
[ 1 -1 -1  1  1 -1  1 -1  1 -1  1]

======================================

     vertices:  11
        edges:  29
automorphisms:  2
graph6-string:  J?BDLjJzvl_

Adjacency matrix:
[0 0 0 0 0 1 1 1 1 1 1]
[0 0 0 0 0 1 0 0 1 1 1]
[0 0 0 0 0 0 1 1 0 1 1]
[0 0 0 0 0 0 0 1 0 0 1]
[0 0 0 0 0 0 0 0 1 1 0]
[1 1 0 0 0 0 1 1 0 1 1]
[1 0 1 0 0 1 0 0 1 1 1]
[1 0 1 1 0 1 0 0 1 1 0]
[1 1 0 0 1 0 1 1 0 0 1]
[1 1 1 0 1 1 1 1 0 0 1]
[1 1 1 1 0 1 1 0 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1 -1 -1 -1  1  1  1  1 -1 -1]
[-1  1 -1  1  1  1 -1 -1 -1  1  1]
[-1 -1  1  1  1 -1  1 -1 -1  1  1]
[-1  1  1  1 -1 -1 -1  1  1 -1  1]
[-1  1  1 -1  1 -1 -1  1  1  1 -1]
[ 1  1 -1 -1 -1  1 -1  1 -1  1 -1]
[ 1 -1  1 -1 -1 -1  1 -1  1 -1  1]
[ 1 -1 -1  1  1  1 -1  1 -1  1 -1]
[ 1 -1 -1  1  1 -1  1 -1  1 -1  1]
[-1  1  1 -1  1  1 -1  1 -1  1 -1]
[-1  1  1  1 -1 -1  1 -1  1 -1  1]

======================================

     vertices:  11
        edges:  29
automorphisms:  1
graph6-string:  J?BDLjuuv}?

Adjacency matrix:
[0 0 0 0 0 1 1 1 1 1 1]
[0 0 0 0 0 1 0 0 1 1 1]
[0 0 0 0 0 0 1 1 1 0 1]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 0 0 1 1]
[1 1 0 0 0 0 1 1 1 0 1]
[1 0 1 0 0 1 0 0 1 1 1]
[1 0 1 1 0 1 0 0 0 1 1]
[1 1 1 1 0 1 1 0 0 0 0]
[1 1 0 1 1 0 1 1 0 0 0]
[1 1 1 1 1 1 1 1 0 0 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1 -1 -1 -1  1  1  1 -1  1 -1]
[-1  1 -1  1  1  1 -1 -1  1 -1  1]
[-1 -1  1  1  1 -1  1 -1  1 -1  1]
[-1  1  1  1 -1 -1 -1  1  1  1 -1]
[-1  1  1 -1  1 -1  1 -1 -1  1  1]
[ 1  1 -1 -1 -1  1 -1  1 -1 -1  1]
[ 1 -1  1 -1  1 -1  1 -1  1  1 -1]
[ 1 -1 -1  1 -1  1 -1  1 -1 -1  1]
[-1  1  1  1 -1 -1  1 -1  1  1 -1]
[ 1 -1 -1  1  1 -1  1 -1  1  1 -1]
[-1  1  1 -1  1  1 -1  1 -1 -1  1]

======================================

     vertices:  11
        edges:  29
automorphisms:  1
graph6-string:  J?bERZk~F|?

Adjacency matrix:
[0 0 0 0 1 1 1 0 1 1 1]
[0 0 0 0 0 1 1 1 1 1 1]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 0 0 1 1]
[1 0 0 0 0 0 1 1 1 1 1]
[1 1 0 0 0 0 0 1 1 1 1]
[1 1 0 0 1 0 0 0 0 0 1]
[0 1 1 0 1 1 0 0 0 0 0]
[1 1 1 0 1 1 0 0 0 0 1]
[1 1 1 1 1 1 0 0 0 0 0]
[1 1 1 1 1 1 1 0 1 0 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1 -1 -1  1  1 -1 -1  1  1 -1]
[-1  1 -1  1 -1  1  1  1 -1 -1  1]
[-1 -1  1  1  1 -1 -1  1  1 -1  1]
[-1  1  1  1 -1 -1  1 -1 -1  1  1]
[ 1 -1  1 -1  1 -1  1  1 -1  1 -1]
[ 1  1 -1 -1 -1  1 -1 -1  1  1 -1]
[-1  1 -1  1  1 -1  1  1 -1 -1  1]
[-1  1  1 -1  1 -1  1  1 -1  1 -1]
[ 1 -1  1 -1 -1  1 -1 -1  1 -1  1]
[ 1 -1 -1  1  1  1 -1  1 -1  1 -1]
[-1  1  1  1 -1 -1  1 -1  1 -1  1]

======================================

     vertices:  11
        edges:  29
automorphisms:  1
graph6-string:  J?bERZk|Vn?

Adjacency matrix:
[0 0 0 0 1 1 1 0 1 1 1]
[0 0 0 0 0 1 1 1 1 1 1]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 0 0 1 1]
[1 0 0 0 0 0 1 1 1 0 0]
[1 1 0 0 0 0 0 1 1 1 1]
[1 1 0 0 1 0 0 0 0 0 1]
[0 1 1 0 1 1 0 0 0 1 1]
[1 1 1 0 1 1 0 0 0 0 1]
[1 1 1 1 0 1 0 1 0 0 0]
[1 1 1 1 0 1 1 1 1 0 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1 -1  1  1  1 -1 -1  1  1 -1]
[-1  1 -1 -1 -1  1  1  1 -1 -1  1]
[-1 -1  1  1  1 -1 -1  1  1 -1  1]
[ 1 -1  1  1 -1 -1  1 -1 -1  1  1]
[ 1 -1  1 -1  1 -1  1  1 -1  1 -1]
[ 1  1 -1 -1 -1  1 -1 -1  1  1 -1]
[-1  1 -1  1  1 -1  1  1 -1 -1  1]
[-1  1  1 -1  1 -1  1  1 -1  1 -1]
[ 1 -1  1 -1 -1  1 -1 -1  1 -1  1]
[ 1 -1 -1  1  1  1 -1  1 -1  1 -1]
[-1  1  1  1 -1 -1  1 -1  1 -1  1]

======================================

     vertices:  11
        edges:  29
automorphisms:  2
graph6-string:  J?bb]rw~Ex?

Adjacency matrix:
[0 0 0 0 1 1 0 1 1 1 1]
[0 0 0 0 0 1 1 1 1 1 1]
[0 0 0 0 0 1 1 0 1 1 0]
[0 0 0 0 0 0 0 1 1 1 1]
[1 0 0 0 0 0 1 1 1 1 1]
[1 1 1 0 0 0 1 0 0 1 1]
[0 1 1 0 1 1 0 0 0 0 0]
[1 1 0 1 1 0 0 0 0 0 0]
[1 1 1 1 1 0 0 0 0 0 1]
[1 1 1 1 1 1 0 0 0 0 0]
[1 1 0 1 1 1 0 0 1 0 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1 -1 -1  1  1 -1 -1 -1  1  1]
[-1  1 -1  1 -1  1  1  1 -1 -1  1]
[-1 -1  1  1  1 -1  1 -1  1  1 -1]
[-1  1  1  1 -1 -1 -1  1  1  1 -1]
[ 1 -1  1 -1  1 -1  1  1  1 -1 -1]
[ 1  1 -1 -1 -1  1 -1 -1 -1  1  1]
[-1  1  1 -1  1 -1  1  1  1 -1 -1]
[-1  1 -1  1  1 -1  1  1 -1  1 -1]
[-1 -1  1  1  1 -1  1 -1  1 -1  1]
[ 1 -1  1  1 -1  1 -1  1 -1  1 -1]
[ 1  1 -1 -1 -1  1 -1 -1  1 -1  1]

======================================
     vertices:  3
        edges:  3
automorphisms:  6
graph6-string:  Bw

Adjacency matrix:
[0 1 1]
[1 0 1]
[1 1 0]

(2x)Inverse of the Adjacency matrix:
[-1  1  1]
[ 1 -1  1]
[ 1  1 -1]

======================================

     vertices:  5
        edges:  5
automorphisms:  10
graph6-string:  DLo

Adjacency matrix:
[0 0 0 1 1]
[0 0 1 0 1]
[0 1 0 1 0]
[1 0 1 0 0]
[1 1 0 0 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1 -1  1  1]
[-1  1  1 -1  1]
[-1  1  1  1 -1]
[ 1 -1  1  1 -1]
[ 1  1 -1 -1  1]

======================================

     vertices:  7
        edges:  7
automorphisms:  14
graph6-string:  FHQSO

Adjacency matrix:
[0 0 0 0 0 1 1]
[0 0 1 0 1 0 0]
[0 1 0 1 0 0 0]
[0 0 1 0 0 1 0]
[0 1 0 0 0 0 1]
[1 0 0 1 0 0 0]
[1 0 0 0 1 0 0]

(2x)Inverse of the Adjacency matrix:
[-1 -1 -1  1  1  1  1]
[-1 -1  1  1  1 -1  1]
[-1  1 -1  1  1  1 -1]
[ 1  1  1 -1 -1  1 -1]
[ 1  1  1 -1 -1 -1  1]
[ 1 -1  1  1 -1 -1  1]
[ 1  1 -1 -1  1  1 -1]

======================================

     vertices:  7
        edges:  9
automorphisms:  4
graph6-string:  FK?}W

Adjacency matrix:
[0 0 0 1 0 0 1]
[0 0 1 0 0 0 1]
[0 1 0 0 0 1 0]
[1 0 0 0 0 1 0]
[0 0 0 0 0 1 1]
[0 0 1 1 1 0 1]
[1 1 0 0 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1  1 -1  1 -1 -1  1]
[ 1  1  1 -1 -1 -1  1]
[-1  1  1  1 -1  1 -1]
[ 1 -1  1  1 -1  1 -1]
[-1 -1 -1 -1  1  1  1]
[-1 -1  1  1  1  1 -1]
[ 1  1 -1 -1  1 -1  1]

======================================

     vertices:  9
        edges:  9
automorphisms:  18
graph6-string:  HHOOSIA

Adjacency matrix:
[0 0 0 0 0 0 0 1 1]
[0 0 1 0 1 0 0 0 0]
[0 1 0 1 0 0 0 0 0]
[0 0 1 0 0 1 0 0 0]
[0 1 0 0 0 0 1 0 0]
[0 0 0 1 0 0 0 1 0]
[0 0 0 0 1 0 0 0 1]
[1 0 0 0 0 1 0 0 0]
[1 0 0 0 0 0 1 0 0]

(2x)Inverse of the Adjacency matrix:
[ 1  1  1 -1 -1 -1 -1  1  1]
[ 1  1  1 -1  1 -1 -1  1 -1]
[ 1  1  1  1 -1 -1 -1 -1  1]
[-1 -1  1  1 -1  1  1 -1  1]
[-1  1 -1 -1  1  1  1  1 -1]
[-1 -1 -1  1  1  1  1  1 -1]
[-1 -1 -1  1  1  1  1 -1  1]
[ 1  1 -1 -1  1  1 -1  1 -1]
[ 1 -1  1  1 -1 -1  1 -1  1]

======================================

     vertices:  9
        edges:  11
automorphisms:  4
graph6-string:  H@QCBC\

Adjacency matrix:
[0 0 0 0 0 1 1 0 0]
[0 0 0 0 1 0 0 1 0]
[0 0 0 1 0 0 0 1 0]
[0 0 1 0 0 0 0 0 1]
[0 1 0 0 0 0 0 0 1]
[1 0 0 0 0 0 0 0 1]
[1 0 0 0 0 0 0 1 0]
[0 1 1 0 0 0 1 0 1]
[0 0 0 1 1 1 0 1 0]

(2x)Inverse of the Adjacency matrix:
[-1 -1 -1 -1 -1  1  1  1  1]
[-1 -1 -1 -1  1 -1  1  1  1]
[-1 -1 -1  1 -1 -1  1  1  1]
[-1 -1  1 -1 -1  1 -1  1  1]
[-1  1 -1 -1 -1  1 -1  1  1]
[ 1 -1 -1  1  1 -1  1 -1  1]
[ 1  1  1 -1 -1  1 -1  1 -1]
[ 1  1  1  1  1 -1  1 -1 -1]
[ 1  1  1  1  1  1 -1 -1 -1]

======================================

     vertices:  9
        edges:  13
automorphisms:  2
graph6-string:  HK@KPKV

Adjacency matrix:
[0 0 0 1 0 0 1 0 0]
[0 0 1 0 0 1 0 0 0]
[0 1 0 0 0 0 0 1 0]
[1 0 0 0 0 0 0 0 1]
[0 0 0 0 0 1 1 0 0]
[0 1 0 0 1 0 0 1 1]
[1 0 0 0 1 0 0 1 1]
[0 0 1 0 0 1 1 0 1]
[0 0 0 1 0 1 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1  1  1  1  1 -1  1 -1 -1]
[ 1  1  1  1  1  1 -1 -1 -1]
[ 1  1  1 -1 -1 -1  1  1 -1]
[ 1  1 -1  1 -1  1 -1 -1  1]
[ 1  1 -1 -1  1  1  1 -1 -1]
[-1  1 -1  1  1  1 -1 -1  1]
[ 1 -1  1 -1  1 -1  1  1 -1]
[-1 -1  1 -1 -1 -1  1  1  1]
[-1 -1 -1  1 -1  1 -1  1  1]

======================================

     vertices:  9
        edges:  13
automorphisms:  2
graph6-string:  H_?hiiJ

Adjacency matrix:
[0 1 0 0 0 0 0 0 1]
[1 0 0 0 0 0 0 1 0]
[0 0 0 0 0 1 1 0 0]
[0 0 0 0 0 0 1 1 0]
[0 0 0 0 0 1 0 0 1]
[0 0 1 0 1 0 1 1 0]
[0 0 1 1 0 1 0 0 1]
[0 1 0 1 0 1 0 0 1]
[1 0 0 0 1 0 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1  1  1 -1 -1 -1  1 -1  1]
[ 1  1  1 -1 -1  1 -1  1 -1]
[ 1  1  1 -1 -1  1  1 -1 -1]
[-1 -1 -1  1 -1 -1  1  1  1]
[-1 -1 -1 -1  1  1 -1  1  1]
[-1  1  1 -1  1  1 -1  1 -1]
[ 1 -1  1  1 -1 -1  1 -1  1]
[-1  1 -1  1  1  1 -1  1 -1]
[ 1 -1 -1  1  1 -1  1 -1  1]

======================================

     vertices:  9
        edges:  13
automorphisms:  2
graph6-string:  HK?@OnN

Adjacency matrix:
[0 0 0 1 0 0 0 0 1]
[0 0 1 0 0 0 0 0 1]
[0 1 0 0 0 0 1 0 0]
[1 0 0 0 0 0 0 1 0]
[0 0 0 0 0 0 1 0 1]
[0 0 0 0 0 0 0 1 1]
[0 0 1 0 1 0 0 1 1]
[0 0 0 1 0 1 1 0 1]
[1 1 0 0 1 1 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1  1 -1  1  1 -1 -1 -1  1]
[ 1  1  1 -1 -1  1 -1 -1  1]
[-1  1  1  1 -1 -1  1  1 -1]
[ 1 -1  1  1 -1 -1  1  1 -1]
[ 1 -1 -1 -1  1 -1  1 -1  1]
[-1  1 -1 -1 -1  1 -1  1  1]
[-1 -1  1  1  1 -1  1  1 -1]
[-1 -1  1  1 -1  1  1  1 -1]
[ 1  1 -1 -1  1  1 -1 -1  1]

======================================

     vertices:  9
        edges:  15
automorphisms:  6
graph6-string:  H@SicmM

Adjacency matrix:
[0 0 0 0 0 0 0 1 1]
[0 0 0 0 1 0 1 0 0]
[0 0 0 1 0 1 0 0 0]
[0 0 1 0 1 0 1 1 0]
[0 1 0 1 0 1 0 0 1]
[0 0 1 0 1 0 0 1 1]
[0 1 0 1 0 0 0 1 1]
[1 0 0 1 0 1 1 0 0]
[1 0 0 0 1 1 1 0 0]

(2x)Inverse of the Adjacency matrix:
[-1 -1 -1 -1 -1  1  1  1  1]
[-1 -1 -1  1  1 -1  1 -1  1]
[-1 -1 -1  1  1  1 -1  1 -1]
[-1  1  1 -1 -1  1  1  1 -1]
[-1  1  1 -1 -1  1  1 -1  1]
[ 1 -1  1  1  1 -1 -1 -1  1]
[ 1  1 -1  1  1 -1 -1  1 -1]
[ 1 -1  1  1 -1 -1  1 -1  1]
[ 1  1 -1 -1  1  1 -1  1 -1]

======================================

     vertices:  9
        edges:  17
automorphisms:  2
graph6-string:  H?DSZu|

Adjacency matrix:
[0 0 0 0 0 0 1 0 1]
[0 0 0 0 0 1 0 1 0]
[0 0 0 0 0 0 0 1 1]
[0 0 0 0 1 1 0 1 1]
[0 0 0 1 0 0 1 1 1]
[0 1 0 1 0 0 1 0 1]
[1 0 0 0 1 1 0 1 0]
[0 1 1 1 1 0 1 0 1]
[1 0 1 1 1 1 0 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1  1 -1 -1  1  1 -1  1]
[-1  1  1 -1 -1  1  1  1 -1]
[ 1  1  1 -1 -1 -1 -1  1  1]
[-1 -1 -1  1  1  1 -1 -1  1]
[-1 -1 -1  1  1 -1  1  1 -1]
[ 1  1 -1  1 -1  1 -1 -1  1]
[ 1  1 -1 -1  1 -1  1  1 -1]
[-1  1  1 -1  1 -1  1  1 -1]
[ 1 -1  1  1 -1  1 -1 -1  1]

======================================

     vertices:  9
        edges:  17
automorphisms:  2
graph6-string:  H@GR[z{

Adjacency matrix:
[0 0 0 0 0 0 0 1 1]
[0 0 0 0 0 0 1 0 1]
[0 0 0 1 1 0 1 0 1]
[0 0 1 0 0 1 0 1 1]
[0 0 1 0 0 0 1 1 1]
[0 0 0 1 0 0 1 1 1]
[0 1 1 0 1 1 0 0 0]
[1 0 0 1 1 1 0 0 0]
[1 1 1 1 1 1 0 0 0]

(2x)Inverse of the Adjacency matrix:
[ 1  1 -1 -1  1 -1 -1  1  1]
[ 1  1 -1 -1 -1  1  1 -1  1]
[-1 -1  1  1  1 -1 -1 -1  1]
[-1 -1  1  1 -1  1 -1 -1  1]
[ 1 -1  1 -1  1 -1  1  1 -1]
[-1  1 -1  1 -1  1  1  1 -1]
[-1  1 -1 -1  1  1  1  1 -1]
[ 1 -1 -1 -1  1  1  1  1 -1]
[ 1  1  1  1 -1 -1 -1 -1  1]

======================================

     vertices:  9
        edges:  18
automorphisms:  72
graph6-string:  HBYleVS

Adjacency matrix:
[0 0 0 0 0 1 1 1 1]
[0 0 0 1 1 0 0 1 1]
[0 0 0 1 1 1 1 0 0]
[0 1 1 0 0 0 1 0 1]
[0 1 1 0 0 1 0 1 0]
[1 0 1 0 1 0 0 0 1]
[1 0 1 1 0 0 0 1 0]
[1 1 0 0 1 0 1 0 0]
[1 1 0 1 0 1 0 0 0]

(4x)Inverse of the Adjacency matrix:
[ 1 -1 -1 -1 -1  1  1  1  1]
[-1  1 -1  1  1 -1 -1  1  1]
[-1 -1  1  1  1  1  1 -1 -1]
[-1  1  1  1 -1 -1  1 -1  1]
[-1  1  1 -1  1  1 -1  1 -1]
[ 1 -1  1 -1  1  1 -1 -1  1]
[ 1 -1  1  1 -1 -1  1  1 -1]
[ 1  1 -1 -1  1 -1  1  1 -1]
[ 1  1 -1  1 -1  1 -1 -1  1]

======================================

     vertices:  11
        edges:  11
automorphisms:  22
graph6-string:  J?AEB?oE?W?

Adjacency matrix:
[0 0 0 0 0 1 1 0 0 0 0]
[0 0 0 0 0 0 1 1 0 0 0]
[0 0 0 0 0 0 0 1 1 0 0]
[0 0 0 0 0 0 0 0 1 1 0]
[0 0 0 0 0 0 0 0 0 1 1]
[1 0 0 0 0 0 0 0 0 0 1]
[1 1 0 0 0 0 0 0 0 0 0]
[0 1 1 0 0 0 0 0 0 0 0]
[0 0 1 1 0 0 0 0 0 0 0]
[0 0 0 1 1 0 0 0 0 0 0]
[0 0 0 0 1 1 0 0 0 0 0]

(2x)Inverse of the Adjacency matrix:
[-1  1 -1  1 -1  1  1 -1  1 -1  1]
[ 1 -1  1 -1  1 -1  1  1 -1  1 -1]
[-1  1 -1  1 -1  1 -1  1  1 -1  1]
[ 1 -1  1 -1  1 -1  1 -1  1  1 -1]
[-1  1 -1  1 -1  1 -1  1 -1  1  1]
[ 1 -1  1 -1  1 -1  1 -1  1 -1  1]
[ 1  1 -1  1 -1  1 -1  1 -1  1 -1]
[-1  1  1 -1  1 -1  1 -1  1 -1  1]
[ 1 -1  1  1 -1  1 -1  1 -1  1 -1]
[-1  1 -1  1  1 -1  1 -1  1 -1  1]
[ 1 -1  1 -1  1  1 -1  1 -1  1 -1]

======================================

     vertices:  11
        edges:  13
automorphisms:  2
graph6-string:  J?AAD?oU?[_

Adjacency matrix:
[0 0 0 0 0 1 0 1 0 0 0]
[0 0 0 0 0 0 1 0 0 1 0]
[0 0 0 0 0 0 0 1 1 0 0]
[0 0 0 0 0 0 0 0 1 1 0]
[0 0 0 0 0 0 0 0 0 1 1]
[1 0 0 0 0 0 0 0 0 0 1]
[0 1 0 0 0 0 0 0 0 0 1]
[1 0 1 0 0 0 0 0 0 0 0]
[0 0 1 1 0 0 0 0 0 0 0]
[0 1 0 1 1 0 0 0 0 0 1]
[0 0 0 0 1 1 1 0 0 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1  1 -1  1 -1  1 -1  1 -1  1 -1]
[ 1  1 -1  1 -1 -1  1  1 -1  1 -1]
[-1 -1  1 -1  1 -1  1  1  1 -1  1]
[ 1  1 -1  1 -1  1 -1 -1  1  1 -1]
[-1 -1  1 -1  1 -1 -1  1 -1  1  1]
[ 1 -1 -1  1 -1  1  1 -1  1 -1  1]
[-1  1  1 -1 -1  1  1 -1  1 -1  1]
[ 1  1  1 -1  1 -1 -1  1 -1  1 -1]
[-1 -1  1  1 -1  1  1 -1  1 -1  1]
[ 1  1 -1  1  1 -1 -1  1 -1  1 -1]
[-1 -1  1 -1  1  1  1 -1  1 -1  1]

======================================

     vertices:  11
        edges:  13
automorphisms:  4
graph6-string:  J?AA@_gs?[_

Adjacency matrix:
[0 0 0 0 0 1 0 0 0 1 0]
[0 0 0 0 0 0 1 0 0 1 0]
[0 0 0 0 0 0 0 1 1 0 0]
[0 0 0 0 0 0 0 1 0 1 0]
[0 0 0 0 0 0 0 0 1 0 1]
[1 0 0 0 0 0 0 0 0 0 1]
[0 1 0 0 0 0 0 0 0 0 1]
[0 0 1 1 0 0 0 0 0 0 0]
[0 0 1 0 1 0 0 0 0 0 0]
[1 1 0 1 0 0 0 0 0 0 1]
[0 0 0 0 1 1 1 0 0 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1  1  1 -1 -1  1 -1 -1  1  1 -1]
[ 1  1  1 -1 -1 -1  1 -1  1  1 -1]
[ 1  1  1 -1 -1  1  1  1  1 -1 -1]
[-1 -1 -1  1  1 -1 -1  1 -1  1  1]
[-1 -1 -1  1  1 -1 -1 -1  1  1  1]
[ 1 -1  1 -1 -1  1  1  1 -1 -1  1]
[-1  1  1 -1 -1  1  1  1 -1 -1  1]
[-1 -1  1  1 -1  1  1  1 -1 -1  1]
[ 1  1  1 -1  1 -1 -1 -1  1  1 -1]
[ 1  1 -1  1  1 -1 -1 -1  1  1 -1]
[-1 -1 -1  1  1  1  1  1 -1 -1  1]

======================================

     vertices:  11
        edges:  15
automorphisms:  2
graph6-string:  J?AAD@oFOV?

Adjacency matrix:
[0 0 0 0 0 1 0 1 0 0 0]
[0 0 0 0 0 0 1 0 1 0 0]
[0 0 0 0 0 0 0 1 1 0 0]
[0 0 0 0 0 0 0 0 1 1 0]
[0 0 0 0 0 0 0 0 0 1 1]
[1 0 0 0 0 0 0 0 0 1 0]
[0 1 0 0 0 0 0 0 0 0 1]
[1 0 1 0 0 0 0 0 0 1 1]
[0 1 1 1 0 0 0 0 0 0 1]
[0 0 0 1 1 1 0 1 0 0 0]
[0 0 0 0 1 0 1 1 1 0 0]

(2x)Inverse of the Adjacency matrix:
[-1  1  1 -1 -1  1  1  1 -1  1 -1]
[ 1 -1 -1  1 -1  1  1 -1  1 -1  1]
[ 1 -1 -1  1 -1 -1 -1  1  1 -1  1]
[-1  1  1 -1  1  1 -1 -1  1  1 -1]
[-1 -1 -1  1 -1 -1  1  1 -1  1  1]
[ 1  1 -1  1 -1 -1  1  1 -1  1 -1]
[ 1  1 -1 -1  1  1 -1 -1  1 -1  1]
[ 1 -1  1 -1  1  1 -1 -1  1 -1  1]
[-1  1  1  1 -1 -1  1  1 -1  1 -1]
[ 1 -1 -1  1  1  1 -1 -1  1 -1  1]
[-1  1  1 -1  1 -1  1  1 -1  1 -1]

======================================

     vertices:  11
        edges:  15
automorphisms:  8
graph6-string:  J?AA@_gw@{_

Adjacency matrix:
[0 0 0 0 0 1 0 0 0 1 0]
[0 0 0 0 0 0 1 0 0 1 0]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 1 0 0 1]
[0 0 0 0 0 0 0 0 1 0 1]
[1 0 0 0 0 0 0 0 0 0 1]
[0 1 0 0 0 0 0 0 0 0 1]
[0 0 1 1 0 0 0 0 0 0 0]
[0 0 1 0 1 0 0 0 0 0 0]
[1 1 1 0 0 0 0 0 0 0 1]
[0 0 1 1 1 1 1 0 0 1 0]

(2x)Inverse of the Adjacency matrix:
[-1 -1  1 -1 -1  1 -1 -1 -1  1  1]
[-1 -1  1 -1 -1 -1  1 -1 -1  1  1]
[ 1  1 -1  1  1 -1 -1  1  1  1 -1]
[-1 -1  1 -1 -1  1  1  1 -1 -1  1]
[-1 -1  1 -1 -1  1  1 -1  1 -1  1]
[ 1 -1 -1  1  1 -1 -1 -1 -1  1  1]
[-1  1 -1  1  1 -1 -1 -1 -1  1  1]
[-1 -1  1  1 -1 -1 -1 -1 -1  1  1]
[-1 -1  1 -1  1 -1 -1 -1 -1  1  1]
[ 1  1  1 -1 -1  1  1  1  1 -1 -1]
[ 1  1 -1  1  1  1  1  1  1 -1 -1]

======================================

     vertices:  11
        edges:  15
automorphisms:  2
graph6-string:  J?AEB?oZBo?

Adjacency matrix:
[0 0 0 0 0 1 1 0 0 0 0]
[0 0 0 0 0 0 1 1 0 1 1]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 0 1 0 1]
[0 0 0 0 0 0 0 0 0 1 1]
[1 0 0 0 0 0 0 0 0 1 0]
[1 1 0 0 0 0 0 0 0 0 0]
[0 1 1 0 0 0 0 0 0 0 0]
[0 0 1 1 0 0 0 0 0 0 0]
[0 1 1 0 1 1 0 0 0 0 0]
[0 1 1 1 1 0 0 0 0 0 0]

(2x)Inverse of the Adjacency matrix:
[-1  1 -1  1 -1  1  1 -1  1  1 -1]
[ 1 -1  1 -1  1 -1  1  1 -1 -1  1]
[-1  1 -1  1 -1  1 -1  1  1  1 -1]
[ 1 -1  1 -1  1 -1  1 -1  1 -1  1]
[-1  1 -1  1 -1  1 -1 -1 -1  1  1]
[ 1 -1  1 -1  1 -1  1 -1  1  1 -1]
[ 1  1 -1  1 -1  1 -1  1 -1 -1  1]
[-1  1  1 -1 -1 -1  1 -1  1  1 -1]
[ 1 -1  1  1 -1  1 -1  1 -1 -1  1]
[ 1 -1  1 -1  1  1 -1  1 -1 -1  1]
[-1  1 -1  1  1 -1  1 -1  1  1 -1]

======================================

     vertices:  11
        edges:  15
automorphisms:  2
graph6-string:  J?AE@bGJC`_

Adjacency matrix:
[0 0 0 0 0 1 1 0 1 0 1]
[0 0 0 0 0 0 1 0 1 0 0]
[0 0 0 0 0 0 0 1 0 1 0]
[0 0 0 0 0 0 0 1 0 0 1]
[0 0 0 0 0 0 0 0 1 1 0]
[1 0 0 0 0 0 0 0 0 1 0]
[1 1 0 0 0 0 0 0 0 0 0]
[0 0 1 1 0 0 0 0 0 0 0]
[1 1 0 0 1 0 0 0 0 0 1]
[0 0 1 0 1 1 0 0 0 0 1]
[1 0 0 1 0 0 0 0 1 1 0]

(2x)Inverse of the Adjacency matrix:
[-1  1 -1  1 -1  1  1 -1 -1  1  1]
[ 1 -1  1 -1  1 -1  1  1  1 -1 -1]
[-1  1 -1  1  1  1  1  1 -1  1 -1]
[ 1 -1  1 -1 -1 -1 -1  1  1 -1  1]
[-1  1  1 -1 -1 -1 -1 -1  1  1  1]
[ 1 -1  1 -1 -1 -1  1 -1 -1  1  1]
[ 1  1  1 -1 -1  1 -1  1  1 -1 -1]
[-1  1  1  1 -1 -1  1 -1 -1  1  1]
[-1  1 -1  1  1 -1  1 -1 -1  1  1]
[ 1 -1  1 -1  1  1 -1  1  1 -1 -1]
[ 1 -1 -1  1  1  1 -1  1  1 -1 -1]

======================================

     vertices:  11
        edges:  15
automorphisms:  2
graph6-string:  J?ABA_g{BW?

Adjacency matrix:
[0 0 0 0 0 1 0 0 0 1 0]
[0 0 0 0 0 0 1 1 0 1 1]
[0 0 0 0 0 0 1 0 1 1 1]
[0 0 0 0 0 0 0 1 0 1 0]
[0 0 0 0 0 0 0 0 1 0 1]
[1 0 0 0 0 0 0 0 0 0 1]
[0 1 1 0 0 0 0 0 0 0 0]
[0 1 0 1 0 0 0 0 0 0 0]
[0 0 1 0 1 0 0 0 0 0 0]
[1 1 1 1 0 0 0 0 0 0 0]
[0 1 1 0 1 1 0 0 0 0 0]

(2x)Inverse of the Adjacency matrix:
[-1 -1  1  1 -1  1 -1 -1 -1  1  1]
[-1 -1  1  1 -1  1  1  1 -1 -1  1]
[ 1  1 -1 -1  1 -1  1 -1  1  1 -1]
[ 1  1 -1 -1  1 -1 -1  1  1  1 -1]
[-1 -1  1  1 -1  1 -1  1  1 -1  1]
[ 1  1 -1 -1  1 -1 -1 -1 -1  1  1]
[-1  1  1 -1 -1 -1 -1 -1 -1  1  1]
[-1  1 -1  1  1 -1 -1 -1 -1  1  1]
[-1 -1  1  1  1 -1 -1 -1 -1  1  1]
[ 1 -1  1  1 -1  1  1  1  1 -1 -1]
[ 1  1 -1 -1  1  1  1  1  1 -1 -1]

======================================

     vertices:  11
        edges:  17
automorphisms:  2
graph6-string:  J?AA@BOiC~_

Adjacency matrix:
[0 0 0 0 0 1 0 0 1 1 1]
[0 0 0 0 0 0 1 0 1 0 0]
[0 0 0 0 0 0 0 1 0 1 0]
[0 0 0 0 0 0 0 0 1 0 1]
[0 0 0 0 0 0 0 0 0 1 1]
[1 0 0 0 0 0 0 0 0 0 1]
[0 1 0 0 0 0 0 0 0 0 1]
[0 0 1 0 0 0 0 0 0 0 1]
[1 1 0 1 0 0 0 0 0 0 1]
[1 0 1 0 1 0 0 0 0 0 1]
[1 0 0 1 1 1 1 1 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1  1  1 -1 -1  1 -1 -1  1  1 -1]
[ 1  1  1 -1 -1 -1  1 -1  1  1 -1]
[ 1  1  1 -1 -1 -1 -1  1  1  1 -1]
[-1 -1 -1  1  1 -1 -1  1  1 -1  1]
[-1 -1 -1  1  1 -1  1 -1 -1  1  1]
[ 1 -1 -1 -1 -1  1  1  1 -1 -1  1]
[-1  1 -1 -1  1  1  1  1 -1 -1  1]
[-1 -1  1  1 -1  1  1  1 -1 -1  1]
[ 1  1  1  1 -1 -1 -1 -1  1  1 -1]
[ 1  1  1 -1  1 -1 -1 -1  1  1 -1]
[-1 -1 -1  1  1  1  1  1 -1 -1  1]

======================================

     vertices:  11
        edges:  17
automorphisms:  12
graph6-string:  J?AAD@OaT}_

Adjacency matrix:
[0 0 0 0 0 1 0 1 0 1 1]
[0 0 0 0 0 0 1 0 1 0 0]
[0 0 0 0 0 0 0 1 0 0 1]
[0 0 0 0 0 0 0 0 1 0 1]
[0 0 0 0 0 0 0 0 0 1 1]
[1 0 0 0 0 0 0 0 0 0 1]
[0 1 0 0 0 0 0 0 0 0 1]
[1 0 1 0 0 0 0 0 0 1 1]
[0 1 0 1 0 0 0 0 0 0 0]
[1 0 0 0 1 0 0 1 0 0 1]
[1 0 1 1 1 1 1 1 0 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1  1 -1 -1 -1  1 -1  1  1  1 -1]
[ 1  1 -1 -1 -1 -1  1  1  1  1 -1]
[-1 -1  1  1 -1 -1  1  1 -1 -1  1]
[-1 -1  1  1  1  1 -1 -1  1 -1  1]
[-1 -1 -1  1  1 -1  1 -1 -1  1  1]
[ 1 -1 -1  1 -1  1  1 -1 -1 -1  1]
[-1  1  1 -1  1  1  1 -1 -1 -1  1]
[ 1  1  1 -1 -1 -1 -1  1  1  1 -1]
[ 1  1 -1  1 -1 -1 -1  1  1  1 -1]
[ 1  1 -1 -1  1 -1 -1  1  1  1 -1]
[-1 -1  1  1  1  1  1 -1 -1 -1  1]

======================================

     vertices:  11
        edges:  17
automorphisms:  2
graph6-string:  J?AAD@OzEs_

Adjacency matrix:
[0 0 0 0 0 1 0 1 0 1 1]
[0 0 0 0 0 0 1 0 1 1 1]
[0 0 0 0 0 0 0 1 0 1 0]
[0 0 0 0 0 0 0 0 1 0 1]
[0 0 0 0 0 0 0 0 0 1 1]
[1 0 0 0 0 0 0 0 0 1 0]
[0 1 0 0 0 0 0 0 0 0 1]
[1 0 1 0 0 0 0 0 0 0 0]
[0 1 0 1 0 0 0 0 0 0 0]
[1 1 1 0 1 1 0 0 0 0 1]
[1 1 0 1 1 0 1 0 0 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1 -1  1 -1  1  1  1 -1 -1  1]
[-1  1  1 -1 -1  1  1 -1  1  1 -1]
[-1  1  1 -1  1 -1 -1  1  1  1 -1]
[ 1 -1 -1  1  1 -1 -1  1  1 -1  1]
[-1 -1  1  1  1 -1 -1 -1 -1  1  1]
[ 1  1 -1 -1 -1  1 -1 -1  1  1 -1]
[ 1  1 -1 -1 -1 -1  1  1 -1 -1  1]
[ 1 -1  1  1 -1 -1  1  1 -1 -1  1]
[-1  1  1  1 -1  1 -1 -1  1  1 -1]
[-1  1  1 -1  1  1 -1 -1  1  1 -1]
[ 1 -1 -1  1  1 -1  1  1 -1 -1  1]

======================================

     vertices:  11
        edges:  17
automorphisms:  1
graph6-string:  J?AAD?o}D[_

Adjacency matrix:
[0 0 0 0 0 1 0 1 0 1 1]
[0 0 0 0 0 0 1 0 0 1 0]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 0 1 1 0]
[0 0 0 0 0 0 0 0 0 1 1]
[1 0 0 0 0 0 0 0 0 0 1]
[0 1 0 0 0 0 0 0 0 0 1]
[1 0 1 0 0 0 0 0 0 0 0]
[0 0 1 1 0 0 0 0 0 0 0]
[1 1 1 1 1 0 0 0 0 0 1]
[1 0 1 0 1 1 1 0 0 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1  1 -1  1 -1  1 -1  1 -1  1 -1]
[ 1  1 -1  1 -1 -1  1  1 -1  1 -1]
[-1 -1  1 -1  1 -1  1  1  1 -1  1]
[ 1  1 -1  1 -1  1 -1 -1  1  1 -1]
[-1 -1  1 -1  1 -1 -1 -1 -1  1  1]
[ 1 -1 -1  1 -1  1  1 -1  1 -1  1]
[-1  1  1 -1 -1  1  1 -1  1 -1  1]
[ 1  1  1 -1 -1 -1 -1  1 -1  1 -1]
[-1 -1  1  1 -1  1  1 -1  1 -1  1]
[ 1  1 -1  1  1 -1 -1  1 -1  1 -1]
[-1 -1  1 -1  1  1  1 -1  1 -1  1]

======================================

     vertices:  11
        edges:  17
automorphisms:  2
graph6-string:  J?AAD?o]P]_

Adjacency matrix:
[0 0 0 0 0 1 0 1 0 0 0]
[0 0 0 0 0 0 1 0 0 1 0]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 0 1 1 0]
[0 0 0 0 0 0 0 0 0 1 1]
[1 0 0 0 0 0 0 0 0 0 1]
[0 1 0 0 0 0 0 0 0 0 1]
[1 0 1 0 0 0 0 0 0 1 1]
[0 0 1 1 0 0 0 0 0 0 0]
[0 1 1 1 1 0 0 1 0 0 1]
[0 0 1 0 1 1 1 1 0 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1  1 -1  1 -1  1 -1  1 -1  1 -1]
[ 1  1 -1  1 -1 -1  1  1 -1  1 -1]
[-1 -1  1 -1 -1 -1  1  1  1 -1  1]
[ 1  1 -1  1  1  1 -1 -1  1  1 -1]
[-1 -1 -1  1  1  1 -1 -1 -1  1  1]
[ 1 -1 -1  1  1  1  1 -1  1 -1  1]
[-1  1  1 -1 -1  1  1 -1  1 -1  1]
[ 1  1  1 -1 -1 -1 -1  1 -1  1 -1]
[-1 -1  1  1 -1  1  1 -1  1 -1  1]
[ 1  1 -1  1  1 -1 -1  1 -1  1 -1]
[-1 -1  1 -1  1  1  1 -1  1 -1  1]

======================================

     vertices:  11
        edges:  17
automorphisms:  1
graph6-string:  J?AAD@ojDt?

Adjacency matrix:
[0 0 0 0 0 1 0 1 0 1 1]
[0 0 0 0 0 0 1 0 1 0 0]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 0 1 0 1]
[0 0 0 0 0 0 0 0 0 1 1]
[1 0 0 0 0 0 0 0 0 1 0]
[0 1 0 0 0 0 0 0 0 0 1]
[1 0 1 0 0 0 0 0 0 0 0]
[0 1 1 1 0 0 0 0 0 0 1]
[1 0 1 0 1 1 0 0 0 0 0]
[1 0 1 1 1 0 1 0 1 0 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1 -1  1 -1  1  1  1 -1 -1  1]
[-1  1  1 -1 -1  1  1 -1  1  1 -1]
[-1  1  1 -1  1 -1 -1  1  1  1 -1]
[ 1 -1 -1  1 -1  1 -1 -1  1 -1  1]
[-1 -1  1 -1  1 -1  1 -1 -1  1  1]
[ 1  1 -1  1 -1  1 -1 -1  1  1 -1]
[ 1  1 -1 -1  1 -1  1  1 -1 -1  1]
[ 1 -1  1 -1 -1 -1  1  1 -1 -1  1]
[-1  1  1  1 -1  1 -1 -1  1  1 -1]
[-1  1  1 -1  1  1 -1 -1  1  1 -1]
[ 1 -1 -1  1  1 -1  1  1 -1 -1  1]

======================================

     vertices:  11
        edges:  17
automorphisms:  1
graph6-string:  J?AAD@oRQv?

Adjacency matrix:
[0 0 0 0 0 1 0 1 0 0 0]
[0 0 0 0 0 0 1 0 1 1 1]
[0 0 0 0 0 0 0 1 1 0 0]
[0 0 0 0 0 0 0 0 1 0 1]
[0 0 0 0 0 0 0 0 0 1 1]
[1 0 0 0 0 0 0 0 0 1 0]
[0 1 0 0 0 0 0 0 0 0 1]
[1 0 1 0 0 0 0 0 0 1 1]
[0 1 1 1 0 0 0 0 0 0 1]
[0 1 0 0 1 1 0 1 0 0 0]
[0 1 0 1 1 0 1 1 1 0 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1 -1  1 -1  1  1  1 -1 -1  1]
[-1  1  1 -1 -1  1  1 -1  1  1 -1]
[-1  1  1 -1 -1 -1 -1  1  1  1 -1]
[ 1 -1 -1  1  1  1 -1 -1  1 -1  1]
[-1 -1 -1  1  1 -1 -1  1 -1  1  1]
[ 1  1 -1  1 -1  1 -1 -1  1  1 -1]
[ 1  1 -1 -1 -1 -1  1  1 -1 -1  1]
[ 1 -1  1 -1  1 -1  1  1 -1 -1  1]
[-1  1  1  1 -1  1 -1 -1  1  1 -1]
[-1  1  1 -1  1  1 -1 -1  1  1 -1]
[ 1 -1 -1  1  1 -1  1  1 -1 -1  1]

======================================

     vertices:  11
        edges:  17
automorphisms:  1
graph6-string:  J?AAD@oJPv?

Adjacency matrix:
[0 0 0 0 0 1 0 1 0 0 0]
[0 0 0 0 0 0 1 0 1 0 0]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 0 1 0 1]
[0 0 0 0 0 0 0 0 0 1 1]
[1 0 0 0 0 0 0 0 0 1 0]
[0 1 0 0 0 0 0 0 0 0 1]
[1 0 1 0 0 0 0 0 0 1 1]
[0 1 1 1 0 0 0 0 0 0 1]
[0 0 1 0 1 1 0 1 0 0 0]
[0 0 1 1 1 0 1 1 1 0 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1 -1  1 -1  1  1  1 -1 -1  1]
[-1  1  1 -1 -1  1  1 -1  1  1 -1]
[-1  1  1 -1 -1 -1 -1  1  1  1 -1]
[ 1 -1 -1  1  1  1 -1 -1  1 -1  1]
[-1 -1 -1  1  1  1  1 -1 -1  1  1]
[ 1  1 -1  1  1  1 -1 -1  1  1 -1]
[ 1  1 -1 -1  1 -1  1  1 -1 -1  1]
[ 1 -1  1 -1 -1 -1  1  1 -1 -1  1]
[-1  1  1  1 -1  1 -1 -1  1  1 -1]
[-1  1  1 -1  1  1 -1 -1  1  1 -1]
[ 1 -1 -1  1  1 -1  1  1 -1 -1  1]

======================================

     vertices:  11
        edges:  17
automorphisms:  1
graph6-string:  J?AA@b_mD\?

Adjacency matrix:
[0 0 0 0 0 1 0 0 1 1 1]
[0 0 0 0 0 0 1 0 1 0 0]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 1 0 1 0]
[0 0 0 0 0 0 0 0 0 1 1]
[1 0 0 0 0 0 0 0 0 0 1]
[0 1 0 0 0 0 0 0 0 0 1]
[0 0 1 1 0 0 0 0 0 0 0]
[1 1 1 0 0 0 0 0 0 0 1]
[1 0 1 1 1 0 0 0 0 0 0]
[1 0 1 0 1 1 1 0 1 0 0]

(2x)Inverse of the Adjacency matrix:
[ 1  1 -1  1 -1  1 -1 -1  1  1 -1]
[ 1  1 -1  1 -1 -1  1 -1  1  1 -1]
[-1 -1  1 -1  1 -1 -1  1  1 -1  1]
[ 1  1 -1  1 -1  1  1  1 -1  1 -1]
[-1 -1  1 -1  1 -1  1 -1 -1  1  1]
[ 1 -1 -1  1 -1  1  1  1 -1 -1  1]
[-1  1 -1  1  1  1  1  1 -1 -1  1]
[-1 -1  1  1 -1  1  1  1 -1 -1  1]
[ 1  1  1 -1 -1 -1 -1 -1  1  1 -1]
[ 1  1 -1  1  1 -1 -1 -1  1  1 -1]
[-1 -1  1 -1  1  1  1  1 -1 -1  1]

======================================

     vertices:  11
        edges:  17
automorphisms:  2
graph6-string:  J?AA@qoY@N_

Adjacency matrix:
[0 0 0 0 0 1 0 0 1 0 0]
[0 0 0 0 0 0 1 0 0 1 0]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 1 1 0 0]
[0 0 0 0 0 0 0 1 0 1 0]
[1 0 0 0 0 0 0 0 0 0 1]
[0 1 0 0 0 0 0 0 0 0 1]
[0 0 1 1 1 0 0 0 0 0 1]
[1 0 1 1 0 0 0 0 0 0 1]
[0 1 1 0 1 0 0 0 0 0 1]
[0 0 1 0 0 1 1 1 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1  1 -1  1  1  1 -1 -1  1  1 -1]
[ 1  1 -1  1  1 -1  1 -1  1  1 -1]
[-1 -1  1 -1 -1 -1 -1 -1  1  1  1]
[ 1  1 -1  1  1 -1  1  1  1 -1 -1]
[ 1  1 -1  1  1  1 -1  1 -1  1 -1]
[ 1 -1 -1 -1  1  1  1  1 -1 -1  1]
[-1  1 -1  1 -1  1  1  1 -1 -1  1]
[-1 -1 -1  1  1  1  1  1 -1 -1  1]
[ 1  1  1  1 -1 -1 -1 -1  1  1 -1]
[ 1  1  1 -1  1 -1 -1 -1  1  1 -1]
[-1 -1  1 -1 -1  1  1  1 -1 -1  1]

======================================

     vertices:  11
        edges:  17
automorphisms:  1
graph6-string:  J?AEB?oyFw?

Adjacency matrix:
[0 0 0 0 0 1 1 0 0 1 1]
[0 0 0 0 0 0 1 1 0 1 1]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 0 1 0 1]
[0 0 0 0 0 0 0 0 0 1 1]
[1 0 0 0 0 0 0 0 0 0 1]
[1 1 0 0 0 0 0 0 0 0 0]
[0 1 1 0 0 0 0 0 0 0 0]
[0 0 1 1 0 0 0 0 0 0 0]
[1 1 1 0 1 0 0 0 0 0 0]
[1 1 1 1 1 1 0 0 0 0 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1  1 -1 -1  1  1 -1  1  1 -1]
[-1  1 -1  1  1 -1  1  1 -1 -1  1]
[ 1 -1  1 -1 -1  1 -1  1  1  1 -1]
[-1  1 -1  1  1 -1  1 -1  1 -1  1]
[-1  1 -1  1  1 -1 -1 -1 -1  1  1]
[ 1 -1  1 -1 -1  1 -1  1 -1 -1  1]
[ 1  1 -1  1 -1 -1  1 -1  1  1 -1]
[-1  1  1 -1 -1  1 -1  1 -1 -1  1]
[ 1 -1  1  1 -1 -1  1 -1  1  1 -1]
[ 1 -1  1 -1  1 -1  1 -1  1  1 -1]
[-1  1 -1  1  1  1 -1  1 -1 -1  1]

======================================

     vertices:  11
        edges:  17
automorphisms:  1
graph6-string:  J?AEB?oYb{?

Adjacency matrix:
[0 0 0 0 0 1 1 0 0 0 0]
[0 0 0 0 0 0 1 1 0 1 1]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 0 1 0 1]
[0 0 0 0 0 0 0 0 0 1 1]
[1 0 0 0 0 0 0 0 0 0 1]
[1 1 0 0 0 0 0 0 0 1 1]
[0 1 1 0 0 0 0 0 0 0 0]
[0 0 1 1 0 0 0 0 0 0 0]
[0 1 1 0 1 0 1 0 0 0 0]
[0 1 1 1 1 1 1 0 0 0 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1  1 -1 -1  1  1 -1  1  1 -1]
[-1  1 -1  1 -1 -1  1  1 -1 -1  1]
[ 1 -1  1 -1  1  1 -1  1  1  1 -1]
[-1  1 -1  1 -1 -1  1 -1  1 -1  1]
[-1 -1  1 -1  1  1 -1 -1 -1  1  1]
[ 1 -1  1 -1  1  1 -1  1 -1 -1  1]
[ 1  1 -1  1 -1 -1  1 -1  1  1 -1]
[-1  1  1 -1 -1  1 -1  1 -1 -1  1]
[ 1 -1  1  1 -1 -1  1 -1  1  1 -1]
[ 1 -1  1 -1  1 -1  1 -1  1  1 -1]
[-1  1 -1  1  1  1 -1  1 -1 -1  1]

======================================

     vertices:  11
        edges:  17
automorphisms:  1
graph6-string:  J?AEB?oas}?

Adjacency matrix:
[0 0 0 0 0 1 1 0 0 1 1]
[0 0 0 0 0 0 1 1 0 0 0]
[0 0 0 0 0 0 0 1 1 0 0]
[0 0 0 0 0 0 0 0 1 0 1]
[0 0 0 0 0 0 0 0 0 1 1]
[1 0 0 0 0 0 0 0 0 0 1]
[1 1 0 0 0 0 0 0 0 1 1]
[0 1 1 0 0 0 0 0 0 1 1]
[0 0 1 1 0 0 0 0 0 0 0]
[1 0 0 0 1 0 1 1 0 0 0]
[1 0 0 1 1 1 1 1 0 0 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1  1 -1 -1  1  1 -1  1  1 -1]
[-1  1 -1  1 -1 -1  1  1 -1 -1  1]
[ 1 -1  1 -1 -1  1 -1  1  1  1 -1]
[-1  1 -1  1  1 -1  1 -1  1 -1  1]
[-1 -1 -1  1  1 -1 -1  1 -1  1  1]
[ 1 -1  1 -1 -1  1 -1  1 -1 -1  1]
[ 1  1 -1  1 -1 -1  1 -1  1  1 -1]
[-1  1  1 -1  1  1 -1  1 -1 -1  1]
[ 1 -1  1  1 -1 -1  1 -1  1  1 -1]
[ 1 -1  1 -1  1 -1  1 -1  1  1 -1]
[-1  1 -1  1  1  1 -1  1 -1 -1  1]

======================================

     vertices:  11
        edges:  17
automorphisms:  2
graph6-string:  J?AE@poJ`F?

Adjacency matrix:
[0 0 0 0 0 1 1 0 0 0 0]
[0 0 0 0 0 0 1 0 1 0 0]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 1 1 0 0]
[0 0 0 0 0 0 0 1 0 1 0]
[1 0 0 0 0 0 0 0 0 1 0]
[1 1 0 0 0 0 0 0 0 1 1]
[0 0 1 1 1 0 0 0 0 0 1]
[0 1 1 1 0 0 0 0 0 0 1]
[0 0 1 0 1 1 1 0 0 0 0]
[0 0 1 0 0 0 1 1 1 0 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1 -1  1 -1  1  1  1 -1 -1  1]
[-1  1 -1  1  1 -1  1 -1  1  1 -1]
[-1 -1  1 -1 -1  1 -1 -1  1  1  1]
[ 1  1 -1  1  1  1 -1  1  1 -1 -1]
[-1  1 -1  1  1 -1  1  1 -1  1 -1]
[ 1 -1  1  1 -1  1 -1 -1  1  1 -1]
[ 1  1 -1 -1  1 -1  1  1 -1 -1  1]
[ 1 -1 -1  1  1 -1  1  1 -1 -1  1]
[-1  1  1  1 -1  1 -1 -1  1  1 -1]
[-1  1  1 -1  1  1 -1 -1  1  1 -1]
[ 1 -1  1 -1 -1 -1  1  1 -1 -1  1]

======================================

     vertices:  11
        edges:  17
automorphisms:  1
graph6-string:  J?ABAaI[A\_

Adjacency matrix:
[0 0 0 0 0 1 0 0 1 0 0]
[0 0 0 0 0 0 1 1 0 1 1]
[0 0 0 0 0 0 1 0 0 1 0]
[0 0 0 0 0 0 0 1 0 1 0]
[0 0 0 0 0 0 0 0 1 0 1]
[1 0 0 0 0 0 0 0 0 0 1]
[0 1 1 0 0 0 0 0 1 0 1]
[0 1 0 1 0 0 0 0 0 0 0]
[1 0 0 0 1 0 1 0 0 0 1]
[0 1 1 1 0 0 0 0 0 0 1]
[0 1 0 0 1 1 1 0 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1  1  1 -1  1  1  1  1 -1 -1]
[-1  1 -1 -1 -1  1  1  1 -1 -1  1]
[ 1 -1  1  1 -1 -1  1 -1  1  1 -1]
[ 1 -1  1  1  1 -1 -1  1  1  1 -1]
[-1 -1 -1  1  1 -1 -1 -1  1  1  1]
[ 1  1 -1 -1 -1  1 -1 -1 -1  1  1]
[ 1  1  1 -1 -1 -1  1  1  1 -1 -1]
[ 1  1 -1  1 -1 -1  1  1  1 -1 -1]
[ 1 -1  1  1  1 -1  1  1  1 -1 -1]
[-1 -1  1  1  1  1 -1 -1 -1  1  1]
[-1  1 -1 -1  1  1 -1 -1 -1  1  1]

======================================

     vertices:  11
        edges:  17
automorphisms:  1
graph6-string:  J?ABAbgjF_?

Adjacency matrix:
[0 0 0 0 0 1 0 0 1 1 1]
[0 0 0 0 0 0 1 1 1 0 1]
[0 0 0 0 0 0 1 0 1 1 1]
[0 0 0 0 0 0 0 1 0 0 1]
[0 0 0 0 0 0 0 0 1 1 0]
[1 0 0 0 0 0 0 0 0 1 0]
[0 1 1 0 0 0 0 0 0 0 0]
[0 1 0 1 0 0 0 0 0 0 0]
[1 1 1 0 1 0 0 0 0 0 0]
[1 0 1 0 1 1 0 0 0 0 0]
[1 1 1 1 0 0 0 0 0 0 0]

(2x)Inverse of the Adjacency matrix:
[ 1  1 -1 -1 -1  1 -1 -1  1 -1  1]
[ 1  1 -1 -1 -1  1  1  1  1 -1 -1]
[-1 -1  1  1  1 -1  1 -1 -1  1  1]
[-1 -1  1  1  1 -1 -1  1 -1  1  1]
[-1 -1  1  1  1 -1 -1  1  1  1 -1]
[ 1  1 -1 -1 -1  1  1  1 -1  1 -1]
[-1  1  1 -1 -1  1  1  1 -1  1 -1]
[-1  1 -1  1  1  1  1  1 -1  1 -1]
[ 1  1 -1 -1  1 -1 -1 -1  1 -1  1]
[-1 -1  1  1  1  1  1  1 -1  1 -1]
[ 1 -1  1  1 -1 -1 -1 -1  1 -1  1]

======================================

     vertices:  11
        edges:  17
automorphisms:  2
graph6-string:  J?AB?rO[Ax_

Adjacency matrix:
[0 0 0 0 0 1 0 0 1 0 0]
[0 0 0 0 0 0 1 0 1 1 1]
[0 0 0 0 0 0 1 0 0 1 0]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 1 0 0 1]
[1 0 0 0 0 0 0 0 0 0 1]
[0 1 1 0 0 0 0 0 0 0 0]
[0 0 0 1 1 0 0 0 0 0 0]
[1 1 0 1 0 0 0 0 0 0 1]
[0 1 1 1 0 0 0 0 0 0 1]
[0 1 0 1 1 1 0 0 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1  1  1 -1  1  1  1  1 -1 -1]
[-1  1 -1 -1  1 -1  1 -1  1 -1  1]
[ 1 -1  1  1 -1  1  1  1 -1  1 -1]
[ 1 -1  1  1 -1 -1 -1  1  1  1 -1]
[-1  1 -1 -1  1  1  1  1 -1 -1  1]
[ 1 -1  1 -1  1  1 -1 -1 -1  1  1]
[ 1  1  1 -1  1 -1  1  1  1 -1 -1]
[ 1 -1  1  1  1 -1  1  1  1 -1 -1]
[ 1  1 -1  1 -1 -1  1  1  1 -1 -1]
[-1 -1  1  1 -1  1 -1 -1 -1  1  1]
[-1  1 -1 -1  1  1 -1 -1 -1  1  1]

======================================

     vertices:  11
        edges:  17
automorphisms:  4
graph6-string:  J?AB?rS{Eo?

Adjacency matrix:
[0 0 0 0 0 1 0 0 1 1 1]
[0 0 0 0 0 0 1 0 1 1 1]
[0 0 0 0 0 0 1 0 0 1 0]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 1 0 0 1]
[1 0 0 0 0 0 0 0 1 0 0]
[0 1 1 0 0 0 0 0 0 0 0]
[0 0 0 1 1 0 0 0 0 0 0]
[1 1 0 1 0 1 0 0 0 0 0]
[1 1 1 1 0 0 0 0 0 0 0]
[1 1 0 1 1 0 0 0 0 0 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1  1 -1  1  1 -1 -1 -1  1  1]
[-1  1 -1  1 -1 -1  1 -1  1 -1  1]
[ 1 -1  1 -1  1  1  1  1 -1  1 -1]
[-1  1 -1  1 -1 -1 -1  1  1  1 -1]
[ 1 -1  1 -1  1  1  1  1 -1 -1  1]
[ 1 -1  1 -1  1  1  1  1  1 -1 -1]
[-1  1  1 -1  1  1  1  1  1 -1 -1]
[-1 -1  1  1  1  1  1  1  1 -1 -1]
[-1  1 -1  1 -1  1  1  1  1 -1 -1]
[ 1 -1  1  1 -1 -1 -1 -1 -1  1  1]
[ 1  1 -1 -1  1 -1 -1 -1 -1  1  1]

======================================

     vertices:  11
        edges:  17
automorphisms:  1
graph6-string:  J?BD?pW{E`?

Adjacency matrix:
[0 0 0 0 0 1 1 0 0 1 1]
[0 0 0 0 0 1 0 0 1 1 1]
[0 0 0 0 0 0 1 0 0 1 0]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 1 1 0 0]
[1 1 0 0 0 0 0 0 0 0 0]
[1 0 1 0 0 0 0 0 0 0 0]
[0 0 0 1 1 0 0 0 0 0 0]
[0 1 0 1 1 0 0 0 0 0 1]
[1 1 1 1 0 0 0 0 0 0 0]
[1 1 0 1 0 0 0 0 1 0 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1 -1  1 -1  1  1  1 -1 -1  1]
[-1  1  1 -1  1  1 -1 -1  1  1 -1]
[-1  1  1 -1  1 -1  1 -1  1  1 -1]
[ 1 -1 -1  1 -1 -1 -1  1 -1  1  1]
[-1  1  1 -1  1  1  1  1  1 -1 -1]
[ 1  1 -1 -1  1  1 -1  1 -1  1 -1]
[ 1 -1  1 -1  1 -1  1 -1  1 -1  1]
[ 1 -1 -1  1  1  1 -1  1 -1  1 -1]
[-1  1  1 -1  1 -1  1 -1  1 -1  1]
[-1  1  1  1 -1  1 -1  1 -1  1 -1]
[ 1 -1 -1  1 -1 -1  1 -1  1 -1  1]

======================================

     vertices:  11
        edges:  17
automorphisms:  1
graph6-string:  J?BD?pWL_l?

Adjacency matrix:
[0 0 0 0 0 1 1 0 0 0 0]
[0 0 0 0 0 1 0 0 1 0 0]
[0 0 0 0 0 0 1 0 0 1 0]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 1 1 0 0]
[1 1 0 0 0 0 0 0 0 1 1]
[1 0 1 0 0 0 0 0 0 1 1]
[0 0 0 1 1 0 0 0 0 0 0]
[0 1 0 1 1 0 0 0 0 0 1]
[0 0 1 1 0 1 1 0 0 0 0]
[0 0 0 1 0 1 1 0 1 0 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1 -1 -1  1  1  1  1 -1 -1  1]
[-1  1  1 -1  1  1 -1 -1  1  1 -1]
[-1  1  1 -1  1 -1  1 -1  1  1 -1]
[-1 -1 -1  1 -1  1 -1  1 -1  1  1]
[ 1  1  1 -1  1 -1  1  1  1 -1 -1]
[ 1  1 -1  1 -1  1 -1  1 -1  1 -1]
[ 1 -1  1 -1  1 -1  1 -1  1 -1  1]
[ 1 -1 -1  1  1  1 -1  1 -1  1 -1]
[-1  1  1 -1  1 -1  1 -1  1 -1  1]
[-1  1  1  1 -1  1 -1  1 -1  1 -1]
[ 1 -1 -1  1 -1 -1  1 -1  1 -1  1]

======================================

     vertices:  11
        edges:  17
automorphisms:  2
graph6-string:  J?`@CbOISN_

Adjacency matrix:
[0 0 0 0 1 0 0 1 1 0 1]
[0 0 0 0 0 1 0 0 1 0 0]
[0 0 0 0 0 0 1 0 0 1 0]
[0 0 0 0 0 0 0 1 1 0 0]
[1 0 0 0 0 0 0 0 0 1 0]
[0 1 0 0 0 0 0 0 0 0 1]
[0 0 1 0 0 0 0 0 0 0 1]
[1 0 0 1 0 0 0 0 0 1 1]
[1 1 0 1 0 0 0 0 0 0 1]
[0 0 1 0 1 0 0 1 0 0 1]
[1 0 0 0 0 1 1 1 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1 -1 -1  1 -1  1 -1  1 -1  1]
[-1  1  1  1  1  1 -1 -1  1  1 -1]
[-1  1  1  1  1 -1  1 -1  1  1 -1]
[-1  1  1  1 -1 -1 -1  1  1  1 -1]
[ 1  1  1 -1  1 -1 -1 -1  1  1 -1]
[-1  1 -1 -1 -1  1 -1  1 -1  1  1]
[ 1 -1  1 -1 -1 -1  1 -1  1 -1  1]
[-1 -1 -1  1 -1  1 -1  1 -1  1  1]
[ 1  1  1  1  1 -1  1 -1  1 -1 -1]
[-1  1  1  1  1  1 -1  1 -1  1 -1]
[ 1 -1 -1 -1 -1  1  1  1 -1 -1  1]

======================================

     vertices:  11
        edges:  19
automorphisms:  8
graph6-string:  J?AAFBO}?^_

Adjacency matrix:
[0 0 0 0 0 1 0 1 1 1 0]
[0 0 0 0 0 0 1 1 1 1 0]
[0 0 0 0 0 0 0 1 0 1 0]
[0 0 0 0 0 0 0 0 1 1 0]
[0 0 0 0 0 0 0 0 0 1 1]
[1 0 0 0 0 0 0 0 0 0 1]
[0 1 0 0 0 0 0 0 0 0 1]
[1 1 1 0 0 0 0 0 0 0 1]
[1 1 0 1 0 0 0 0 0 0 1]
[1 1 1 1 1 0 0 0 0 0 1]
[0 0 0 0 1 1 1 1 1 1 0]

(2x)Inverse of the Adjacency matrix:
[-1 -1  1  1 -1  1 -1  1  1 -1  1]
[-1 -1  1  1 -1 -1  1  1  1 -1  1]
[ 1  1 -1 -1  1 -1 -1  1 -1  1 -1]
[ 1  1 -1 -1  1 -1 -1 -1  1  1 -1]
[-1 -1  1  1 -1  1  1 -1 -1  1  1]
[ 1 -1 -1 -1  1 -1 -1  1  1 -1  1]
[-1  1 -1 -1  1 -1 -1  1  1 -1  1]
[ 1  1  1 -1 -1  1  1 -1 -1  1 -1]
[ 1  1 -1  1 -1  1  1 -1 -1  1 -1]
[-1 -1  1  1  1 -1 -1  1  1 -1  1]
[ 1  1 -1 -1  1  1  1 -1 -1  1 -1]

======================================

     vertices:  11
        edges:  19
automorphisms:  1
graph6-string:  J?AAF@Sa~o_

Adjacency matrix:
[0 0 0 0 0 1 0 1 0 1 1]
[0 0 0 0 0 0 1 1 1 0 1]
[0 0 0 0 0 0 0 1 0 0 1]
[0 0 0 0 0 0 0 0 1 0 1]
[0 0 0 0 0 0 0 0 0 1 1]
[1 0 0 0 0 0 0 0 1 0 0]
[0 1 0 0 0 0 0 0 0 1 0]
[1 1 1 0 0 0 0 0 0 1 0]
[0 1 0 1 0 1 0 0 0 1 0]
[1 0 0 0 1 0 1 1 1 0 1]
[1 1 1 1 1 0 0 0 0 1 0]

(2x)Inverse of the Adjacency matrix:
[-1 -1  1 -1  1  1 -1  1  1  1 -1]
[-1 -1  1  1 -1 -1  1  1  1  1 -1]
[ 1  1 -1  1 -1 -1 -1  1 -1 -1  1]
[-1  1  1 -1  1  1 -1 -1  1 -1  1]
[ 1 -1 -1  1 -1 -1  1 -1 -1  1  1]
[ 1 -1 -1  1 -1 -1 -1  1  1  1 -1]
[-1  1 -1 -1  1 -1 -1  1  1  1 -1]
[ 1  1  1 -1 -1  1  1 -1 -1 -1  1]
[ 1  1 -1  1 -1  1  1 -1 -1 -1  1]
[ 1  1 -1 -1  1  1  1 -1 -1 -1  1]
[-1 -1  1  1  1 -1 -1  1  1  1 -1]

======================================

     vertices:  11
        edges:  19
automorphisms:  1
graph6-string:  J?AEBBoJfs?

Adjacency matrix:
[0 0 0 0 0 1 1 0 1 0 1]
[0 0 0 0 0 0 1 1 1 0 1]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 0 1 0 1]
[0 0 0 0 0 0 0 0 0 1 1]
[1 0 0 0 0 0 0 0 0 1 0]
[1 1 0 0 0 0 0 0 0 1 1]
[0 1 1 0 0 0 0 0 0 0 0]
[1 1 1 1 0 0 0 0 0 0 0]
[0 0 1 0 1 1 1 0 0 0 0]
[1 1 1 1 1 0 1 0 0 0 0]

(2x)Inverse of the Adjacency matrix:
[-1  1 -1  1 -1  1  1 -1  1  1 -1]
[ 1 -1  1 -1 -1 -1  1  1 -1 -1  1]
[-1  1 -1  1  1  1 -1  1  1  1 -1]
[ 1 -1  1 -1  1 -1 -1 -1  1 -1  1]
[-1 -1  1  1 -1 -1  1 -1 -1  1  1]
[ 1 -1  1 -1 -1 -1  1 -1  1  1 -1]
[ 1  1 -1 -1  1  1 -1  1 -1 -1  1]
[-1  1  1 -1 -1 -1  1 -1  1  1 -1]
[ 1 -1  1  1 -1  1 -1  1 -1 -1  1]
[ 1 -1  1 -1  1  1 -1  1 -1 -1  1]
[-1  1 -1  1  1 -1  1 -1  1  1 -1]

======================================

     vertices:  11
        edges:  19
automorphisms:  2
graph6-string:  J?AEB@sJb{?

Adjacency matrix:
[0 0 0 0 0 1 1 0 0 0 0]
[0 0 0 0 0 0 1 1 1 0 1]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 0 1 0 1]
[0 0 0 0 0 0 0 0 0 1 1]
[1 0 0 0 0 0 0 0 1 1 1]
[1 1 0 0 0 0 0 0 0 1 1]
[0 1 1 0 0 0 0 0 0 0 0]
[0 1 1 1 0 1 0 0 0 0 0]
[0 0 1 0 1 1 1 0 0 0 0]
[0 1 1 1 1 1 1 0 0 0 0]

(2x)Inverse of the Adjacency matrix:
[-1  1 -1 -1 -1  1  1 -1  1  1 -1]
[ 1 -1  1  1 -1 -1  1  1 -1 -1  1]
[-1  1 -1 -1  1  1 -1  1  1  1 -1]
[-1  1 -1 -1  1  1 -1 -1  1 -1  1]
[-1 -1  1  1 -1 -1  1 -1 -1  1  1]
[ 1 -1  1  1 -1 -1  1 -1  1  1 -1]
[ 1  1 -1 -1  1  1 -1  1 -1 -1  1]
[-1  1  1 -1 -1 -1  1 -1  1  1 -1]
[ 1 -1  1  1 -1  1 -1  1 -1 -1  1]
[ 1 -1  1 -1  1  1 -1  1 -1 -1  1]
[-1  1 -1  1  1 -1  1 -1  1  1 -1]

======================================

     vertices:  11
        edges:  19
automorphisms:  2
graph6-string:  J?ABA_Yubh_

Adjacency matrix:
[0 0 0 0 0 1 0 0 0 1 0]
[0 0 0 0 0 0 1 1 0 1 1]
[0 0 0 0 0 0 1 0 0 0 1]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 0 1 1 0]
[1 0 0 0 0 0 0 0 0 0 1]
[0 1 1 0 0 0 0 0 1 1 0]
[0 1 0 1 0 0 0 0 0 0 0]
[0 0 0 1 1 0 1 0 0 0 1]
[1 1 0 1 1 0 1 0 0 0 1]
[0 1 1 1 0 1 0 0 1 1 0]

(2x)Inverse of the Adjacency matrix:
[-1  1 -1 -1  1  1 -1 -1 -1  1  1]
[ 1 -1  1  1 -1 -1  1  1 -1  1 -1]
[-1  1 -1 -1 -1  1  1 -1  1 -1  1]
[-1  1 -1 -1  1  1 -1  1  1 -1  1]
[ 1 -1 -1  1 -1 -1  1 -1  1  1 -1]
[ 1 -1  1  1 -1 -1 -1 -1 -1  1  1]
[-1  1  1 -1  1 -1 -1 -1 -1  1  1]
[-1  1 -1  1 -1 -1 -1 -1 -1  1  1]
[-1 -1  1  1  1 -1 -1 -1 -1  1  1]
[ 1  1 -1 -1  1  1  1  1  1 -1 -1]
[ 1 -1  1  1 -1  1  1  1  1 -1 -1]

======================================

     vertices:  11
        edges:  19
automorphisms:  1
graph6-string:  J?BD?oslFp?

Adjacency matrix:
[0 0 0 0 0 1 1 0 0 1 1]
[0 0 0 0 0 1 0 0 0 0 1]
[0 0 0 0 0 0 1 0 1 1 1]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 1 0 0 1]
[1 1 0 0 0 0 0 0 1 1 0]
[1 0 1 0 0 0 0 0 0 0 0]
[0 0 0 1 1 0 0 0 0 0 0]
[0 0 1 1 0 1 0 0 0 0 1]
[1 0 1 1 0 1 0 0 0 0 0]
[1 1 1 1 1 0 0 0 1 0 0]

(2x)Inverse of the Adjacency matrix:
[-1  1  1 -1  1  1  1  1 -1  1 -1]
[ 1 -1 -1 -1  1  1 -1 -1  1 -1  1]
[ 1 -1 -1  1 -1 -1  1 -1  1 -1  1]
[-1 -1  1 -1  1  1 -1  1  1  1 -1]
[ 1  1 -1  1 -1 -1  1  1 -1 -1  1]
[ 1  1 -1  1 -1 -1 -1 -1 -1  1  1]
[ 1 -1  1 -1  1 -1 -1 -1 -1  1  1]
[ 1 -1 -1  1  1 -1 -1 -1 -1  1  1]
[-1  1  1  1 -1 -1 -1 -1 -1  1  1]
[ 1 -1 -1  1 -1  1  1  1  1 -1 -1]
[-1  1  1 -1  1  1  1  1  1 -1 -1]

======================================

     vertices:  11
        edges:  19
automorphisms:  2
graph6-string:  J?B@eQwj@Y?

Adjacency matrix:
[0 0 0 0 0 1 0 1 1 1 0]
[0 0 0 0 0 1 0 1 0 0 0]
[0 0 0 0 0 0 1 0 1 1 1]
[0 0 0 0 0 0 1 0 1 0 0]
[0 0 0 0 0 0 0 1 1 1 1]
[1 1 0 0 0 0 0 0 0 1 1]
[0 0 1 1 0 0 0 0 0 0 0]
[1 1 0 0 1 0 0 0 0 0 1]
[1 0 1 1 1 0 0 0 0 0 0]
[1 0 1 0 1 1 0 0 0 0 0]
[0 0 1 0 1 1 0 1 0 0 0]

(2x)Inverse of the Adjacency matrix:
[-1  1 -1  1  1  1 -1 -1  1  1 -1]
[ 1 -1 -1  1 -1  1  1  1 -1 -1  1]
[-1 -1 -1  1  1  1  1 -1 -1  1  1]
[ 1  1  1 -1 -1 -1  1  1  1 -1 -1]
[ 1 -1  1 -1 -1 -1 -1  1  1 -1  1]
[ 1  1  1 -1 -1 -1  1  1 -1  1 -1]
[-1  1  1  1 -1  1 -1 -1  1 -1  1]
[-1  1 -1  1  1  1 -1 -1  1 -1  1]
[ 1 -1 -1  1  1 -1  1  1 -1  1 -1]
[ 1 -1  1 -1 -1  1 -1 -1  1 -1  1]
[-1  1  1 -1  1 -1  1  1 -1  1 -1]

======================================

     vertices:  11
        edges:  21
automorphisms:  2
graph6-string:  J?AADBoR]v_

Adjacency matrix:
[0 0 0 0 0 1 0 1 1 0 1]
[0 0 0 0 0 0 1 0 1 1 1]
[0 0 0 0 0 0 0 1 1 0 0]
[0 0 0 0 0 0 0 0 1 0 1]
[0 0 0 0 0 0 0 0 0 1 1]
[1 0 0 0 0 0 0 0 0 1 0]
[0 1 0 0 0 0 0 0 0 0 1]
[1 0 1 0 0 0 0 0 0 1 1]
[1 1 1 1 0 0 0 0 0 1 1]
[0 1 0 0 1 1 0 1 1 0 1]
[1 1 0 1 1 0 1 1 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1 -1  1 -1  1  1  1 -1 -1  1]
[-1  1  1 -1 -1  1  1 -1  1  1 -1]
[-1  1  1 -1 -1 -1 -1  1  1  1 -1]
[ 1 -1 -1  1  1 -1 -1 -1  1 -1  1]
[-1 -1 -1  1  1 -1 -1  1 -1  1  1]
[ 1  1 -1 -1 -1  1 -1 -1  1  1 -1]
[ 1  1 -1 -1 -1 -1  1  1 -1 -1  1]
[ 1 -1  1 -1  1 -1  1  1 -1 -1  1]
[-1  1  1  1 -1  1 -1 -1  1  1 -1]
[-1  1  1 -1  1  1 -1 -1  1  1 -1]
[ 1 -1 -1  1  1 -1  1  1 -1 -1  1]

======================================

     vertices:  11
        edges:  21
automorphisms:  1
graph6-string:  J?AADAsZT}_

Adjacency matrix:
[0 0 0 0 0 1 0 1 1 0 1]
[0 0 0 0 0 0 1 0 0 1 0]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 0 1 0 1]
[0 0 0 0 0 0 0 0 0 1 1]
[1 0 0 0 0 0 0 0 1 1 1]
[0 1 0 0 0 0 0 0 0 0 1]
[1 0 1 0 0 0 0 0 0 1 1]
[1 0 1 1 0 1 0 0 0 0 0]
[0 1 1 0 1 1 0 1 0 0 1]
[1 0 1 1 1 1 1 1 0 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1 -1 -1 -1  1  1  1 -1 -1  1]
[-1  1  1 -1 -1  1  1 -1  1  1 -1]
[-1  1  1  1 -1 -1 -1  1  1  1 -1]
[-1 -1  1  1  1 -1  1 -1  1 -1  1]
[-1 -1 -1  1  1  1 -1 -1 -1  1  1]
[ 1  1 -1 -1  1  1 -1 -1  1  1 -1]
[ 1  1 -1  1 -1 -1  1  1 -1 -1  1]
[ 1 -1  1 -1 -1 -1  1  1 -1 -1  1]
[-1  1  1  1 -1  1 -1 -1  1  1 -1]
[-1  1  1 -1  1  1 -1 -1  1  1 -1]
[ 1 -1 -1  1  1 -1  1  1 -1 -1  1]

======================================

     vertices:  11
        edges:  21
automorphisms:  1
graph6-string:  J?AADAsR[~_

Adjacency matrix:
[0 0 0 0 0 1 0 1 1 0 1]
[0 0 0 0 0 0 1 0 0 1 0]
[0 0 0 0 0 0 0 1 1 0 0]
[0 0 0 0 0 0 0 0 1 0 1]
[0 0 0 0 0 0 0 0 0 1 1]
[1 0 0 0 0 0 0 0 1 1 1]
[0 1 0 0 0 0 0 0 0 0 1]
[1 0 1 0 0 0 0 0 0 1 1]
[1 0 1 1 0 1 0 0 0 1 1]
[0 1 0 0 1 1 0 1 1 0 1]
[1 0 0 1 1 1 1 1 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1 -1 -1 -1  1  1  1 -1 -1  1]
[-1  1  1 -1 -1  1  1 -1  1  1 -1]
[-1  1  1  1 -1 -1 -1  1  1  1 -1]
[-1 -1  1  1  1 -1  1 -1  1 -1  1]
[-1 -1 -1  1  1 -1 -1  1 -1  1  1]
[ 1  1 -1 -1 -1  1 -1 -1  1  1 -1]
[ 1  1 -1  1 -1 -1  1  1 -1 -1  1]
[ 1 -1  1 -1  1 -1  1  1 -1 -1  1]
[-1  1  1  1 -1  1 -1 -1  1  1 -1]
[-1  1  1 -1  1  1 -1 -1  1  1 -1]
[ 1 -1 -1  1  1 -1  1  1 -1 -1  1]

======================================

     vertices:  11
        edges:  21
automorphisms:  1
graph6-string:  J?AAFAs~B]?

Adjacency matrix:
[0 0 0 0 0 1 0 1 1 1 0]
[0 0 0 0 0 0 1 1 0 1 1]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 0 1 1 0]
[0 0 0 0 0 0 0 0 0 1 1]
[1 0 0 0 0 0 0 0 1 1 1]
[0 1 0 0 0 0 0 0 0 0 1]
[1 1 1 0 0 0 0 0 0 0 1]
[1 0 1 1 0 1 0 0 0 0 0]
[1 1 1 1 1 1 0 0 0 0 0]
[0 1 1 0 1 1 1 1 0 0 0]

(2x)Inverse of the Adjacency matrix:
[ 1  1 -1 -1 -1  1 -1  1 -1  1 -1]
[ 1  1 -1  1 -1 -1  1  1 -1  1 -1]
[-1 -1  1  1  1 -1 -1  1  1 -1  1]
[-1  1  1  1 -1 -1  1 -1  1  1 -1]
[-1 -1  1 -1  1  1 -1 -1 -1  1  1]
[ 1 -1 -1 -1  1  1  1 -1  1 -1  1]
[-1  1 -1  1 -1  1  1 -1  1 -1  1]
[ 1  1  1 -1 -1 -1 -1  1 -1  1 -1]
[-1 -1  1  1 -1  1  1 -1  1 -1  1]
[ 1  1 -1  1  1 -1 -1  1 -1  1 -1]
[-1 -1  1 -1  1  1  1 -1  1 -1  1]

======================================

     vertices:  11
        edges:  21
automorphisms:  1
graph6-string:  J?AAFBw|@V_

Adjacency matrix:
[0 0 0 0 0 1 0 1 1 1 0]
[0 0 0 0 0 0 1 1 1 1 0]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 0 1 1 0]
[0 0 0 0 0 0 0 0 1 0 1]
[1 0 0 0 0 0 0 0 0 1 0]
[0 1 0 0 0 0 0 0 0 0 1]
[1 1 1 0 0 0 0 0 0 0 1]
[1 1 1 1 1 0 0 0 0 0 1]
[1 1 1 1 0 1 0 0 0 0 1]
[0 0 1 0 1 0 1 1 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1  1 -1 -1  1  1 -1  1  1 -1 -1]
[ 1  1 -1  1 -1 -1  1  1  1 -1 -1]
[-1 -1  1  1 -1 -1 -1  1 -1  1  1]
[-1  1  1  1 -1 -1 -1 -1  1  1 -1]
[ 1 -1 -1 -1  1  1  1 -1  1 -1  1]
[ 1 -1 -1 -1  1  1  1 -1 -1  1  1]
[-1  1 -1 -1  1  1  1 -1 -1  1  1]
[ 1  1  1 -1 -1 -1 -1  1  1 -1 -1]
[ 1  1 -1  1  1 -1 -1  1  1 -1 -1]
[-1 -1  1  1 -1  1  1 -1 -1  1  1]
[-1 -1  1 -1  1  1  1 -1 -1  1  1]

======================================

     vertices:  11
        edges:  21
automorphisms:  1
graph6-string:  J?AAFB[|?^_

Adjacency matrix:
[0 0 0 0 0 1 0 1 1 1 0]
[0 0 0 0 0 0 1 1 1 1 0]
[0 0 0 0 0 0 0 1 0 1 0]
[0 0 0 0 0 0 0 0 1 1 0]
[0 0 0 0 0 0 0 0 1 0 1]
[1 0 0 0 0 0 0 0 1 1 1]
[0 1 0 0 0 0 0 0 0 0 1]
[1 1 1 0 0 0 0 0 0 0 1]
[1 1 0 1 1 1 0 0 0 0 1]
[1 1 1 1 0 1 0 0 0 0 1]
[0 0 0 0 1 1 1 1 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1  1 -1 -1 -1  1 -1  1  1 -1 -1]
[ 1  1 -1  1 -1 -1  1  1  1 -1 -1]
[-1 -1  1  1  1 -1 -1  1 -1  1  1]
[-1  1  1  1  1 -1 -1 -1  1  1 -1]
[-1 -1  1  1  1 -1 -1  1  1 -1  1]
[ 1 -1 -1 -1 -1  1  1 -1 -1  1  1]
[-1  1 -1 -1 -1  1  1 -1 -1  1  1]
[ 1  1  1 -1  1 -1 -1  1  1 -1 -1]
[ 1  1 -1  1  1 -1 -1  1  1 -1 -1]
[-1 -1  1  1 -1  1  1 -1 -1  1  1]
[-1 -1  1 -1  1  1  1 -1 -1  1  1]

======================================

     vertices:  11
        edges:  21
automorphisms:  2
graph6-string:  J?AAF@tVO^_

Adjacency matrix:
[0 0 0 0 0 1 0 1 0 0 0]
[0 0 0 0 0 0 1 1 1 1 0]
[0 0 0 0 0 0 0 1 1 0 0]
[0 0 0 0 0 0 0 0 1 1 0]
[0 0 0 0 0 0 0 0 0 1 1]
[1 0 0 0 0 0 0 0 1 1 1]
[0 1 0 0 0 0 0 0 0 0 1]
[1 1 1 0 0 0 0 0 1 1 1]
[0 1 1 1 0 1 0 1 0 0 1]
[0 1 0 1 1 1 0 1 0 0 1]
[0 0 0 0 1 1 1 1 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1  1 -1 -1 -1  1 -1  1 -1  1 -1]
[ 1  1 -1  1 -1 -1  1  1 -1  1 -1]
[-1 -1  1 -1  1 -1 -1  1  1 -1  1]
[-1  1 -1  1 -1  1 -1 -1  1  1 -1]
[-1 -1  1 -1  1 -1 -1  1 -1  1  1]
[ 1 -1 -1  1 -1  1  1 -1  1 -1  1]
[-1  1 -1 -1 -1  1  1 -1  1 -1  1]
[ 1  1  1 -1  1 -1 -1  1 -1  1 -1]
[-1 -1  1  1 -1  1  1 -1  1 -1  1]
[ 1  1 -1  1  1 -1 -1  1 -1  1 -1]
[-1 -1  1 -1  1  1  1 -1  1 -1  1]

======================================

     vertices:  11
        edges:  21
automorphisms:  1
graph6-string:  J?AADb_}B^_

Adjacency matrix:
[0 0 0 0 0 1 0 1 1 1 0]
[0 0 0 0 0 0 1 0 1 1 1]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 1 0 1 0]
[0 0 0 0 0 0 0 0 0 1 1]
[1 0 0 0 0 0 0 0 0 0 1]
[0 1 0 0 0 0 0 0 0 0 1]
[1 0 1 1 0 0 0 0 0 0 1]
[1 1 1 0 0 0 0 0 0 0 1]
[1 1 1 1 1 0 0 0 0 0 1]
[0 1 1 0 1 1 1 1 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1  1 -1  1 -1  1 -1 -1  1  1 -1]
[ 1  1 -1  1 -1 -1  1 -1  1  1 -1]
[-1 -1  1 -1  1 -1 -1  1  1 -1  1]
[ 1  1 -1  1 -1 -1  1  1 -1  1 -1]
[-1 -1  1 -1  1  1 -1 -1 -1  1  1]
[ 1 -1 -1 -1  1  1  1  1 -1 -1  1]
[-1  1 -1  1 -1  1  1  1 -1 -1  1]
[-1 -1  1  1 -1  1  1  1 -1 -1  1]
[ 1  1  1 -1 -1 -1 -1 -1  1  1 -1]
[ 1  1 -1  1  1 -1 -1 -1  1  1 -1]
[-1 -1  1 -1  1  1  1  1 -1 -1  1]

======================================

     vertices:  11
        edges:  21
automorphisms:  1
graph6-string:  J?AADbwybJ_

Adjacency matrix:
[0 0 0 0 0 1 0 1 1 1 0]
[0 0 0 0 0 0 1 0 1 1 1]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 1 1 0 0]
[0 0 0 0 0 0 0 0 1 1 0]
[1 0 0 0 0 0 0 0 0 0 1]
[0 1 0 0 0 0 0 0 0 1 0]
[1 0 1 1 0 0 0 0 0 0 1]
[1 1 1 1 1 0 0 0 0 0 1]
[1 1 1 0 1 0 1 0 0 0 1]
[0 1 1 0 0 1 0 1 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1 -1  1  1  1  1  1 -1  1 -1]
[-1  1 -1  1 -1  1  1 -1  1 -1  1]
[-1 -1  1 -1  1 -1 -1  1 -1  1  1]
[ 1  1 -1  1 -1 -1  1  1  1 -1 -1]
[ 1 -1  1 -1  1 -1 -1 -1  1  1 -1]
[ 1  1 -1 -1 -1  1 -1 -1  1 -1  1]
[ 1  1 -1  1 -1 -1  1  1 -1  1 -1]
[ 1 -1  1  1 -1 -1  1  1 -1  1 -1]
[-1  1 -1  1  1  1 -1 -1  1 -1  1]
[ 1 -1  1 -1  1 -1  1  1 -1  1 -1]
[-1  1  1 -1 -1  1 -1 -1  1 -1  1]

======================================

     vertices:  11
        edges:  21
automorphisms:  1
graph6-string:  J?AADa{z@N_

Adjacency matrix:
[0 0 0 0 0 1 0 1 1 1 0]
[0 0 0 0 0 0 1 0 0 1 0]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 1 1 0 0]
[0 0 0 0 0 0 0 0 1 1 0]
[1 0 0 0 0 0 0 0 1 1 1]
[0 1 0 0 0 0 0 0 0 0 1]
[1 0 1 1 0 0 0 0 0 0 1]
[1 0 1 1 1 1 0 0 0 0 1]
[1 1 1 0 1 1 0 0 0 0 1]
[0 0 1 0 0 1 1 1 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1  1 -1  1 -1  1 -1  1 -1  1 -1]
[ 1  1 -1  1  1 -1  1  1 -1  1 -1]
[-1 -1  1 -1  1 -1 -1  1 -1  1  1]
[ 1  1 -1  1  1 -1  1  1  1 -1 -1]
[-1  1  1  1  1 -1 -1 -1  1  1 -1]
[ 1 -1 -1 -1 -1  1  1 -1  1 -1  1]
[-1  1 -1  1 -1  1  1 -1  1 -1  1]
[ 1  1  1  1 -1 -1 -1  1 -1  1 -1]
[-1 -1 -1  1  1  1  1 -1  1 -1  1]
[ 1  1  1 -1  1 -1 -1  1 -1  1 -1]
[-1 -1  1 -1 -1  1  1 -1  1 -1  1]

======================================

     vertices:  11
        edges:  21
automorphisms:  1
graph6-string:  J?AAD_|ZPN_

Adjacency matrix:
[0 0 0 0 0 1 0 1 0 0 0]
[0 0 0 0 0 0 1 0 0 1 0]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 1 1 0 0]
[0 0 0 0 0 0 0 0 1 1 0]
[1 0 0 0 0 0 0 0 1 1 1]
[0 1 0 0 0 0 0 0 0 0 1]
[1 0 1 1 0 0 0 0 1 1 1]
[0 0 1 1 1 1 0 1 0 0 1]
[0 1 1 0 1 1 0 1 0 0 1]
[0 0 1 0 0 1 1 1 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1  1 -1  1 -1  1 -1  1 -1  1 -1]
[ 1  1 -1  1  1 -1  1  1 -1  1 -1]
[-1 -1  1 -1 -1 -1 -1  1 -1  1  1]
[ 1  1 -1  1  1 -1  1  1  1 -1 -1]
[-1  1 -1  1  1  1 -1 -1  1  1 -1]
[ 1 -1 -1 -1  1  1  1 -1  1 -1  1]
[-1  1 -1  1 -1  1  1 -1  1 -1  1]
[ 1  1  1  1 -1 -1 -1  1 -1  1 -1]
[-1 -1 -1  1  1  1  1 -1  1 -1  1]
[ 1  1  1 -1  1 -1 -1  1 -1  1 -1]
[-1 -1  1 -1 -1  1  1 -1  1 -1  1]

======================================

     vertices:  11
        edges:  21
automorphisms:  1
graph6-string:  J?AE@b_yb|_

Adjacency matrix:
[0 0 0 0 0 1 1 0 1 1 0]
[0 0 0 0 0 0 1 0 1 1 1]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 1 0 0 1]
[0 0 0 0 0 0 0 0 0 1 1]
[1 0 0 0 0 0 0 0 0 0 1]
[1 1 0 0 0 0 0 0 0 1 1]
[0 0 1 1 0 0 0 0 0 0 0]
[1 1 1 0 0 0 0 0 0 0 1]
[1 1 1 0 1 0 1 0 0 0 1]
[0 1 1 1 1 1 1 0 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1  1 -1 -1  1  1  1 -1  1 -1]
[-1  1 -1  1 -1 -1  1 -1  1 -1  1]
[ 1 -1  1 -1  1 -1 -1  1  1  1 -1]
[-1  1 -1  1 -1  1  1  1 -1 -1  1]
[-1 -1  1 -1  1  1 -1 -1 -1  1  1]
[ 1 -1 -1  1  1  1 -1 -1  1 -1  1]
[ 1  1 -1  1 -1 -1  1  1 -1  1 -1]
[ 1 -1  1  1 -1 -1  1  1 -1  1 -1]
[-1  1  1 -1 -1  1 -1 -1  1 -1  1]
[ 1 -1  1 -1  1 -1  1  1 -1  1 -1]
[-1  1 -1  1  1  1 -1 -1  1 -1  1]

======================================

     vertices:  11
        edges:  21
automorphisms:  1
graph6-string:  J?AE@b_yRz_

Adjacency matrix:
[0 0 0 0 0 1 1 0 1 1 0]
[0 0 0 0 0 0 1 0 1 1 1]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 1 0 0 1]
[0 0 0 0 0 0 0 0 0 1 1]
[1 0 0 0 0 0 0 0 0 0 1]
[1 1 0 0 0 0 0 0 0 0 0]
[0 0 1 1 0 0 0 0 0 1 1]
[1 1 1 0 0 0 0 0 0 0 1]
[1 1 1 0 1 0 0 1 0 0 1]
[0 1 1 1 1 1 0 1 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1  1 -1 -1  1  1  1 -1  1 -1]
[-1  1 -1  1  1 -1  1 -1  1 -1  1]
[ 1 -1  1 -1 -1 -1 -1  1  1  1 -1]
[-1  1 -1  1 -1  1  1  1 -1 -1  1]
[-1  1 -1 -1  1  1 -1 -1 -1  1  1]
[ 1 -1 -1  1  1  1 -1 -1  1 -1  1]
[ 1  1 -1  1 -1 -1  1  1 -1  1 -1]
[ 1 -1  1  1 -1 -1  1  1 -1  1 -1]
[-1  1  1 -1 -1  1 -1 -1  1 -1  1]
[ 1 -1  1 -1  1 -1  1  1 -1  1 -1]
[-1  1 -1  1  1  1 -1 -1  1 -1  1]

======================================

     vertices:  11
        edges:  21
automorphisms:  1
graph6-string:  J?AE@bc^f[?

Adjacency matrix:
[0 0 0 0 0 1 1 0 1 0 1]
[0 0 0 0 0 0 1 0 1 1 1]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 1 0 1 0]
[0 0 0 0 0 0 0 0 0 1 1]
[1 0 0 0 0 0 0 0 1 1 1]
[1 1 0 0 0 0 0 0 0 1 1]
[0 0 1 1 0 0 0 0 0 0 0]
[1 1 1 0 0 1 0 0 0 0 0]
[0 1 1 1 1 1 1 0 0 0 0]
[1 1 1 0 1 1 1 0 0 0 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1 -1  1 -1  1  1  1 -1 -1  1]
[-1  1  1 -1 -1 -1  1 -1  1  1 -1]
[-1  1  1 -1  1 -1 -1  1  1 -1  1]
[ 1 -1 -1  1 -1  1  1  1 -1  1 -1]
[-1 -1  1 -1  1  1 -1 -1 -1  1  1]
[ 1 -1 -1  1  1  1 -1 -1  1  1 -1]
[ 1  1 -1  1 -1 -1  1  1 -1 -1  1]
[ 1 -1  1  1 -1 -1  1  1 -1 -1  1]
[-1  1  1 -1 -1  1 -1 -1  1  1 -1]
[-1  1 -1  1  1  1 -1 -1  1  1 -1]
[ 1 -1  1 -1  1 -1  1  1 -1 -1  1]

======================================

     vertices:  11
        edges:  21
automorphisms:  1
graph6-string:  J?AE@bc^VY?

Adjacency matrix:
[0 0 0 0 0 1 1 0 1 0 1]
[0 0 0 0 0 0 1 0 1 1 1]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 1 0 1 0]
[0 0 0 0 0 0 0 0 0 1 1]
[1 0 0 0 0 0 0 0 1 1 1]
[1 1 0 0 0 0 0 0 0 0 0]
[0 0 1 1 0 0 0 0 0 1 1]
[1 1 1 0 0 1 0 0 0 0 0]
[0 1 1 1 1 1 0 1 0 0 0]
[1 1 1 0 1 1 0 1 0 0 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1 -1  1 -1  1  1  1 -1 -1  1]
[-1  1  1 -1  1 -1  1 -1  1  1 -1]
[-1  1  1 -1 -1 -1 -1  1  1 -1  1]
[ 1 -1 -1  1 -1  1  1  1 -1  1 -1]
[-1  1 -1 -1  1  1 -1 -1 -1  1  1]
[ 1 -1 -1  1  1  1 -1 -1  1  1 -1]
[ 1  1 -1  1 -1 -1  1  1 -1 -1  1]
[ 1 -1  1  1 -1 -1  1  1 -1 -1  1]
[-1  1  1 -1 -1  1 -1 -1  1  1 -1]
[-1  1 -1  1  1  1 -1 -1  1  1 -1]
[ 1 -1  1 -1  1 -1  1  1 -1 -1  1]

======================================

     vertices:  11
        edges:  21
automorphisms:  1
graph6-string:  J?AE@bi}BL_

Adjacency matrix:
[0 0 0 0 0 1 1 0 1 1 0]
[0 0 0 0 0 0 1 0 1 1 1]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 1 0 1 0]
[0 0 0 0 0 0 0 0 1 1 0]
[1 0 0 0 0 0 0 0 0 0 1]
[1 1 0 0 0 0 0 0 1 0 1]
[0 0 1 1 0 0 0 0 0 0 0]
[1 1 1 0 1 0 1 0 0 0 1]
[1 1 1 1 1 0 0 0 0 0 1]
[0 1 1 0 0 1 1 0 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1 -1  1  1  1  1  1  1 -1 -1]
[-1  1 -1  1 -1 -1  1 -1 -1  1  1]
[-1 -1  1 -1  1  1 -1  1  1 -1  1]
[ 1  1 -1  1 -1 -1  1  1 -1  1 -1]
[ 1 -1  1 -1  1 -1 -1 -1  1  1 -1]
[ 1 -1  1 -1 -1  1 -1 -1 -1  1  1]
[ 1  1 -1  1 -1 -1  1  1  1 -1 -1]
[ 1 -1  1  1 -1 -1  1  1  1 -1 -1]
[ 1 -1  1 -1  1 -1  1  1  1 -1 -1]
[-1  1 -1  1  1  1 -1 -1 -1  1  1]
[-1  1  1 -1 -1  1 -1 -1 -1  1  1]

======================================

     vertices:  11
        edges:  21
automorphisms:  1
graph6-string:  J?AEB`e^@]_

Adjacency matrix:
[0 0 0 0 0 1 1 0 0 0 0]
[0 0 0 0 0 0 1 1 1 1 0]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 1 0 1 0]
[0 0 0 0 0 0 0 0 0 1 1]
[1 0 0 0 0 0 0 0 1 1 1]
[1 1 0 0 0 0 0 0 1 0 1]
[0 1 1 1 0 0 0 0 0 0 1]
[0 1 1 0 0 1 1 0 0 0 0]
[0 1 1 1 1 1 0 0 0 0 1]
[0 0 1 0 1 1 1 1 0 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1 -1  1 -1  1  1  1 -1 -1  1]
[-1  1 -1  1  1 -1  1 -1  1  1 -1]
[-1 -1  1 -1 -1  1 -1  1  1 -1  1]
[ 1  1 -1  1 -1  1 -1  1 -1  1 -1]
[-1  1 -1 -1  1 -1  1 -1 -1  1  1]
[ 1 -1  1  1 -1  1 -1 -1  1  1 -1]
[ 1  1 -1 -1  1 -1  1  1 -1 -1  1]
[ 1 -1  1  1 -1 -1  1  1 -1 -1  1]
[-1  1  1 -1 -1  1 -1 -1  1  1 -1]
[-1  1 -1  1  1  1 -1 -1  1  1 -1]
[ 1 -1  1 -1  1 -1  1  1 -1 -1  1]

======================================

     vertices:  11
        edges:  21
automorphisms:  2
graph6-string:  J?AE@roJlF_

Adjacency matrix:
[0 0 0 0 0 1 1 0 1 0 1]
[0 0 0 0 0 0 1 0 1 0 0]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 1 1 0 0]
[0 0 0 0 0 0 0 1 0 1 0]
[1 0 0 0 0 0 0 0 0 1 0]
[1 1 0 0 0 0 0 0 0 1 1]
[0 0 1 1 1 0 0 0 0 0 1]
[1 1 1 1 0 0 0 0 0 1 1]
[0 0 1 0 1 1 1 0 1 0 1]
[1 0 1 0 0 0 1 1 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1 -1  1 -1  1  1  1 -1 -1  1]
[-1  1 -1  1  1 -1  1 -1  1  1 -1]
[-1 -1  1 -1 -1 -1 -1 -1  1  1  1]
[ 1  1 -1  1  1  1 -1  1  1 -1 -1]
[-1  1 -1  1  1  1  1  1 -1  1 -1]
[ 1 -1 -1  1  1  1 -1 -1  1  1 -1]
[ 1  1 -1 -1  1 -1  1  1 -1 -1  1]
[ 1 -1 -1  1  1 -1  1  1 -1 -1  1]
[-1  1  1  1 -1  1 -1 -1  1  1 -1]
[-1  1  1 -1  1  1 -1 -1  1  1 -1]
[ 1 -1  1 -1 -1 -1  1  1 -1 -1  1]

======================================

     vertices:  11
        edges:  21
automorphisms:  1
graph6-string:  J?AEDFWtVS_

Adjacency matrix:
[0 0 0 0 0 1 1 1 1 1 1]
[0 0 0 0 0 0 1 0 1 1 1]
[0 0 0 0 0 0 0 1 0 0 1]
[0 0 0 0 0 0 0 0 1 1 0]
[0 0 0 0 0 0 0 0 1 0 1]
[1 0 0 0 0 0 0 0 0 1 0]
[1 1 0 0 0 0 0 1 0 0 1]
[1 0 1 0 0 0 1 0 0 1 0]
[1 1 0 1 1 0 0 0 0 0 0]
[1 1 0 1 0 1 0 1 0 0 1]
[1 1 1 0 1 0 1 0 0 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1 -1 -1  1  1  1  1  1 -1 -1]
[-1  1 -1  1 -1 -1  1 -1 -1  1  1]
[-1 -1  1  1  1 -1 -1  1 -1  1  1]
[-1  1  1  1 -1 -1 -1  1  1  1 -1]
[ 1 -1  1 -1  1  1 -1 -1  1 -1  1]
[ 1 -1 -1 -1  1  1 -1 -1 -1  1  1]
[ 1  1 -1 -1 -1 -1  1  1  1 -1 -1]
[ 1 -1  1  1 -1 -1  1  1  1 -1 -1]
[ 1 -1 -1  1  1 -1  1  1  1 -1 -1]
[-1  1  1  1 -1  1 -1 -1 -1  1  1]
[-1  1  1 -1  1  1 -1 -1 -1  1  1]

======================================

     vertices:  11
        edges:  21
automorphisms:  1
graph6-string:  J?ABAbYff`_

Adjacency matrix:
[0 0 0 0 0 1 0 0 1 1 1]
[0 0 0 0 0 0 1 1 1 0 1]
[0 0 0 0 0 0 1 0 0 0 1]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 0 1 1 0]
[1 0 0 0 0 0 0 0 0 1 0]
[0 1 1 0 0 0 0 0 1 1 0]
[0 1 0 1 0 0 0 0 0 0 0]
[1 1 0 1 1 0 1 0 0 0 1]
[1 0 0 1 1 1 1 0 0 0 1]
[1 1 1 1 0 0 0 0 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1  1 -1 -1 -1  1 -1 -1  1 -1  1]
[ 1  1 -1 -1 -1  1  1  1  1 -1 -1]
[-1 -1  1  1 -1 -1  1 -1 -1  1  1]
[-1 -1  1  1  1 -1 -1  1 -1  1  1]
[-1 -1 -1  1  1 -1  1 -1  1  1 -1]
[ 1  1 -1 -1 -1  1  1  1 -1  1 -1]
[-1  1  1 -1  1  1  1  1 -1  1 -1]
[-1  1 -1  1 -1  1  1  1 -1  1 -1]
[ 1  1 -1 -1  1 -1 -1 -1  1 -1  1]
[-1 -1  1  1  1  1  1  1 -1  1 -1]
[ 1 -1  1  1 -1 -1 -1 -1  1 -1  1]

======================================

     vertices:  11
        edges:  21
automorphisms:  1
graph6-string:  J?ABEbg{HZ_

Adjacency matrix:
[0 0 0 0 0 1 0 1 1 1 0]
[0 0 0 0 0 0 1 1 1 1 0]
[0 0 0 0 0 0 1 0 1 1 1]
[0 0 0 0 0 0 0 1 0 1 0]
[0 0 0 0 0 0 0 0 1 0 1]
[1 0 0 0 0 0 0 0 0 0 1]
[0 1 1 0 0 0 0 0 0 0 0]
[1 1 0 1 0 0 0 0 0 0 1]
[1 1 1 0 1 0 0 0 0 1 1]
[1 1 1 1 0 0 0 0 1 0 1]
[0 0 1 0 1 1 0 1 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1  1 -1 -1 -1  1 -1 -1  1  1 -1]
[ 1  1 -1 -1  1 -1  1  1  1 -1 -1]
[-1 -1  1  1 -1  1  1 -1 -1  1  1]
[-1 -1  1  1 -1 -1 -1  1 -1  1  1]
[-1  1 -1 -1  1 -1 -1  1  1 -1  1]
[ 1 -1  1 -1 -1  1  1  1 -1 -1  1]
[-1  1  1 -1 -1  1  1  1 -1 -1  1]
[-1  1 -1  1  1  1  1  1 -1 -1  1]
[ 1  1 -1 -1  1 -1 -1 -1  1  1 -1]
[ 1 -1  1  1 -1 -1 -1 -1  1  1 -1]
[-1 -1  1  1  1  1  1  1 -1 -1  1]

======================================

     vertices:  11
        edges:  21
automorphisms:  1
graph6-string:  J?ABEbW{Gz_

Adjacency matrix:
[0 0 0 0 0 1 0 1 1 1 0]
[0 0 0 0 0 0 1 1 1 1 0]
[0 0 0 0 0 0 1 0 0 1 0]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 0 1 0 1]
[1 0 0 0 0 0 0 0 0 0 1]
[0 1 1 0 0 0 0 0 0 0 0]
[1 1 0 1 0 0 0 0 0 0 1]
[1 1 0 1 1 0 0 0 0 1 1]
[1 1 1 1 0 0 0 0 1 0 1]
[0 0 0 1 1 1 0 1 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1  1 -1 -1 -1  1 -1 -1  1  1 -1]
[ 1  1 -1 -1  1 -1  1  1  1 -1 -1]
[-1 -1  1  1 -1  1  1 -1 -1  1  1]
[-1 -1  1  1 -1 -1 -1  1 -1  1  1]
[-1  1 -1 -1  1  1  1 -1  1 -1  1]
[ 1 -1  1 -1  1  1  1  1 -1 -1  1]
[-1  1  1 -1  1  1  1  1 -1 -1  1]
[-1  1 -1  1 -1  1  1  1 -1 -1  1]
[ 1  1 -1 -1  1 -1 -1 -1  1  1 -1]
[ 1 -1  1  1 -1 -1 -1 -1  1  1 -1]
[-1 -1  1  1  1  1  1  1 -1 -1  1]

======================================

     vertices:  11
        edges:  21
automorphisms:  1
graph6-string:  J?ABEa[\Uw_

Adjacency matrix:
[0 0 0 0 0 1 0 1 1 0 1]
[0 0 0 0 0 0 1 1 0 1 1]
[0 0 0 0 0 0 1 0 0 1 0]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 0 1 0 1]
[1 0 0 0 0 0 0 0 1 1 1]
[0 1 1 0 0 0 0 0 0 0 0]
[1 1 0 1 0 0 0 0 0 1 0]
[1 0 0 1 1 1 0 0 0 0 0]
[0 1 1 1 0 1 0 1 0 0 1]
[1 1 0 1 1 1 0 0 0 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1  1 -1 -1 -1  1  1  1  1 -1 -1]
[ 1  1 -1 -1  1 -1  1  1 -1 -1  1]
[-1 -1  1  1 -1  1  1 -1  1  1 -1]
[-1 -1  1  1  1 -1 -1  1  1  1 -1]
[-1  1 -1  1  1 -1  1 -1  1 -1  1]
[ 1 -1  1 -1 -1  1 -1 -1 -1  1  1]
[ 1  1  1 -1  1 -1  1  1  1 -1 -1]
[ 1  1 -1  1 -1 -1  1  1  1 -1 -1]
[ 1 -1  1  1  1 -1  1  1  1 -1 -1]
[-1 -1  1  1 -1  1 -1 -1 -1  1  1]
[-1  1 -1 -1  1  1 -1 -1 -1  1  1]

======================================

     vertices:  11
        edges:  21
automorphisms:  1
graph6-string:  J?ABEbIB~`_

Adjacency matrix:
[0 0 0 0 0 1 0 1 1 0 1]
[0 0 0 0 0 0 1 1 1 0 1]
[0 0 0 0 0 0 1 0 0 0 1]
[0 0 0 0 0 0 0 1 0 0 1]
[0 0 0 0 0 0 0 0 1 1 0]
[1 0 0 0 0 0 0 0 0 1 0]
[0 1 1 0 0 0 0 0 1 1 0]
[1 1 0 1 0 0 0 0 0 1 0]
[1 1 0 0 1 0 1 0 0 1 1]
[0 0 0 0 1 1 1 1 1 0 1]
[1 1 1 1 0 0 0 0 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1  1 -1 -1 -1  1 -1 -1  1 -1  1]
[ 1  1 -1 -1 -1 -1  1  1  1 -1 -1]
[-1 -1  1  1 -1  1  1 -1 -1  1  1]
[-1 -1  1  1  1 -1 -1  1 -1  1  1]
[-1 -1 -1  1  1 -1 -1 -1  1  1  1]
[ 1 -1  1 -1 -1  1  1  1 -1  1 -1]
[-1  1  1 -1 -1  1  1  1 -1  1 -1]
[-1  1 -1  1 -1  1  1  1 -1  1 -1]
[ 1  1 -1 -1  1 -1 -1 -1  1 -1  1]
[-1 -1  1  1  1  1  1  1 -1  1 -1]
[ 1 -1  1  1  1 -1 -1 -1  1 -1  1]

======================================

     vertices:  11
        edges:  21
automorphisms:  1
graph6-string:  J?ABCrS\Uw_

Adjacency matrix:
[0 0 0 0 0 1 0 1 1 0 1]
[0 0 0 0 0 0 1 0 1 1 1]
[0 0 0 0 0 0 1 0 0 1 0]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 1 0 0 1]
[1 0 0 0 0 0 0 0 1 1 1]
[0 1 1 0 0 0 0 0 0 0 0]
[1 0 0 1 1 0 0 0 0 1 0]
[1 1 0 1 0 1 0 0 0 0 0]
[0 1 1 1 0 1 0 1 0 0 1]
[1 1 0 1 1 1 0 0 0 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1  1 -1  1  1  1  1  1 -1 -1]
[-1  1 -1  1  1 -1  1 -1  1 -1  1]
[ 1 -1  1 -1 -1  1  1  1 -1  1 -1]
[-1  1 -1  1 -1 -1 -1  1  1  1 -1]
[ 1  1 -1 -1  1 -1  1  1 -1 -1  1]
[ 1 -1  1 -1 -1  1 -1 -1 -1  1  1]
[ 1  1  1 -1  1 -1  1  1  1 -1 -1]
[ 1 -1  1  1  1 -1  1  1  1 -1 -1]
[ 1  1 -1  1 -1 -1  1  1  1 -1 -1]
[-1 -1  1  1 -1  1 -1 -1 -1  1  1]
[-1  1 -1 -1  1  1 -1 -1 -1  1  1]

======================================

     vertices:  11
        edges:  21
automorphisms:  1
graph6-string:  J?ABCpTuN`_

Adjacency matrix:
[0 0 0 0 0 1 0 1 0 1 1]
[0 0 0 0 0 0 1 0 1 1 1]
[0 0 0 0 0 0 1 0 0 0 1]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 1 0 1 0]
[1 0 0 0 0 0 0 0 1 0 0]
[0 1 1 0 0 0 0 0 0 0 0]
[1 0 0 1 1 0 0 0 1 0 0]
[0 1 0 1 0 1 0 1 0 1 1]
[1 1 0 1 1 0 0 0 1 0 1]
[1 1 1 1 0 0 0 0 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1  1 -1  1  1 -1 -1 -1  1  1]
[-1  1 -1 -1  1  1  1 -1  1  1 -1]
[ 1 -1  1  1 -1 -1  1  1 -1 -1  1]
[-1 -1  1  1 -1 -1 -1  1  1 -1  1]
[ 1  1 -1 -1  1 -1  1  1 -1  1 -1]
[ 1  1 -1 -1 -1  1  1  1  1 -1 -1]
[-1  1  1 -1  1  1  1  1  1 -1 -1]
[-1 -1  1  1  1  1  1  1  1 -1 -1]
[-1  1 -1  1 -1  1  1  1  1 -1 -1]
[ 1  1 -1 -1  1 -1 -1 -1 -1  1  1]
[ 1 -1  1  1 -1 -1 -1 -1 -1  1  1]

======================================

     vertices:  11
        edges:  21
automorphisms:  1
graph6-string:  J?ABApwcyl_

Adjacency matrix:
[0 0 0 0 0 1 0 0 0 1 0]
[0 0 0 0 0 0 1 1 1 0 1]
[0 0 0 0 0 0 1 0 1 0 0]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 1 1 0 0]
[1 0 0 0 0 0 0 0 0 0 1]
[0 1 1 0 0 0 0 0 0 1 1]
[0 1 0 1 1 0 0 0 0 1 0]
[0 1 1 1 1 0 0 0 0 1 1]
[1 0 0 1 0 0 1 1 1 0 1]
[0 1 0 1 0 1 1 0 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1  1 -1  1  1  1  1 -1  1 -1]
[-1  1 -1 -1  1  1  1  1 -1 -1  1]
[ 1 -1  1 -1  1 -1  1 -1  1  1 -1]
[-1 -1 -1  1 -1 -1 -1 -1  1  1  1]
[ 1  1  1 -1  1  1 -1  1  1 -1 -1]
[ 1  1 -1 -1  1  1 -1 -1  1 -1  1]
[ 1  1  1 -1 -1 -1  1  1 -1  1 -1]
[ 1  1 -1 -1  1 -1  1  1 -1  1 -1]
[-1 -1  1  1  1  1 -1 -1  1 -1  1]
[ 1 -1  1  1 -1 -1  1  1 -1  1 -1]
[-1  1 -1  1 -1  1 -1 -1  1 -1  1]

======================================

     vertices:  11
        edges:  21
automorphisms:  1
graph6-string:  J?ABCdY]am_

Adjacency matrix:
[0 0 0 0 0 1 0 1 0 0 0]
[0 0 0 0 0 0 1 0 1 1 1]
[0 0 0 0 0 0 1 0 0 1 0]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 0 1 1 0]
[1 0 0 0 0 0 0 0 0 0 1]
[0 1 1 0 0 0 0 1 1 1 1]
[1 0 0 1 0 0 1 0 0 0 1]
[0 1 0 1 1 0 1 0 0 0 0]
[0 1 1 1 1 0 1 0 0 0 1]
[0 1 0 1 0 1 1 1 0 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1  1 -1  1  1  1  1  1 -1 -1]
[-1  1 -1 -1 -1  1  1 -1  1 -1  1]
[ 1 -1  1 -1  1 -1  1  1 -1  1 -1]
[-1 -1 -1  1  1 -1 -1  1 -1  1  1]
[ 1 -1  1  1  1  1 -1 -1  1  1 -1]
[ 1  1 -1 -1  1  1 -1 -1 -1  1  1]
[ 1  1  1 -1 -1 -1  1  1  1 -1 -1]
[ 1 -1  1  1 -1 -1  1  1  1 -1 -1]
[ 1  1 -1 -1  1 -1  1  1  1 -1 -1]
[-1 -1  1  1  1  1 -1 -1 -1  1  1]
[-1  1 -1  1 -1  1 -1 -1 -1  1  1]

======================================

     vertices:  11
        edges:  21
automorphisms:  2
graph6-string:  J?AB?vSufa_

Adjacency matrix:
[0 0 0 0 0 1 0 0 1 1 1]
[0 0 0 0 0 0 1 0 1 1 1]
[0 0 0 0 0 0 1 0 0 0 1]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 1 0 1 0]
[1 0 0 0 0 0 0 0 1 0 0]
[0 1 1 0 0 0 0 1 0 1 0]
[0 0 0 1 1 0 1 0 0 0 1]
[1 1 0 1 0 1 0 0 0 0 0]
[1 1 0 1 1 0 1 0 0 0 1]
[1 1 1 1 0 0 0 1 0 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1  1 -1  1  1 -1 -1 -1  1  1]
[-1  1 -1  1 -1 -1  1 -1  1  1 -1]
[ 1 -1  1 -1 -1  1  1  1 -1 -1  1]
[-1  1 -1  1 -1 -1 -1  1  1 -1  1]
[ 1 -1 -1 -1  1  1  1  1 -1  1 -1]
[ 1 -1  1 -1  1  1  1  1  1 -1 -1]
[-1  1  1 -1  1  1  1  1  1 -1 -1]
[-1 -1  1  1  1  1  1  1  1 -1 -1]
[-1  1 -1  1 -1  1  1  1  1 -1 -1]
[ 1  1 -1 -1  1 -1 -1 -1 -1  1  1]
[ 1 -1  1  1 -1 -1 -1 -1 -1  1  1]

======================================

     vertices:  11
        edges:  21
automorphisms:  1
graph6-string:  J?AFE`g}@N_

Adjacency matrix:
[0 0 0 0 0 1 1 1 0 1 0]
[0 0 0 0 0 0 1 1 1 1 0]
[0 0 0 0 0 0 1 0 1 1 1]
[0 0 0 0 0 0 0 1 0 1 0]
[0 0 0 0 0 0 0 0 1 1 0]
[1 0 0 0 0 0 0 0 0 0 1]
[1 1 1 0 0 0 0 0 0 0 1]
[1 1 0 1 0 0 0 0 0 0 1]
[0 1 1 0 1 0 0 0 0 0 1]
[1 1 1 1 1 0 0 0 0 0 1]
[0 0 1 0 0 1 1 1 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1  1 -1 -1  1  1  1 -1 -1  1 -1]
[ 1  1 -1 -1  1 -1  1  1  1 -1 -1]
[-1 -1  1  1 -1 -1  1 -1 -1  1  1]
[-1 -1  1  1 -1 -1 -1  1 -1  1  1]
[ 1  1 -1 -1  1  1 -1 -1  1  1 -1]
[ 1 -1 -1 -1  1  1 -1  1  1 -1  1]
[ 1  1  1 -1 -1 -1  1 -1 -1  1 -1]
[-1  1 -1  1 -1  1 -1  1  1 -1  1]
[-1  1 -1 -1  1  1 -1  1  1 -1  1]
[ 1 -1  1  1  1 -1  1 -1 -1  1 -1]
[-1 -1  1  1 -1  1 -1  1  1 -1  1]

======================================

     vertices:  11
        edges:  21
automorphisms:  2
graph6-string:  J?B@fAozAZ_

Adjacency matrix:
[0 0 0 0 0 1 0 1 1 1 0]
[0 0 0 0 0 1 0 1 0 1 1]
[0 0 0 0 0 0 1 1 1 1 0]
[0 0 0 0 0 0 1 0 1 0 0]
[0 0 0 0 0 0 0 0 0 1 1]
[1 1 0 0 0 0 0 0 0 1 1]
[0 0 1 1 0 0 0 0 0 0 0]
[1 1 1 0 0 0 0 0 0 0 1]
[1 0 1 1 0 0 0 0 0 0 1]
[1 1 1 0 1 1 0 0 0 0 1]
[0 1 0 0 1 1 0 1 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1  1 -1 -1  1 -1 -1  1  1 -1]
[-1  1 -1  1 -1  1  1  1 -1 -1  1]
[ 1 -1  1 -1  1 -1  1  1 -1  1 -1]
[-1  1 -1  1 -1  1  1 -1  1 -1  1]
[-1 -1  1 -1  1 -1 -1 -1  1  1  1]
[ 1  1 -1  1 -1  1  1 -1 -1  1 -1]
[-1  1  1  1 -1  1  1 -1 -1  1 -1]
[-1  1  1 -1 -1 -1 -1  1  1 -1  1]
[ 1 -1 -1  1  1 -1 -1  1  1 -1  1]
[ 1 -1  1 -1  1  1  1 -1 -1  1 -1]
[-1  1 -1  1  1 -1 -1  1  1 -1  1]

======================================

     vertices:  11
        edges:  21
automorphisms:  2
graph6-string:  J?B@fAon?z_

Adjacency matrix:
[0 0 0 0 0 1 0 1 1 1 0]
[0 0 0 0 0 1 0 1 0 0 0]
[0 0 0 0 0 0 1 1 1 1 0]
[0 0 0 0 0 0 1 0 1 1 1]
[0 0 0 0 0 0 0 0 0 1 1]
[1 1 0 0 0 0 0 0 0 1 1]
[0 0 1 1 0 0 0 0 0 0 0]
[1 1 1 0 0 0 0 0 0 0 1]
[1 0 1 1 0 0 0 0 0 0 1]
[1 0 1 1 1 1 0 0 0 0 1]
[0 0 0 1 1 1 0 1 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1  1 -1 -1  1 -1 -1  1  1 -1]
[-1  1 -1  1 -1  1  1  1 -1 -1  1]
[ 1 -1  1 -1  1 -1  1  1 -1  1 -1]
[-1  1 -1  1 -1  1  1 -1  1 -1  1]
[-1 -1  1 -1  1 -1 -1  1 -1  1  1]
[ 1  1 -1  1 -1  1  1 -1 -1  1 -1]
[-1  1  1  1 -1  1  1 -1 -1  1 -1]
[-1  1  1 -1  1 -1 -1  1  1 -1  1]
[ 1 -1 -1  1 -1 -1 -1  1  1 -1  1]
[ 1 -1  1 -1  1  1  1 -1 -1  1 -1]
[-1  1 -1  1  1 -1 -1  1  1 -1  1]

======================================

     vertices:  11
        edges:  21
automorphisms:  1
graph6-string:  J?B@cZ_[^W_

Adjacency matrix:
[0 0 0 0 0 1 0 1 1 0 1]
[0 0 0 0 0 1 0 0 1 1 1]
[0 0 0 0 0 0 1 0 1 1 1]
[0 0 0 0 0 0 1 0 0 1 0]
[0 0 0 0 0 0 0 1 0 0 1]
[1 1 0 0 0 0 0 1 0 0 1]
[0 0 1 1 0 0 0 0 0 0 0]
[1 0 0 0 1 1 0 0 0 1 0]
[1 1 1 0 0 0 0 0 0 1 0]
[0 1 1 1 0 0 0 1 1 0 1]
[1 1 1 0 1 1 0 0 0 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1  1 -1 -1  1  1  1  1 -1 -1]
[-1  1 -1  1 -1  1 -1 -1 -1  1  1]
[ 1 -1  1 -1  1 -1  1 -1  1 -1  1]
[-1  1 -1  1 -1  1  1  1 -1  1 -1]
[-1 -1  1 -1  1 -1 -1  1 -1  1  1]
[ 1  1 -1  1 -1  1  1 -1 -1 -1  1]
[ 1 -1  1  1 -1  1  1 -1 -1 -1  1]
[ 1 -1 -1  1  1 -1 -1  1  1  1 -1]
[ 1 -1  1 -1 -1 -1 -1  1  1  1 -1]
[-1  1 -1  1  1 -1 -1  1  1  1 -1]
[-1  1  1 -1  1  1  1 -1 -1 -1  1]

======================================

     vertices:  11
        edges:  21
automorphisms:  1
graph6-string:  J?B@`Yos\w_

Adjacency matrix:
[0 0 0 0 0 1 0 0 1 1 1]
[0 0 0 0 0 1 0 0 0 1 0]
[0 0 0 0 0 0 1 1 1 0 1]
[0 0 0 0 0 0 1 0 1 1 1]
[0 0 0 0 0 0 0 1 0 0 1]
[1 1 0 0 0 0 0 1 0 0 1]
[0 0 1 1 0 0 0 0 0 0 0]
[0 0 1 0 1 1 0 0 0 1 0]
[1 0 1 1 0 0 0 0 0 1 0]
[1 1 0 1 0 0 0 1 1 0 1]
[1 0 1 1 1 1 0 0 0 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1  1 -1 -1  1 -1 -1  1 -1  1]
[-1  1 -1  1 -1  1  1  1 -1  1 -1]
[ 1 -1  1 -1 -1  1  1  1  1 -1 -1]
[-1  1 -1  1  1 -1  1 -1 -1  1  1]
[-1 -1 -1  1  1 -1 -1  1 -1  1  1]
[ 1  1  1 -1 -1  1  1 -1 -1 -1  1]
[-1  1  1  1 -1  1  1 -1 -1 -1  1]
[-1  1  1 -1  1 -1 -1  1  1  1 -1]
[ 1 -1  1 -1 -1 -1 -1  1  1  1 -1]
[-1  1 -1  1  1 -1 -1  1  1  1 -1]
[ 1 -1 -1  1  1  1  1 -1 -1 -1  1]

======================================

     vertices:  11
        edges:  21
automorphisms:  2
graph6-string:  J?`DAboQ{N_

Adjacency matrix:
[0 0 0 0 1 0 1 0 1 0 1]
[0 0 0 0 0 1 0 1 1 1 0]
[0 0 0 0 0 0 1 0 1 0 0]
[0 0 0 0 0 0 0 1 1 0 0]
[1 0 0 0 0 0 0 0 0 1 0]
[0 1 0 0 0 0 0 0 0 0 1]
[1 0 1 0 0 0 0 0 0 1 1]
[0 1 0 1 0 0 0 0 0 1 1]
[1 1 1 1 0 0 0 0 0 1 1]
[0 1 0 0 1 0 1 1 1 0 1]
[1 0 0 0 0 1 1 1 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1 -1  1  1  1 -1 -1  1 -1  1]
[-1  1  1 -1  1  1 -1 -1  1  1 -1]
[-1  1  1 -1 -1 -1  1 -1  1  1 -1]
[ 1 -1 -1  1 -1 -1 -1  1  1 -1  1]
[ 1  1 -1 -1  1 -1 -1 -1  1  1 -1]
[ 1  1 -1 -1 -1  1 -1 -1  1 -1  1]
[-1 -1  1 -1 -1 -1  1  1 -1  1  1]
[-1 -1 -1  1 -1 -1  1  1 -1  1  1]
[ 1  1  1  1  1  1 -1 -1  1 -1 -1]
[-1  1  1 -1  1 -1  1  1 -1  1 -1]
[ 1 -1 -1  1 -1  1  1  1 -1 -1  1]

======================================

     vertices:  11
        edges:  21
automorphisms:  4
graph6-string:  J?`DAboB}F_

Adjacency matrix:
[0 0 0 0 1 0 1 0 1 0 1]
[0 0 0 0 0 1 0 1 1 0 1]
[0 0 0 0 0 0 1 0 1 0 0]
[0 0 0 0 0 0 0 1 1 0 0]
[1 0 0 0 0 0 0 0 0 1 0]
[0 1 0 0 0 0 0 0 0 1 0]
[1 0 1 0 0 0 0 0 0 1 1]
[0 1 0 1 0 0 0 0 0 1 1]
[1 1 1 1 0 0 0 0 0 1 1]
[0 0 0 0 1 1 1 1 1 0 1]
[1 1 0 0 0 0 1 1 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1  1 -1 -1  1 -1 -1 -1  1 -1  1]
[ 1  1 -1 -1 -1  1 -1 -1  1 -1  1]
[-1 -1  1  1 -1  1  1 -1  1  1 -1]
[-1 -1  1  1  1 -1 -1  1  1  1 -1]
[ 1 -1 -1  1  1  1 -1 -1  1  1 -1]
[-1  1  1 -1  1  1 -1 -1  1  1 -1]
[-1 -1  1 -1 -1 -1  1  1 -1  1  1]
[-1 -1 -1  1 -1 -1  1  1 -1  1  1]
[ 1  1  1  1  1  1 -1 -1  1 -1 -1]
[-1 -1  1  1  1  1  1  1 -1  1 -1]
[ 1  1 -1 -1 -1 -1  1  1 -1 -1  1]

======================================

     vertices:  11
        edges:  21
automorphisms:  2
graph6-string:  J?`D@_yw[N_

Adjacency matrix:
[0 0 0 0 1 0 1 0 0 1 1]
[0 0 0 0 0 1 0 0 0 1 0]
[0 0 0 0 0 0 1 1 1 1 0]
[0 0 0 0 0 0 0 1 1 0 0]
[1 0 0 0 0 0 0 0 1 0 0]
[0 1 0 0 0 0 0 0 0 0 1]
[1 0 1 0 0 0 0 0 1 0 1]
[0 0 1 1 0 0 0 0 0 1 1]
[0 0 1 1 1 0 1 0 0 1 1]
[1 1 1 0 0 0 0 1 1 0 1]
[1 0 0 0 0 1 1 1 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1 -1 -1  1 -1 -1  1 -1  1  1]
[-1  1  1 -1  1  1 -1 -1  1  1 -1]
[-1  1  1 -1 -1 -1  1 -1  1  1 -1]
[-1 -1 -1  1  1  1 -1  1  1 -1  1]
[ 1  1 -1  1  1 -1 -1 -1  1  1 -1]
[-1  1 -1  1 -1  1  1 -1  1 -1  1]
[-1 -1  1 -1 -1  1  1 -1  1 -1  1]
[ 1 -1 -1  1 -1 -1 -1  1 -1  1  1]
[-1  1  1  1  1  1  1 -1  1 -1 -1]
[ 1  1  1 -1  1 -1 -1  1 -1  1 -1]
[ 1 -1 -1  1 -1  1  1  1 -1 -1  1]

======================================

     vertices:  11
        edges:  23
automorphisms:  2
graph6-string:  J?AEFBs^`^?

Adjacency matrix:
[0 0 0 0 0 1 1 1 1 0 0]
[0 0 0 0 0 0 1 1 1 1 0]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 0 1 1 0]
[0 0 0 0 0 0 0 0 0 1 1]
[1 0 0 0 0 0 0 0 1 1 1]
[1 1 0 0 0 0 0 0 0 1 1]
[1 1 1 0 0 0 0 0 0 0 1]
[1 1 1 1 0 1 0 0 0 0 1]
[0 1 1 1 1 1 1 0 0 0 0]
[0 0 1 0 1 1 1 1 1 0 0]

(2x)Inverse of the Adjacency matrix:
[-1  1 -1 -1 -1  1  1 -1  1 -1  1]
[ 1 -1  1  1 -1 -1  1  1 -1  1 -1]
[-1  1 -1  1  1 -1 -1  1  1 -1  1]
[-1  1  1 -1 -1  1 -1 -1  1  1 -1]
[-1 -1  1 -1 -1  1  1 -1 -1  1  1]
[ 1 -1 -1  1  1 -1  1 -1  1 -1  1]
[ 1  1 -1 -1  1  1 -1  1 -1  1 -1]
[-1  1  1 -1 -1 -1  1 -1  1 -1  1]
[ 1 -1  1  1 -1  1 -1  1 -1  1 -1]
[-1  1 -1  1  1 -1  1 -1  1 -1  1]
[ 1 -1  1 -1  1  1 -1  1 -1  1 -1]

======================================

     vertices:  11
        edges:  23
automorphisms:  1
graph6-string:  J?`DFBw]_^_

Adjacency matrix:
[0 0 0 0 1 0 1 1 1 0 0]
[0 0 0 0 0 1 0 1 1 1 0]
[0 0 0 0 0 0 1 1 1 1 0]
[0 0 0 0 0 0 0 0 1 1 0]
[1 0 0 0 0 0 0 0 1 1 1]
[0 1 0 0 0 0 0 0 0 0 1]
[1 0 1 0 0 0 0 0 0 1 1]
[1 1 1 0 0 0 0 0 0 0 1]
[1 1 1 1 1 0 0 0 0 0 1]
[0 1 1 1 1 0 1 0 0 0 1]
[0 0 0 0 1 1 1 1 1 1 0]

(2x)Inverse of the Adjacency matrix:
[-1 -1  1 -1  1 -1 -1  1  1 -1  1]
[-1 -1  1  1 -1  1 -1  1  1 -1  1]
[ 1  1 -1  1 -1 -1  1  1 -1  1 -1]
[-1  1  1 -1  1 -1 -1 -1  1  1 -1]
[ 1 -1 -1  1 -1  1  1 -1  1 -1  1]
[-1  1 -1 -1  1 -1 -1  1 -1  1  1]
[-1 -1  1 -1  1 -1 -1  1 -1  1  1]
[ 1  1  1 -1 -1  1  1 -1  1 -1 -1]
[ 1  1 -1  1  1 -1 -1  1 -1  1 -1]
[-1 -1  1  1 -1  1  1 -1  1 -1  1]
[ 1  1 -1 -1  1  1  1 -1 -1  1 -1]

======================================

     vertices:  11
        edges:  25
automorphisms:  1
graph6-string:  J?AAF@t~T^_

Adjacency matrix:
[0 0 0 0 0 1 0 1 0 1 1]
[0 0 0 0 0 0 1 1 1 1 0]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 0 1 1 0]
[0 0 0 0 0 0 0 0 0 1 1]
[1 0 0 0 0 0 0 0 1 1 1]
[0 1 0 0 0 0 0 0 0 0 1]
[1 1 1 0 0 0 0 0 1 1 1]
[0 1 1 1 0 1 0 1 0 0 1]
[1 1 1 1 1 1 0 1 0 0 1]
[1 0 1 0 1 1 1 1 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1  1 -1 -1 -1  1 -1  1 -1  1 -1]
[ 1  1 -1  1 -1 -1  1  1 -1  1 -1]
[-1 -1  1 -1  1 -1 -1  1  1 -1  1]
[-1  1 -1  1  1  1 -1 -1  1  1 -1]
[-1 -1  1  1  1 -1  1 -1 -1  1  1]
[ 1 -1 -1  1 -1  1  1 -1  1 -1  1]
[-1  1 -1 -1  1  1  1 -1  1 -1  1]
[ 1  1  1 -1 -1 -1 -1  1 -1  1 -1]
[-1 -1  1  1 -1  1  1 -1  1 -1  1]
[ 1  1 -1  1  1 -1 -1  1 -1  1 -1]
[-1 -1  1 -1  1  1  1 -1  1 -1  1]

======================================

     vertices:  11
        edges:  25
automorphisms:  2
graph6-string:  J?AAFAvZv}?

Adjacency matrix:
[0 0 0 0 0 1 0 1 1 0 1]
[0 0 0 0 0 0 1 1 0 1 1]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 0 1 0 1]
[0 0 0 0 0 0 0 0 0 1 1]
[1 0 0 0 0 0 0 0 1 1 1]
[0 1 0 0 0 0 0 0 1 1 1]
[1 1 1 0 0 0 0 0 1 1 1]
[1 0 1 1 0 1 1 1 0 0 0]
[0 1 1 0 1 1 1 1 0 0 0]
[1 1 1 1 1 1 1 1 0 0 0]

(2x)Inverse of the Adjacency matrix:
[ 1  1 -1 -1 -1  1 -1  1 -1 -1  1]
[ 1  1 -1 -1 -1 -1  1  1 -1 -1  1]
[-1 -1  1  1  1 -1 -1  1  1  1 -1]
[-1 -1  1  1  1 -1  1 -1  1 -1  1]
[-1 -1  1  1  1  1 -1 -1 -1  1  1]
[ 1 -1 -1 -1  1  1  1 -1  1  1 -1]
[-1  1 -1  1 -1  1  1 -1  1  1 -1]
[ 1  1  1 -1 -1 -1 -1  1 -1 -1  1]
[-1 -1  1  1 -1  1  1 -1  1  1 -1]
[-1 -1  1 -1  1  1  1 -1  1  1 -1]
[ 1  1 -1  1  1 -1 -1  1 -1 -1  1]

======================================

     vertices:  11
        edges:  25
automorphisms:  1
graph6-string:  J?AEDFq}f^?

Adjacency matrix:
[0 0 0 0 0 1 1 1 1 1 1]
[0 0 0 0 0 0 1 0 1 1 1]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 0 1 1 0]
[0 0 0 0 0 0 0 0 0 1 1]
[1 0 0 0 0 0 0 0 0 0 1]
[1 1 0 0 0 0 0 1 1 1 1]
[1 0 1 0 0 0 1 0 0 0 1]
[1 1 1 1 0 0 1 0 0 0 1]
[1 1 1 1 1 0 1 0 0 0 0]
[1 1 1 0 1 1 1 1 1 0 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1 -1  1 -1  1  1  1 -1  1 -1]
[-1  1 -1 -1  1 -1  1 -1  1 -1  1]
[-1 -1  1  1  1 -1 -1  1  1 -1  1]
[ 1 -1  1  1 -1  1 -1 -1  1  1 -1]
[-1  1  1 -1  1  1 -1 -1 -1  1  1]
[ 1 -1 -1  1  1  1 -1 -1  1 -1  1]
[ 1  1 -1 -1 -1 -1  1  1 -1  1 -1]
[ 1 -1  1 -1 -1 -1  1  1 -1  1 -1]
[-1  1  1  1 -1  1 -1 -1  1 -1  1]
[ 1 -1 -1  1  1 -1  1  1 -1  1 -1]
[-1  1  1 -1  1  1 -1 -1  1 -1  1]

======================================

     vertices:  11
        edges:  25
automorphisms:  1
graph6-string:  J?AEFJojv}?

Adjacency matrix:
[0 0 0 0 0 1 1 1 1 1 1]
[0 0 0 0 0 0 1 1 1 0 1]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 0 1 0 1]
[0 0 0 0 0 0 0 0 0 1 1]
[1 0 0 0 0 0 0 1 0 1 1]
[1 1 0 0 0 0 0 0 0 1 1]
[1 1 1 0 0 1 0 0 0 1 1]
[1 1 1 1 0 0 0 0 0 0 0]
[1 0 1 0 1 1 1 1 0 0 0]
[1 1 1 1 1 1 1 1 0 0 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1 -1  1 -1  1  1 -1  1  1 -1]
[-1  1  1 -1 -1 -1  1  1 -1 -1  1]
[-1  1  1 -1  1 -1 -1  1  1  1 -1]
[ 1 -1 -1  1  1  1 -1 -1  1 -1  1]
[-1 -1  1  1  1 -1  1 -1 -1  1  1]
[ 1 -1 -1  1 -1  1 -1  1 -1 -1  1]
[ 1  1 -1 -1  1 -1  1 -1  1  1 -1]
[-1  1  1 -1 -1  1 -1  1 -1 -1  1]
[ 1 -1  1  1 -1 -1  1 -1  1  1 -1]
[ 1 -1  1 -1  1 -1  1 -1  1  1 -1]
[-1  1 -1  1  1  1 -1  1 -1 -1  1]

======================================

     vertices:  11
        edges:  25
automorphisms:  1
graph6-string:  J?AEFJoJz~?

Adjacency matrix:
[0 0 0 0 0 1 1 1 1 0 0]
[0 0 0 0 0 0 1 1 1 0 1]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 0 1 0 1]
[0 0 0 0 0 0 0 0 0 1 1]
[1 0 0 0 0 0 0 1 0 1 1]
[1 1 0 0 0 0 0 0 0 1 1]
[1 1 1 0 0 1 0 0 0 1 1]
[1 1 1 1 0 0 0 0 0 1 1]
[0 0 1 0 1 1 1 1 1 0 0]
[0 1 1 1 1 1 1 1 1 0 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1 -1  1 -1  1  1 -1  1  1 -1]
[-1  1  1 -1 -1 -1  1  1 -1 -1  1]
[-1  1  1 -1 -1 -1 -1  1  1  1 -1]
[ 1 -1 -1  1  1  1 -1 -1  1 -1  1]
[-1 -1 -1  1  1  1  1 -1 -1  1  1]
[ 1 -1 -1  1  1  1 -1  1 -1 -1  1]
[ 1  1 -1 -1  1 -1  1 -1  1  1 -1]
[-1  1  1 -1 -1  1 -1  1 -1 -1  1]
[ 1 -1  1  1 -1 -1  1 -1  1  1 -1]
[ 1 -1  1 -1  1 -1  1 -1  1  1 -1]
[-1  1 -1  1  1  1 -1  1 -1 -1  1]

======================================

     vertices:  11
        edges:  25
automorphisms:  1
graph6-string:  J?ABCdVvVz?

Adjacency matrix:
[0 0 0 0 0 1 0 1 0 1 1]
[0 0 0 0 0 0 1 0 1 1 1]
[0 0 0 0 0 0 1 0 0 0 1]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 0 0 1 1]
[1 0 0 0 0 0 0 0 1 1 1]
[0 1 1 0 0 0 0 1 1 0 0]
[1 0 0 1 0 0 1 0 1 1 1]
[0 1 0 1 0 1 1 1 0 0 1]
[1 1 0 1 1 1 0 1 0 0 0]
[1 1 1 1 1 1 0 1 1 0 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1  1 -1 -1  1  1  1 -1  1 -1]
[-1  1 -1 -1  1  1  1 -1  1  1 -1]
[ 1 -1  1 -1  1 -1  1  1 -1 -1  1]
[-1 -1 -1  1  1 -1 -1  1  1 -1  1]
[-1  1  1  1  1 -1 -1 -1 -1  1  1]
[ 1  1 -1 -1 -1  1 -1 -1  1 -1  1]
[ 1  1  1 -1 -1 -1  1  1 -1  1 -1]
[ 1 -1  1  1 -1 -1  1  1 -1  1 -1]
[-1  1 -1  1 -1  1 -1 -1  1 -1  1]
[ 1  1 -1 -1  1 -1  1  1 -1  1 -1]
[-1 -1  1  1  1  1 -1 -1  1 -1  1]

======================================

     vertices:  11
        edges:  25
automorphisms:  1
graph6-string:  J?ABCdVVr~?

Adjacency matrix:
[0 0 0 0 0 1 0 1 0 0 0]
[0 0 0 0 0 0 1 0 1 1 1]
[0 0 0 0 0 0 1 0 0 0 1]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 0 0 1 1]
[1 0 0 0 0 0 0 0 1 1 1]
[0 1 1 0 0 0 0 1 1 1 1]
[1 0 0 1 0 0 1 0 1 1 1]
[0 1 0 1 0 1 1 1 0 0 1]
[0 1 0 1 1 1 1 1 0 0 0]
[0 1 1 1 1 1 1 1 1 0 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1  1 -1 -1  1  1  1 -1  1 -1]
[-1  1 -1 -1 -1  1  1 -1  1  1 -1]
[ 1 -1  1 -1  1 -1  1  1 -1 -1  1]
[-1 -1 -1  1  1 -1 -1  1  1 -1  1]
[-1 -1  1  1  1  1 -1 -1 -1  1  1]
[ 1  1 -1 -1  1  1 -1 -1  1 -1  1]
[ 1  1  1 -1 -1 -1  1  1 -1  1 -1]
[ 1 -1  1  1 -1 -1  1  1 -1  1 -1]
[-1  1 -1  1 -1  1 -1 -1  1 -1  1]
[ 1  1 -1 -1  1 -1  1  1 -1  1 -1]
[-1 -1  1  1  1  1 -1 -1  1 -1  1]

======================================

     vertices:  11
        edges:  25
automorphisms:  1
graph6-string:  J?BFDrs}Cl_

Adjacency matrix:
[0 0 0 0 0 1 1 1 1 1 1]
[0 0 0 0 0 1 1 0 1 1 0]
[0 0 0 0 0 0 1 1 1 1 0]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 1 0 1 0]
[1 1 0 0 0 0 0 0 1 0 1]
[1 1 1 0 0 0 0 0 0 0 1]
[1 0 1 1 1 0 0 0 0 0 0]
[1 1 1 1 0 1 0 0 0 0 1]
[1 1 1 1 1 0 0 0 0 0 1]
[1 0 0 1 0 1 1 0 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1 -1 -1  1  1  1  1 -1 -1  1]
[-1  1  1 -1  1  1 -1 -1  1  1 -1]
[-1  1  1  1 -1 -1  1  1  1 -1 -1]
[-1 -1  1  1 -1 -1 -1 -1  1  1  1]
[ 1  1 -1 -1  1  1 -1  1 -1  1 -1]
[ 1  1 -1 -1  1  1 -1  1  1 -1 -1]
[ 1 -1  1 -1 -1 -1  1 -1 -1  1  1]
[ 1 -1  1 -1  1  1 -1  1  1 -1 -1]
[-1  1  1  1 -1  1 -1  1  1 -1 -1]
[-1  1 -1  1  1 -1  1 -1 -1  1  1]
[ 1 -1 -1  1 -1 -1  1 -1 -1  1  1]

======================================

     vertices:  11
        edges:  25
automorphisms:  1
graph6-string:  J?B@ljbzAZ_

Adjacency matrix:
[0 0 0 0 0 1 0 1 1 1 0]
[0 0 0 0 0 1 0 0 1 1 1]
[0 0 0 0 0 0 1 1 1 1 0]
[0 0 0 0 0 0 1 1 0 0 0]
[0 0 0 0 0 0 0 0 0 1 1]
[1 1 0 0 0 0 1 1 0 1 1]
[0 0 1 1 0 1 0 0 1 0 0]
[1 0 1 1 0 1 0 0 1 0 1]
[1 1 1 0 0 0 1 1 0 0 1]
[1 1 1 0 1 1 0 0 0 0 1]
[0 1 0 0 1 1 0 1 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1  1 -1 -1  1 -1  1 -1  1 -1]
[-1  1 -1 -1 -1  1  1 -1  1 -1  1]
[ 1 -1  1 -1  1 -1  1 -1  1  1 -1]
[-1 -1 -1  1  1  1  1  1 -1 -1  1]
[-1 -1  1  1  1 -1 -1  1 -1  1  1]
[ 1  1 -1  1 -1  1  1 -1 -1  1 -1]
[-1  1  1  1 -1  1  1 -1 -1  1 -1]
[ 1 -1 -1  1  1 -1 -1  1  1 -1  1]
[-1  1  1 -1 -1 -1 -1  1  1 -1  1]
[ 1 -1  1 -1  1  1  1 -1 -1  1 -1]
[-1  1 -1  1  1 -1 -1  1  1 -1  1]

======================================

     vertices:  11
        edges:  25
automorphisms:  1
graph6-string:  J?B@ljbn?z_

Adjacency matrix:
[0 0 0 0 0 1 0 1 1 1 0]
[0 0 0 0 0 1 0 0 1 0 0]
[0 0 0 0 0 0 1 1 1 1 0]
[0 0 0 0 0 0 1 1 0 1 1]
[0 0 0 0 0 0 0 0 0 1 1]
[1 1 0 0 0 0 1 1 0 1 1]
[0 0 1 1 0 1 0 0 1 0 0]
[1 0 1 1 0 1 0 0 1 0 1]
[1 1 1 0 0 0 1 1 0 0 1]
[1 0 1 1 1 1 0 0 0 0 1]
[0 0 0 1 1 1 0 1 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1  1 -1 -1  1 -1  1 -1  1 -1]
[-1  1 -1 -1  1  1  1 -1  1 -1  1]
[ 1 -1  1 -1  1 -1  1 -1  1  1 -1]
[-1 -1 -1  1 -1  1  1  1 -1 -1  1]
[-1  1  1 -1  1 -1 -1 -1  1  1  1]
[ 1  1 -1  1 -1  1  1 -1 -1  1 -1]
[-1  1  1  1 -1  1  1 -1 -1  1 -1]
[ 1 -1 -1  1 -1 -1 -1  1  1 -1  1]
[-1  1  1 -1  1 -1 -1  1  1 -1  1]
[ 1 -1  1 -1  1  1  1 -1 -1  1 -1]
[-1  1 -1  1  1 -1 -1  1  1 -1  1]

======================================

     vertices:  11
        edges:  25
automorphisms:  1
graph6-string:  J?`DEEd{^v?

Adjacency matrix:
[0 0 0 0 1 0 1 1 1 1 1]
[0 0 0 0 0 1 0 1 0 1 1]
[0 0 0 0 0 0 1 0 1 1 1]
[0 0 0 0 0 0 0 0 0 1 1]
[1 0 0 0 0 0 0 0 0 0 1]
[0 1 0 0 0 0 0 0 1 0 0]
[1 0 1 0 0 0 0 1 0 0 1]
[1 1 0 0 0 0 1 0 1 1 1]
[1 0 1 0 0 1 0 1 0 1 1]
[1 1 1 1 0 0 0 1 1 0 0]
[1 1 1 1 1 0 1 1 1 0 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1 -1 -1  1 -1 -1  1  1  1 -1]
[-1  1 -1  1 -1  1  1  1 -1 -1  1]
[-1 -1  1  1 -1  1  1 -1  1 -1  1]
[-1  1  1  1  1 -1 -1 -1 -1  1  1]
[ 1 -1 -1  1  1  1 -1 -1  1 -1  1]
[-1  1  1 -1  1  1 -1 -1  1 -1  1]
[-1  1  1 -1 -1 -1  1  1 -1 -1  1]
[ 1  1 -1 -1 -1 -1  1  1 -1  1 -1]
[ 1 -1  1 -1  1  1 -1 -1  1  1 -1]
[ 1 -1 -1  1 -1 -1 -1  1  1  1 -1]
[-1  1  1  1  1  1  1 -1 -1 -1  1]

======================================

     vertices:  11
        edges:  25
automorphisms:  1
graph6-string:  J?`FDrh}CN_

Adjacency matrix:
[0 0 0 0 1 0 1 1 1 1 1]
[0 0 0 0 0 1 1 0 1 1 0]
[0 0 0 0 0 0 1 1 1 1 0]
[0 0 0 0 0 0 0 1 0 1 0]
[1 0 0 0 0 0 0 1 1 1 0]
[0 1 0 0 0 0 0 0 0 0 1]
[1 1 1 0 0 0 0 0 0 0 1]
[1 0 1 1 1 0 0 0 1 0 1]
[1 1 1 0 1 0 0 1 0 0 1]
[1 1 1 1 1 0 0 0 0 0 1]
[1 0 0 0 0 1 1 1 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1 -1 -1  1 -1  1 -1 -1  1  1]
[-1  1  1 -1  1  1 -1 -1  1  1 -1]
[-1  1  1  1 -1 -1  1  1  1 -1 -1]
[-1 -1  1  1 -1  1 -1  1 -1  1  1]
[ 1  1 -1 -1  1 -1 -1 -1  1  1 -1]
[-1  1 -1  1 -1  1 -1  1  1 -1  1]
[ 1 -1  1 -1 -1 -1  1 -1 -1  1  1]
[-1 -1  1  1 -1  1 -1  1  1 -1  1]
[-1  1  1 -1  1  1 -1  1  1 -1 -1]
[ 1  1 -1  1  1 -1  1 -1 -1  1 -1]
[ 1 -1 -1  1 -1  1  1  1 -1 -1  1]

======================================

     vertices:  11
        edges:  25
automorphisms:  2
graph6-string:  J?`F?}]xQV_

Adjacency matrix:
[0 0 0 0 1 0 1 0 1 1 0]
[0 0 0 0 0 1 1 0 0 1 1]
[0 0 0 0 0 0 1 0 0 1 0]
[0 0 0 0 0 0 0 1 1 0 0]
[1 0 0 0 0 0 0 1 1 0 1]
[0 1 0 0 0 0 0 1 1 1 0]
[1 1 1 0 0 0 0 1 1 0 1]
[0 0 0 1 1 1 1 0 0 1 1]
[1 0 0 1 1 1 1 0 0 0 1]
[1 1 1 0 0 1 0 1 0 0 1]
[0 1 0 0 1 0 1 1 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1  1 -1  1  1 -1 -1  1  1 -1]
[-1  1 -1 -1 -1  1  1 -1  1 -1  1]
[ 1 -1  1  1 -1 -1  1  1 -1  1 -1]
[-1 -1  1  1 -1  1  1  1  1 -1 -1]
[ 1 -1 -1 -1  1 -1 -1  1 -1  1  1]
[ 1  1 -1  1 -1  1 -1 -1  1  1 -1]
[-1  1  1  1 -1 -1  1 -1  1 -1  1]
[-1 -1  1  1  1 -1 -1  1 -1  1  1]
[ 1  1 -1  1 -1  1  1 -1  1 -1 -1]
[ 1 -1  1 -1  1  1 -1  1 -1  1 -1]
[-1  1 -1 -1  1 -1  1  1 -1 -1  1]

======================================

     vertices:  11
        edges:  25
automorphisms:  1
graph6-string:  J?`Df`jy_^_

Adjacency matrix:
[0 0 0 0 1 0 1 1 0 1 0]
[0 0 0 0 0 1 0 1 1 1 0]
[0 0 0 0 0 0 1 1 1 1 0]
[0 0 0 0 0 0 1 1 0 0 0]
[1 0 0 0 0 0 0 0 1 1 1]
[0 1 0 0 0 0 0 0 0 0 1]
[1 0 1 1 0 0 0 0 1 1 1]
[1 1 1 1 0 0 0 0 1 0 1]
[0 1 1 0 1 0 1 1 0 0 1]
[1 1 1 0 1 0 1 0 0 0 1]
[0 0 0 0 1 1 1 1 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1  1 -1  1  1 -1 -1  1 -1  1 -1]
[ 1  1  1 -1 -1  1 -1  1 -1  1 -1]
[-1  1  1 -1 -1 -1  1 -1  1  1 -1]
[ 1 -1 -1  1 -1  1  1  1 -1 -1  1]
[ 1 -1 -1 -1  1 -1 -1  1  1 -1  1]
[-1  1 -1  1 -1  1  1 -1 -1  1  1]
[-1 -1  1  1 -1  1  1 -1 -1  1  1]
[ 1  1 -1  1  1 -1 -1  1  1 -1 -1]
[-1 -1  1 -1  1 -1 -1  1  1 -1  1]
[ 1  1  1 -1 -1  1  1 -1 -1  1 -1]
[-1 -1 -1  1  1  1  1 -1  1 -1  1]

======================================

     vertices:  11
        edges:  25
automorphisms:  1
graph6-string:  J?b@d_lB~V_

Adjacency matrix:
[0 0 0 0 1 1 0 1 0 0 1]
[0 0 0 0 0 1 0 0 0 0 1]
[0 0 0 0 0 0 1 1 1 0 1]
[0 0 0 0 0 0 1 1 0 0 0]
[1 0 0 0 0 0 0 0 1 1 1]
[1 1 0 0 0 0 0 0 1 1 0]
[0 0 1 1 0 0 0 0 0 1 1]
[1 0 1 1 0 0 0 0 1 1 1]
[0 0 1 0 1 1 0 1 0 1 1]
[0 0 0 0 1 1 1 1 1 0 1]
[1 1 1 0 1 0 1 1 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1  1 -1  1  1 -1 -1  1 -1 -1  1]
[ 1  1  1 -1 -1  1  1 -1 -1 -1  1]
[-1  1  1 -1 -1 -1 -1  1  1 -1  1]
[ 1 -1 -1  1 -1  1  1  1 -1  1 -1]
[ 1 -1 -1 -1  1 -1  1 -1 -1  1  1]
[-1  1 -1  1 -1  1 -1  1  1  1 -1]
[-1  1 -1  1  1 -1  1 -1 -1  1  1]
[ 1 -1  1  1 -1  1 -1  1  1 -1 -1]
[-1 -1  1 -1 -1  1 -1  1  1  1 -1]
[-1 -1 -1  1  1  1  1 -1  1  1 -1]
[ 1  1  1 -1  1 -1  1 -1 -1 -1  1]

======================================

     vertices:  11
        edges:  25
automorphisms:  1
graph6-string:  J?b@fRJydb_

Adjacency matrix:
[0 0 0 0 1 1 0 1 1 1 1]
[0 0 0 0 0 1 0 1 1 1 0]
[0 0 0 0 0 0 1 1 0 1 1]
[0 0 0 0 0 0 1 0 0 0 1]
[1 0 0 0 0 0 0 1 1 1 0]
[1 1 0 0 0 0 0 0 0 0 0]
[0 0 1 1 0 0 0 0 1 1 0]
[1 1 1 0 1 0 0 0 1 0 1]
[1 1 0 0 1 0 1 1 0 0 1]
[1 1 1 0 1 0 1 0 0 0 1]
[1 0 1 1 0 0 0 1 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1 -1  1  1  1 -1 -1 -1  1  1]
[-1  1  1 -1 -1  1  1  1  1 -1 -1]
[-1  1  1 -1 -1 -1 -1  1 -1  1  1]
[ 1 -1 -1  1 -1  1  1 -1  1 -1  1]
[ 1 -1 -1 -1  1 -1  1 -1  1  1 -1]
[ 1  1 -1  1 -1  1 -1 -1 -1  1  1]
[-1  1 -1  1  1 -1  1 -1  1  1 -1]
[-1  1  1 -1 -1 -1 -1  1  1 -1  1]
[-1  1 -1  1  1 -1  1  1  1 -1 -1]
[ 1 -1  1 -1  1  1  1 -1 -1  1 -1]
[ 1 -1  1  1 -1  1 -1  1 -1 -1  1]

======================================

     vertices:  11
        edges:  25
automorphisms:  2
graph6-string:  J?bFB`uZeF_

Adjacency matrix:
[0 0 0 0 1 1 1 0 0 0 1]
[0 0 0 0 0 1 1 1 1 1 1]
[0 0 0 0 0 0 1 1 1 1 0]
[0 0 0 0 0 0 0 1 1 0 0]
[1 0 0 0 0 0 0 0 0 1 0]
[1 1 0 0 0 0 0 0 1 1 0]
[1 1 1 0 0 0 0 0 1 1 1]
[0 1 1 1 0 0 0 0 0 0 1]
[0 1 1 1 0 1 1 0 0 0 1]
[0 1 1 0 1 1 1 0 0 0 1]
[1 1 0 0 0 0 1 1 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1 -1  1  1 -1  1 -1  1 -1  1]
[-1  1 -1 -1 -1  1 -1  1 -1  1  1]
[-1 -1  1  1  1 -1  1 -1  1  1 -1]
[ 1 -1  1  1  1  1 -1  1  1 -1 -1]
[ 1 -1  1  1  1  1 -1  1 -1  1 -1]
[-1  1 -1  1  1  1 -1 -1  1  1 -1]
[ 1 -1  1 -1 -1 -1  1 -1  1 -1  1]
[-1  1 -1  1  1 -1 -1  1 -1  1  1]
[ 1 -1  1  1 -1  1  1 -1  1 -1 -1]
[-1  1  1 -1  1  1 -1  1 -1  1 -1]
[ 1  1 -1 -1 -1 -1  1  1 -1 -1  1]

======================================

     vertices:  11
        edges:  25
automorphisms:  1
graph6-string:  J?`bErsvBp_

Adjacency matrix:
[0 0 0 0 1 0 0 1 1 1 0]
[0 0 0 0 0 1 1 1 1 1 1]
[0 0 0 0 0 1 1 0 1 0 1]
[0 0 0 0 0 0 0 1 1 1 1]
[1 0 0 0 0 0 0 1 0 1 1]
[0 1 1 0 0 0 0 0 1 1 0]
[0 1 1 0 0 0 0 0 0 0 0]
[1 1 0 1 1 0 0 0 0 0 0]
[1 1 1 1 0 1 0 0 0 0 1]
[1 1 0 1 1 1 0 0 0 0 1]
[0 1 1 1 1 0 0 0 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1  1 -1  1  1 -1  1  1 -1 -1]
[-1  1 -1  1 -1  1  1  1 -1  1 -1]
[ 1 -1  1 -1  1 -1  1 -1  1 -1  1]
[-1  1 -1  1 -1 -1 -1  1  1 -1  1]
[ 1 -1  1 -1  1 -1  1 -1 -1  1  1]
[ 1  1 -1 -1 -1  1 -1 -1  1  1 -1]
[-1  1  1 -1  1 -1  1  1 -1 -1  1]
[ 1  1 -1  1 -1 -1  1  1  1 -1 -1]
[ 1 -1  1  1 -1  1 -1  1  1 -1 -1]
[-1  1 -1 -1  1  1 -1 -1 -1  1  1]
[-1 -1  1  1  1 -1  1 -1 -1  1  1]

======================================

     vertices:  11
        edges:  25
automorphisms:  2
graph6-string:  J?`afbT|BR_

Adjacency matrix:
[0 0 0 0 1 0 0 1 1 1 0]
[0 0 0 0 0 1 1 1 1 1 1]
[0 0 0 0 0 1 0 1 0 1 1]
[0 0 0 0 0 0 1 1 1 1 0]
[1 0 0 0 0 0 0 0 0 0 1]
[0 1 1 0 0 0 0 0 1 1 0]
[0 1 0 1 0 0 0 0 0 0 0]
[1 1 1 1 0 0 0 0 1 0 1]
[1 1 0 1 0 1 0 1 0 0 1]
[1 1 1 1 0 1 0 0 0 0 1]
[0 1 1 0 1 0 0 1 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1 -1  1  1  1 -1 -1  1  1 -1]
[-1  1 -1 -1  1  1  1 -1  1 -1  1]
[-1 -1  1  1 -1 -1 -1  1 -1  1  1]
[ 1 -1  1  1 -1 -1  1  1 -1  1 -1]
[ 1  1 -1 -1  1 -1  1 -1 -1  1  1]
[ 1  1 -1 -1 -1  1 -1 -1  1  1 -1]
[-1  1 -1  1  1 -1  1 -1 -1  1  1]
[-1 -1  1  1 -1 -1 -1  1  1 -1  1]
[ 1  1 -1 -1 -1  1 -1  1  1 -1 -1]
[ 1 -1  1  1  1  1  1 -1 -1  1 -1]
[-1  1  1 -1  1 -1  1  1 -1 -1  1]

======================================

     vertices:  11
        edges:  25
automorphisms:  1
graph6-string:  J?`ebPy}Eb_

Adjacency matrix:
[0 0 0 0 1 0 1 0 0 1 1]
[0 0 0 0 0 1 1 1 1 1 1]
[0 0 0 0 0 1 0 1 1 1 0]
[0 0 0 0 0 0 1 0 1 1 1]
[1 0 0 0 0 0 0 1 1 1 0]
[0 1 1 0 0 0 0 0 0 0 0]
[1 1 0 1 0 0 0 0 1 0 0]
[0 1 1 0 1 0 0 0 0 0 1]
[0 1 1 1 1 0 1 0 0 0 1]
[1 1 1 1 1 0 0 0 0 0 1]
[1 1 0 1 0 0 0 1 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1  1 -1 -1  1  1  1 -1 -1  1 -1]
[ 1  1 -1 -1 -1  1  1  1 -1 -1  1]
[-1 -1  1  1  1  1 -1 -1  1  1 -1]
[-1 -1  1  1 -1 -1 -1 -1  1  1  1]
[ 1 -1  1 -1  1 -1  1  1  1 -1 -1]
[ 1  1  1 -1 -1  1  1 -1 -1  1 -1]
[ 1  1 -1 -1  1  1  1 -1  1 -1 -1]
[-1  1 -1 -1  1 -1 -1  1  1 -1  1]
[-1 -1  1  1  1 -1  1  1  1 -1 -1]
[ 1 -1  1  1 -1  1 -1 -1 -1  1  1]
[-1  1 -1  1 -1 -1 -1  1 -1  1  1]

======================================

     vertices:  11
        edges:  29
automorphisms:  12
graph6-string:  J?AEDFv~v^?

Adjacency matrix:
[0 0 0 0 0 1 1 1 1 1 1]
[0 0 0 0 0 0 1 0 1 1 1]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 0 1 1 0]
[0 0 0 0 0 0 0 0 0 1 1]
[1 0 0 0 0 0 0 0 1 1 1]
[1 1 0 0 0 0 0 1 1 1 1]
[1 0 1 0 0 0 1 0 1 1 1]
[1 1 1 1 0 1 1 1 0 0 1]
[1 1 1 1 1 1 1 1 0 0 0]
[1 1 1 0 1 1 1 1 1 0 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1 -1 -1 -1  1  1  1 -1  1 -1]
[-1  1 -1  1  1 -1  1 -1  1 -1  1]
[-1 -1  1  1  1 -1 -1  1  1 -1  1]
[-1  1  1  1 -1  1 -1 -1  1  1 -1]
[-1  1  1 -1  1  1 -1 -1 -1  1  1]
[ 1 -1 -1  1  1  1 -1 -1  1 -1  1]
[ 1  1 -1 -1 -1 -1  1  1 -1  1 -1]
[ 1 -1  1 -1 -1 -1  1  1 -1  1 -1]
[-1  1  1  1 -1  1 -1 -1  1 -1  1]
[ 1 -1 -1  1  1 -1  1  1 -1  1 -1]
[-1  1  1 -1  1  1 -1 -1  1 -1  1]

======================================

     vertices:  11
        edges:  29
automorphisms:  1
graph6-string:  J?BDDjs~u~?

Adjacency matrix:
[0 0 0 0 0 1 1 1 1 1 1]
[0 0 0 0 0 1 0 0 1 1 1]
[0 0 0 0 0 0 1 1 1 1 0]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 0 0 1 1]
[1 1 0 0 0 0 0 1 1 1 1]
[1 0 1 0 0 0 0 0 0 1 1]
[1 0 1 1 0 1 0 0 0 1 1]
[1 1 1 1 0 1 0 0 0 0 1]
[1 1 1 1 1 1 1 1 0 0 0]
[1 1 0 1 1 1 1 1 1 0 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1 -1 -1 -1  1  1  1 -1 -1  1]
[-1  1  1 -1  1  1 -1 -1  1  1 -1]
[-1  1  1  1 -1 -1  1 -1  1  1 -1]
[-1 -1  1  1  1 -1 -1  1  1 -1  1]
[-1  1 -1  1  1 -1  1 -1 -1  1  1]
[ 1  1 -1 -1 -1  1 -1  1 -1  1 -1]
[ 1 -1  1 -1  1 -1  1 -1  1 -1  1]
[ 1 -1 -1  1 -1  1 -1  1 -1  1 -1]
[-1  1  1  1 -1 -1  1 -1  1 -1  1]
[-1  1  1 -1  1  1 -1  1 -1  1 -1]
[ 1 -1 -1  1  1 -1  1 -1  1 -1  1]

======================================

     vertices:  11
        edges:  29
automorphisms:  2
graph6-string:  J?BDLjJzvl_

Adjacency matrix:
[0 0 0 0 0 1 1 1 1 1 1]
[0 0 0 0 0 1 0 0 1 1 1]
[0 0 0 0 0 0 1 1 0 1 1]
[0 0 0 0 0 0 0 1 0 0 1]
[0 0 0 0 0 0 0 0 1 1 0]
[1 1 0 0 0 0 1 1 0 1 1]
[1 0 1 0 0 1 0 0 1 1 1]
[1 0 1 1 0 1 0 0 1 1 0]
[1 1 0 0 1 0 1 1 0 0 1]
[1 1 1 0 1 1 1 1 0 0 1]
[1 1 1 1 0 1 1 0 1 1 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1 -1 -1 -1  1  1  1  1 -1 -1]
[-1  1 -1  1  1  1 -1 -1 -1  1  1]
[-1 -1  1  1  1 -1  1 -1 -1  1  1]
[-1  1  1  1 -1 -1 -1  1  1 -1  1]
[-1  1  1 -1  1 -1 -1  1  1  1 -1]
[ 1  1 -1 -1 -1  1 -1  1 -1  1 -1]
[ 1 -1  1 -1 -1 -1  1 -1  1 -1  1]
[ 1 -1 -1  1  1  1 -1  1 -1  1 -1]
[ 1 -1 -1  1  1 -1  1 -1  1 -1  1]
[-1  1  1 -1  1  1 -1  1 -1  1 -1]
[-1  1  1  1 -1 -1  1 -1  1 -1  1]

======================================

     vertices:  11
        edges:  29
automorphisms:  1
graph6-string:  J?BDLjuuv}?

Adjacency matrix:
[0 0 0 0 0 1 1 1 1 1 1]
[0 0 0 0 0 1 0 0 1 1 1]
[0 0 0 0 0 0 1 1 1 0 1]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 0 0 1 1]
[1 1 0 0 0 0 1 1 1 0 1]
[1 0 1 0 0 1 0 0 1 1 1]
[1 0 1 1 0 1 0 0 0 1 1]
[1 1 1 1 0 1 1 0 0 0 0]
[1 1 0 1 1 0 1 1 0 0 0]
[1 1 1 1 1 1 1 1 0 0 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1 -1 -1 -1  1  1  1 -1  1 -1]
[-1  1 -1  1  1  1 -1 -1  1 -1  1]
[-1 -1  1  1  1 -1  1 -1  1 -1  1]
[-1  1  1  1 -1 -1 -1  1  1  1 -1]
[-1  1  1 -1  1 -1  1 -1 -1  1  1]
[ 1  1 -1 -1 -1  1 -1  1 -1 -1  1]
[ 1 -1  1 -1  1 -1  1 -1  1  1 -1]
[ 1 -1 -1  1 -1  1 -1  1 -1 -1  1]
[-1  1  1  1 -1 -1  1 -1  1  1 -1]
[ 1 -1 -1  1  1 -1  1 -1  1  1 -1]
[-1  1  1 -1  1  1 -1  1 -1 -1  1]

======================================

     vertices:  11
        edges:  29
automorphisms:  1
graph6-string:  J?bERZk~F|?

Adjacency matrix:
[0 0 0 0 1 1 1 0 1 1 1]
[0 0 0 0 0 1 1 1 1 1 1]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 0 0 1 1]
[1 0 0 0 0 0 1 1 1 1 1]
[1 1 0 0 0 0 0 1 1 1 1]
[1 1 0 0 1 0 0 0 0 0 1]
[0 1 1 0 1 1 0 0 0 0 0]
[1 1 1 0 1 1 0 0 0 0 1]
[1 1 1 1 1 1 0 0 0 0 0]
[1 1 1 1 1 1 1 0 1 0 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1 -1 -1  1  1 -1 -1  1  1 -1]
[-1  1 -1  1 -1  1  1  1 -1 -1  1]
[-1 -1  1  1  1 -1 -1  1  1 -1  1]
[-1  1  1  1 -1 -1  1 -1 -1  1  1]
[ 1 -1  1 -1  1 -1  1  1 -1  1 -1]
[ 1  1 -1 -1 -1  1 -1 -1  1  1 -1]
[-1  1 -1  1  1 -1  1  1 -1 -1  1]
[-1  1  1 -1  1 -1  1  1 -1  1 -1]
[ 1 -1  1 -1 -1  1 -1 -1  1 -1  1]
[ 1 -1 -1  1  1  1 -1  1 -1  1 -1]
[-1  1  1  1 -1 -1  1 -1  1 -1  1]

======================================

     vertices:  11
        edges:  29
automorphisms:  1
graph6-string:  J?bERZk|Vn?

Adjacency matrix:
[0 0 0 0 1 1 1 0 1 1 1]
[0 0 0 0 0 1 1 1 1 1 1]
[0 0 0 0 0 0 0 1 1 1 1]
[0 0 0 0 0 0 0 0 0 1 1]
[1 0 0 0 0 0 1 1 1 0 0]
[1 1 0 0 0 0 0 1 1 1 1]
[1 1 0 0 1 0 0 0 0 0 1]
[0 1 1 0 1 1 0 0 0 1 1]
[1 1 1 0 1 1 0 0 0 0 1]
[1 1 1 1 0 1 0 1 0 0 0]
[1 1 1 1 0 1 1 1 1 0 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1 -1  1  1  1 -1 -1  1  1 -1]
[-1  1 -1 -1 -1  1  1  1 -1 -1  1]
[-1 -1  1  1  1 -1 -1  1  1 -1  1]
[ 1 -1  1  1 -1 -1  1 -1 -1  1  1]
[ 1 -1  1 -1  1 -1  1  1 -1  1 -1]
[ 1  1 -1 -1 -1  1 -1 -1  1  1 -1]
[-1  1 -1  1  1 -1  1  1 -1 -1  1]
[-1  1  1 -1  1 -1  1  1 -1  1 -1]
[ 1 -1  1 -1 -1  1 -1 -1  1 -1  1]
[ 1 -1 -1  1  1  1 -1  1 -1  1 -1]
[-1  1  1  1 -1 -1  1 -1  1 -1  1]

======================================

     vertices:  11
        edges:  29
automorphisms:  2
graph6-string:  J?bb]rw~Ex?

Adjacency matrix:
[0 0 0 0 1 1 0 1 1 1 1]
[0 0 0 0 0 1 1 1 1 1 1]
[0 0 0 0 0 1 1 0 1 1 0]
[0 0 0 0 0 0 0 1 1 1 1]
[1 0 0 0 0 0 1 1 1 1 1]
[1 1 1 0 0 0 1 0 0 1 1]
[0 1 1 0 1 1 0 0 0 0 0]
[1 1 0 1 1 0 0 0 0 0 0]
[1 1 1 1 1 0 0 0 0 0 1]
[1 1 1 1 1 1 0 0 0 0 0]
[1 1 0 1 1 1 0 0 1 0 0]

(2x)Inverse of the Adjacency matrix:
[ 1 -1 -1 -1  1  1 -1 -1 -1  1  1]
[-1  1 -1  1 -1  1  1  1 -1 -1  1]
[-1 -1  1  1  1 -1  1 -1  1  1 -1]
[-1  1  1  1 -1 -1 -1  1  1  1 -1]
[ 1 -1  1 -1  1 -1  1  1  1 -1 -1]
[ 1  1 -1 -1 -1  1 -1 -1 -1  1  1]
[-1  1  1 -1  1 -1  1  1  1 -1 -1]
[-1  1 -1  1  1 -1  1  1 -1  1 -1]
[-1 -1  1  1  1 -1  1 -1  1 -1  1]
[ 1 -1  1  1 -1  1 -1  1 -1  1 -1]
[ 1  1 -1 -1 -1  1 -1 -1  1 -1  1]

======================================