invariantListing.dat

605
0 1 1 number vertices of graph
0 1 2 one
0 1 3 two
0 2 0 max degree of graph
0 2 1 min degree of graph
0 2 2 avg degree of graph
0 2 3 number of distinct degrees of graph
0 2 4 sum of degrees of graph
0 2 5 length of degrees of graph
0 2 6 (n mod max degree)  of graph
0 2 7 max_mode of degrees of graph
0 2 8 min_mode of degrees of graph
0 2 9 number of distinct modes of degree of graph
0 2 10 max_minimode of degrees of graph
0 2 11 min_minimode of degrees of graph
0 2 12 number of distinct minimodes of degree of graph
0 2 13 number of min degree vertices of graph
0 2 13 number of edges in G[min degree vertices] of graph
0 2 13 longest induced cycle in G[min degree vertices] of graph
0 2 13 longest induced path in G[min degree vertices] of graph
0 2 13 number of isolates of G[min degree vertices] of graph
0 2 13 min deg of G[min degree vertices] of graph
0 2 13 max deg of G[min degree vertices] of graph
0 2 13 avg deg of G[min degree vertices] of graph
0 2 13 number of components of G[min degree vertices] of graph
0 2 13 order of a largest component of G[min degree vertices] of graph
0 2 13 order of PrivNeigh set of min degree vertices of graph
0 2 13 number of edges between min degree verticesand its co-set  of graph
0 2 13 independence number of G[min degree vertices] of graph
0 2 13 clique number of G[min degree vertices] of graph
0 2 13 domination number of G[min degree vertices] of graph
0 2 13 matching number of G[min degree vertices ] of graph
0 2 14 number of max degree vertices of graph
0 2 14 number of edges in G[max degree vertices] of graph
0 2 14 longest induced cycle in G[max degree vertices] of graph
0 2 14 longest induced path in G[max degree vertices] of graph
0 2 14 number of isolates of G[max degree vertices] of graph
0 2 14 min deg of G[max degree vertices] of graph
0 2 14 max deg of G[max degree vertices] of graph
0 2 14 avg deg of G[max degree vertices] of graph
0 2 14 number of components of G[max degree vertices] of graph
0 2 14 order of a largest component of G[max degree vertices] of graph
0 2 14 order of PrivNeigh set of max degree vertices of graph
0 2 14 number of edges between max degree verticesand its co-set  of graph
0 2 14 independence number of G[max degree vertices] of graph
0 2 14 clique number of G[max degree vertices] of graph
0 2 14 domination number of G[max degree vertices] of graph
0 2 14 matching number of G[max degree vertices ] of graph
0 2 15 frequency of modal degree of graph
0 2 16 frequency of minimodal degree of graph
0 2 17 number of isolated vertices of graph
0 2 19 2nd largest in set of degrees of graph
0 2 20 2nd smallest in set of degrees of graph
0 2 21 2nd largest in sequence of degrees of graph
0 2 22 2nd smallest in sequence of degrees of graph
0 2 23 Number of even degrees in set of degrees of graph
0 2 24 max of even degrees of graph
0 2 25 max mode of even degrees of graph
0 2 26 sum of even degrees in sequence of graph
0 2 27 min of even degrees of graph
0 2 28 number of even degrees in the degree sequence  of graph
0 2 29 number of odd degrees in the degree sequence  of graph
0 2 30 (n mod 5) of graph
0 2 31 (n mod 4) of graph
0 2 32 (n mod 3) of graph
0 2 33 (n mod 2) of graph
0 2 34 residue of graph
0 2 35 number of N(min degree vertices) of graph
0 2 35 number of edges in G[N(min degree vertices)] of graph
0 2 35 longest induced cycle in G[N(min degree vertices)] of graph
0 2 35 longest induced path in G[N(min degree vertices)] of graph
0 2 35 number of isolates of G[N(min degree vertices)] of graph
0 2 35 min deg of G[N(min degree vertices)] of graph
0 2 35 max deg of G[N(min degree vertices)] of graph
0 2 35 avg deg of G[N(min degree vertices)] of graph
0 2 35 number of components of G[N(min degree vertices)] of graph
0 2 35 order of a largest component of G[N(min degree vertices)] of graph
0 2 35 order of PrivNeigh set of N(min degree vertices) of graph
0 2 35 number of edges between N(min degree vertices)and its co-set  of graph
0 2 35 independence number of G[N(min degree vertices)] of graph
0 2 35 clique number of G[N(min degree vertices)] of graph
0 2 35 domination number of G[N(min degree vertices)] of graph
0 2 35 matching number of G[N(min degree vertices) ] of graph
0 2 36 number of N[min degree vertices] of graph
0 2 36 number of edges in G[N[min degree vertices]] of graph
0 2 36 longest induced cycle in G[N[min degree vertices]] of graph
0 2 36 longest induced path in G[N[min degree vertices]] of graph
0 2 36 number of isolates of G[N[min degree vertices]] of graph
0 2 36 min deg of G[N[min degree vertices]] of graph
0 2 36 max deg of G[N[min degree vertices]] of graph
0 2 36 avg deg of G[N[min degree vertices]] of graph
0 2 36 number of components of G[N[min degree vertices]] of graph
0 2 36 order of a largest component of G[N[min degree vertices]] of graph
0 2 36 order of PrivNeigh set of N[min degree vertices] of graph
0 2 36 number of edges between N[min degree vertices]and its co-set  of graph
0 2 36 independence number of G[N[min degree vertices]] of graph
0 2 36 clique number of G[N[min degree vertices]] of graph
0 2 36 domination number of G[N[min degree vertices]] of graph
0 2 36 matching number of G[N[min degree vertices] ] of graph
0 2 37 number of N(min)-(min) of graph
0 2 37 number of edges in G[N(min)-(min)] of graph
0 2 37 longest induced cycle in G[N(min)-(min)] of graph
0 2 37 longest induced path in G[N(min)-(min)] of graph
0 2 37 number of isolates of G[N(min)-(min)] of graph
0 2 37 min deg of G[N(min)-(min)] of graph
0 2 37 max deg of G[N(min)-(min)] of graph
0 2 37 avg deg of G[N(min)-(min)] of graph
0 2 37 number of components of G[N(min)-(min)] of graph
0 2 37 order of a largest component of G[N(min)-(min)] of graph
0 2 37 order of PrivNeigh set of N(min)-(min) of graph
0 2 37 number of edges between N(min)-(min)and its co-set  of graph
0 2 37 independence number of G[N(min)-(min)] of graph
0 2 37 clique number of G[N(min)-(min)] of graph
0 2 37 domination number of G[N(min)-(min)] of graph
0 2 37 matching number of G[N(min)-(min) ] of graph
0 2 38 number of N(max degree vertices) of graph
0 2 38 number of edges in G[N(max degree vertices)] of graph
0 2 38 longest induced cycle in G[N(max degree vertices)] of graph
0 2 38 longest induced path in G[N(max degree vertices)] of graph
0 2 38 number of isolates of G[N(max degree vertices)] of graph
0 2 38 min deg of G[N(max degree vertices)] of graph
0 2 38 max deg of G[N(max degree vertices)] of graph
0 2 38 avg deg of G[N(max degree vertices)] of graph
0 2 38 number of components of G[N(max degree vertices)] of graph
0 2 38 order of a largest component of G[N(max degree vertices)] of graph
0 2 38 order of PrivNeigh set of N(max degree vertices) of graph
0 2 38 number of edges between N(max degree vertices)and its co-set  of graph
0 2 38 independence number of G[N(max degree vertices)] of graph
0 2 38 clique number of G[N(max degree vertices)] of graph
0 2 38 domination number of G[N(max degree vertices)] of graph
0 2 38 matching number of G[N(max degree vertices) ] of graph
0 2 39 number of N[max degree vertices] of graph
0 2 39 number of edges in G[N[max degree vertices]] of graph
0 2 39 longest induced cycle in G[N[max degree vertices]] of graph
0 2 39 longest induced path in G[N[max degree vertices]] of graph
0 2 39 number of isolates of G[N[max degree vertices]] of graph
0 2 39 min deg of G[N[max degree vertices]] of graph
0 2 39 max deg of G[N[max degree vertices]] of graph
0 2 39 avg deg of G[N[max degree vertices]] of graph
0 2 39 number of components of G[N[max degree vertices]] of graph
0 2 39 order of a largest component of G[N[max degree vertices]] of graph
0 2 39 order of PrivNeigh set of N[max degree vertices] of graph
0 2 39 number of edges between N[max degree vertices]and its co-set  of graph
0 2 39 independence number of G[N[max degree vertices]] of graph
0 2 39 clique number of G[N[max degree vertices]] of graph
0 2 39 domination number of G[N[max degree vertices]] of graph
0 2 39 matching number of G[N[max degree vertices] ] of graph
0 2 40 number of N(Max)-{Max} of graph
0 2 40 number of edges in G[N(Max)-{Max}] of graph
0 2 40 longest induced cycle in G[N(Max)-{Max}] of graph
0 2 40 longest induced path in G[N(Max)-{Max}] of graph
0 2 40 number of isolates of G[N(Max)-{Max}] of graph
0 2 40 min deg of G[N(Max)-{Max}] of graph
0 2 40 max deg of G[N(Max)-{Max}] of graph
0 2 40 avg deg of G[N(Max)-{Max}] of graph
0 2 40 number of components of G[N(Max)-{Max}] of graph
0 2 40 order of a largest component of G[N(Max)-{Max}] of graph
0 2 40 order of PrivNeigh set of N(Max)-{Max} of graph
0 2 40 number of edges between N(Max)-{Max}and its co-set  of graph
0 2 40 independence number of G[N(Max)-{Max}] of graph
0 2 40 clique number of G[N(Max)-{Max}] of graph
0 2 40 domination number of G[N(Max)-{Max}] of graph
0 2 40 matching number of G[N(Max)-{Max} ] of graph
0 2 41 number of non-min degree vertices of graph
0 2 41 number of edges in G[non-min degree vertices] of graph
0 2 41 longest induced cycle in G[non-min degree vertices] of graph
0 2 41 longest induced path in G[non-min degree vertices] of graph
0 2 41 number of isolates of G[non-min degree vertices] of graph
0 2 41 min deg of G[non-min degree vertices] of graph
0 2 41 max deg of G[non-min degree vertices] of graph
0 2 41 avg deg of G[non-min degree vertices] of graph
0 2 41 number of components of G[non-min degree vertices] of graph
0 2 41 order of a largest component of G[non-min degree vertices] of graph
0 2 41 order of PrivNeigh set of non-min degree vertices of graph
0 2 41 number of edges between non-min degree verticesand its co-set  of graph
0 2 41 independence number of G[non-min degree vertices] of graph
0 2 41 clique number of G[non-min degree vertices] of graph
0 2 41 domination number of G[non-min degree vertices] of graph
0 2 41 matching number of G[non-min degree vertices ] of graph
0 2 42 number of non-max degree vertices of graph
0 2 42 number of edges in G[non-max degree vertices] of graph
0 2 42 longest induced cycle in G[non-max degree vertices] of graph
0 2 42 longest induced path in G[non-max degree vertices] of graph
0 2 42 number of isolates of G[non-max degree vertices] of graph
0 2 42 min deg of G[non-max degree vertices] of graph
0 2 42 max deg of G[non-max degree vertices] of graph
0 2 42 avg deg of G[non-max degree vertices] of graph
0 2 42 number of components of G[non-max degree vertices] of graph
0 2 42 order of a largest component of G[non-max degree vertices] of graph
0 2 42 order of PrivNeigh set of non-max degree vertices of graph
0 2 42 number of edges between non-max degree verticesand its co-set  of graph
0 2 42 independence number of G[non-max degree vertices] of graph
0 2 42 clique number of G[non-max degree vertices] of graph
0 2 42 domination number of G[non-max degree vertices] of graph
0 2 42 matching number of G[non-max degree vertices ] of graph
0 2 43 Caro-Wei of graph
0 2 44 sum of inverses of degrees of graph
0 2 45 nonzero minimum of maximum{k, freq of degree k} of graph
0 2 46 maximum of minimum{k, freq of degree k} of graph
0 2 47 frequency of 2nd smallest degree in degree sequence of graph
0 2 48 frequency of 2nd largest degree in degree sequence of graph
0 2 49 number of balanced edges of graph
0 2 50 number of dd-critical vertices of graph
0 2 51 median degree of graph
0 2 52 lower_median degree of graph
0 2 53 upper_median degree of graph
0 2 54 1st_quartile degree of graph
0 2 55 upper 1st_quartile degree of graph
0 2 56 lower 1st_quartile degree of graph
0 2 57 max of degree sums of nonadjacent pairs of vertices of graph
0 2 58 min of degree sums of nonadjacent pairs of vertices of graph
0 2 59 weighted median of graph
0 2 60 annihilation number of graph
0 2 61 kthStep for a zero in Havil-Hakimi of graph
0 2 62 max number of edges horizontal to a vertex of graph
0 2 62 min number of edges horizontal to a vertex of graph
0 2 63 avg number of edges horizontal to a vertex of graph
0 2 65 number of degree 2 vertices of graph
0 2 65 number of edges in G[degree 2 vertices] of graph
0 2 65 longest induced cycle in G[degree 2 vertices] of graph
0 2 65 longest induced path in G[degree 2 vertices] of graph
0 2 65 number of isolates of G[degree 2 vertices] of graph
0 2 65 min deg of G[degree 2 vertices] of graph
0 2 65 max deg of G[degree 2 vertices] of graph
0 2 65 avg deg of G[degree 2 vertices] of graph
0 2 65 number of components of G[degree 2 vertices] of graph
0 2 65 order of a largest component of G[degree 2 vertices] of graph
0 2 65 order of PrivNeigh set of degree 2 vertices of graph
0 2 65 number of edges between degree 2 verticesand its co-set  of graph
0 2 65 independence number of G[degree 2 vertices] of graph
0 2 65 clique number of G[degree 2 vertices] of graph
0 2 65 domination number of G[degree 2 vertices] of graph
0 2 65 matching number of G[degree 2 vertices ] of graph
0 2 66 number of N[degree 2 vertices] of graph
0 2 66 number of edges in G[N[degree 2 vertices]] of graph
0 2 66 longest induced cycle in G[N[degree 2 vertices]] of graph
0 2 66 longest induced path in G[N[degree 2 vertices]] of graph
0 2 66 number of isolates of G[N[degree 2 vertices]] of graph
0 2 66 min deg of G[N[degree 2 vertices]] of graph
0 2 66 max deg of G[N[degree 2 vertices]] of graph
0 2 66 avg deg of G[N[degree 2 vertices]] of graph
0 2 66 number of components of G[N[degree 2 vertices]] of graph
0 2 66 order of a largest component of G[N[degree 2 vertices]] of graph
0 2 66 order of PrivNeigh set of N[degree 2 vertices] of graph
0 2 66 number of edges between N[degree 2 vertices]and its co-set  of graph
0 2 66 independence number of G[N[degree 2 vertices]] of graph
0 2 66 clique number of G[N[degree 2 vertices]] of graph
0 2 66 domination number of G[N[degree 2 vertices]] of graph
0 2 66 matching number of G[N[degree 2 vertices] ] of graph
0 2 67 number of N(degree 2 vertices) of graph
0 2 67 number of edges in G[N(degree 2 vertices)] of graph
0 2 67 longest induced cycle in G[N(degree 2 vertices)] of graph
0 2 67 longest induced path in G[N(degree 2 vertices)] of graph
0 2 67 number of isolates of G[N(degree 2 vertices)] of graph
0 2 67 min deg of G[N(degree 2 vertices)] of graph
0 2 67 max deg of G[N(degree 2 vertices)] of graph
0 2 67 avg deg of G[N(degree 2 vertices)] of graph
0 2 67 number of components of G[N(degree 2 vertices)] of graph
0 2 67 order of a largest component of G[N(degree 2 vertices)] of graph
0 2 67 order of PrivNeigh set of N(degree 2 vertices) of graph
0 2 67 number of edges between N(degree 2 vertices)and its co-set  of graph
0 2 67 independence number of G[N(degree 2 vertices)] of graph
0 2 67 clique number of G[N(degree 2 vertices)] of graph
0 2 67 domination number of G[N(degree 2 vertices)] of graph
0 2 67 matching number of G[N(degree 2 vertices) ] of graph
0 2 68 number of N(degree 2 vertices) - {degree 2 vertices} of graph
0 2 68 number of edges in G[N(degree 2 vertices) - {degree 2 vertices}] of graph
0 2 68 longest induced cycle in G[N(degree 2 vertices) - {degree 2 vertices}] of graph
0 2 68 longest induced path in G[N(degree 2 vertices) - {degree 2 vertices}] of graph
0 2 68 number of isolates of G[N(degree 2 vertices) - {degree 2 vertices}] of graph
0 2 68 min deg of G[N(degree 2 vertices) - {degree 2 vertices}] of graph
0 2 68 max deg of G[N(degree 2 vertices) - {degree 2 vertices}] of graph
0 2 68 avg deg of G[N(degree 2 vertices) - {degree 2 vertices}] of graph
0 2 68 number of components of G[N(degree 2 vertices) - {degree 2 vertices}] of graph
0 2 68 order of a largest component of G[N(degree 2 vertices) - {degree 2 vertices}] of graph
0 2 68 order of PrivNeigh set of N(degree 2 vertices) - {degree 2 vertices} of graph
0 2 68 number of edges between N(degree 2 vertices) - {degree 2 vertices}and its co-set  of graph
0 2 68 independence number of G[N(degree 2 vertices) - {degree 2 vertices}] of graph
0 2 68 clique number of G[N(degree 2 vertices) - {degree 2 vertices}] of graph
0 2 68 domination number of G[N(degree 2 vertices) - {degree 2 vertices}] of graph
0 2 68 matching number of G[N(degree 2 vertices) - {degree 2 vertices} ] of graph
0 2 69 number of non-degree 2 vertices of graph
0 2 69 number of edges in G[non-degree 2 vertices] of graph
0 2 69 longest induced cycle in G[non-degree 2 vertices] of graph
0 2 69 longest induced path in G[non-degree 2 vertices] of graph
0 2 69 number of isolates of G[non-degree 2 vertices] of graph
0 2 69 min deg of G[non-degree 2 vertices] of graph
0 2 69 max deg of G[non-degree 2 vertices] of graph
0 2 69 avg deg of G[non-degree 2 vertices] of graph
0 2 69 number of components of G[non-degree 2 vertices] of graph
0 2 69 order of a largest component of G[non-degree 2 vertices] of graph
0 2 69 order of PrivNeigh set of non-degree 2 vertices of graph
0 2 69 number of edges between non-degree 2 verticesand its co-set  of graph
0 2 69 independence number of G[non-degree 2 vertices] of graph
0 2 69 clique number of G[non-degree 2 vertices] of graph
0 2 69 domination number of G[non-degree 2 vertices] of graph
0 2 69 matching number of G[non-degree 2 vertices ] of graph
0 2 70 number of V(G) - N(degree 2 vertices) of graph
0 2 70 number of edges in G[V(G) - N(degree 2 vertices)] of graph
0 2 70 longest induced cycle in G[V(G) - N(degree 2 vertices)] of graph
0 2 70 longest induced path in G[V(G) - N(degree 2 vertices)] of graph
0 2 70 number of isolates of G[V(G) - N(degree 2 vertices)] of graph
0 2 70 min deg of G[V(G) - N(degree 2 vertices)] of graph
0 2 70 max deg of G[V(G) - N(degree 2 vertices)] of graph
0 2 70 avg deg of G[V(G) - N(degree 2 vertices)] of graph
0 2 70 number of components of G[V(G) - N(degree 2 vertices)] of graph
0 2 70 order of a largest component of G[V(G) - N(degree 2 vertices)] of graph
0 2 70 order of PrivNeigh set of V(G) - N(degree 2 vertices) of graph
0 2 70 number of edges between V(G) - N(degree 2 vertices)and its co-set  of graph
0 2 70 independence number of G[V(G) - N(degree 2 vertices)] of graph
0 2 70 clique number of G[V(G) - N(degree 2 vertices)] of graph
0 2 70 domination number of G[V(G) - N(degree 2 vertices)] of graph
0 2 70 matching number of G[V(G) - N(degree 2 vertices) ] of graph
0 2 71 number of pendants of graph
0 2 72 number of N(pendants) of graph
0 2 72 number of edges in G[N(pendants)] of graph
0 2 72 longest induced cycle in G[N(pendants)] of graph
0 2 72 longest induced path in G[N(pendants)] of graph
0 2 72 number of isolates of G[N(pendants)] of graph
0 2 72 min deg of G[N(pendants)] of graph
0 2 72 max deg of G[N(pendants)] of graph
0 2 72 avg deg of G[N(pendants)] of graph
0 2 72 number of components of G[N(pendants)] of graph
0 2 72 order of a largest component of G[N(pendants)] of graph
0 2 72 order of PrivNeigh set of N(pendants) of graph
0 2 72 number of edges between N(pendants)and its co-set  of graph
0 2 72 independence number of G[N(pendants)] of graph
0 2 72 clique number of G[N(pendants)] of graph
0 2 72 domination number of G[N(pendants)] of graph
0 2 72 matching number of G[N(pendants) ] of graph
0 2 73 number of V(G) - N(pendants) of graph
0 2 73 number of edges in G[V(G) - N(pendants)] of graph
0 2 73 longest induced cycle in G[V(G) - N(pendants)] of graph
0 2 73 longest induced path in G[V(G) - N(pendants)] of graph
0 2 73 number of isolates of G[V(G) - N(pendants)] of graph
0 2 73 min deg of G[V(G) - N(pendants)] of graph
0 2 73 max deg of G[V(G) - N(pendants)] of graph
0 2 73 avg deg of G[V(G) - N(pendants)] of graph
0 2 73 number of components of G[V(G) - N(pendants)] of graph
0 2 73 order of a largest component of G[V(G) - N(pendants)] of graph
0 2 73 order of PrivNeigh set of V(G) - N(pendants) of graph
0 2 73 number of edges between V(G) - N(pendants)and its co-set  of graph
0 2 73 independence number of G[V(G) - N(pendants)] of graph
0 2 73 clique number of G[V(G) - N(pendants)] of graph
0 2 73 domination number of G[V(G) - N(pendants)] of graph
0 2 73 matching number of G[V(G) - N(pendants) ] of graph
0 2 74 number of N(N(pendants)) of graph
0 2 74 number of edges in G[N(N(pendants))] of graph
0 2 74 longest induced cycle in G[N(N(pendants))] of graph
0 2 74 longest induced path in G[N(N(pendants))] of graph
0 2 74 number of isolates of G[N(N(pendants))] of graph
0 2 74 min deg of G[N(N(pendants))] of graph
0 2 74 max deg of G[N(N(pendants))] of graph
0 2 74 avg deg of G[N(N(pendants))] of graph
0 2 74 number of components of G[N(N(pendants))] of graph
0 2 74 order of a largest component of G[N(N(pendants))] of graph
0 2 74 order of PrivNeigh set of N(N(pendants)) of graph
0 2 74 number of edges between N(N(pendants))and its co-set  of graph
0 2 74 independence number of G[N(N(pendants))] of graph
0 2 74 clique number of G[N(N(pendants))] of graph
0 2 74 domination number of G[N(N(pendants))] of graph
0 2 74 matching number of G[N(N(pendants)) ] of graph
0 2 75 number of V(G) - N(N(pendants)) of graph
0 2 75 number of edges in G[V(G) - N(N(pendants))] of graph
0 2 75 longest induced cycle in G[V(G) - N(N(pendants))] of graph
0 2 75 longest induced path in G[V(G) - N(N(pendants))] of graph
0 2 75 number of isolates of G[V(G) - N(N(pendants))] of graph
0 2 75 min deg of G[V(G) - N(N(pendants))] of graph
0 2 75 max deg of G[V(G) - N(N(pendants))] of graph
0 2 75 avg deg of G[V(G) - N(N(pendants))] of graph
0 2 75 number of components of G[V(G) - N(N(pendants))] of graph
0 2 75 order of a largest component of G[V(G) - N(N(pendants))] of graph
0 2 75 order of PrivNeigh set of V(G) - N(N(pendants)) of graph
0 2 75 number of edges between V(G) - N(N(pendants))and its co-set  of graph
0 2 75 independence number of G[V(G) - N(N(pendants))] of graph
0 2 75 clique number of G[V(G) - N(N(pendants))] of graph
0 2 75 domination number of G[V(G) - N(N(pendants))] of graph
0 2 75 matching number of G[V(G) - N(N(pendants)) ] of graph
0 2 76 max disparity of a vertex of graph
0 2 76 min disparity of a vertex of graph
0 2 76 avg disparity of a vertex of graph
0 2 76 number of 0 disparity vertices of graph
0 2 76 median disparity of vertices of graph
0 2 76 sum of inverses of disparity of graph
0 2 76 sum of disparities of vertices of graph
0 2 77 number of degree => 3 vertices of graph
0 2 77 number of edges in G[degree => 3 vertices] of graph
0 2 77 longest induced cycle in G[degree => 3 vertices] of graph
0 2 77 longest induced path in G[degree => 3 vertices] of graph
0 2 77 number of isolates of G[degree => 3 vertices] of graph
0 2 77 min deg of G[degree => 3 vertices] of graph
0 2 77 max deg of G[degree => 3 vertices] of graph
0 2 77 avg deg of G[degree => 3 vertices] of graph
0 2 77 number of components of G[degree => 3 vertices] of graph
0 2 77 order of a largest component of G[degree => 3 vertices] of graph
0 2 77 order of PrivNeigh set of degree => 3 vertices of graph
0 2 77 number of edges between degree => 3 verticesand its co-set  of graph
0 2 77 independence number of G[degree => 3 vertices] of graph
0 2 77 clique number of G[degree => 3 vertices] of graph
0 2 77 domination number of G[degree => 3 vertices] of graph
0 2 77 matching number of G[degree => 3 vertices ] of graph
0 2 78 number of V(G) - {degree => 3 vertices} of graph
0 2 78 number of edges in G[V(G) - {degree => 3 vertices}] of graph
0 2 78 longest induced cycle in G[V(G) - {degree => 3 vertices}] of graph
0 2 78 longest induced path in G[V(G) - {degree => 3 vertices}] of graph
0 2 78 number of isolates of G[V(G) - {degree => 3 vertices}] of graph
0 2 78 min deg of G[V(G) - {degree => 3 vertices}] of graph
0 2 78 max deg of G[V(G) - {degree => 3 vertices}] of graph
0 2 78 avg deg of G[V(G) - {degree => 3 vertices}] of graph
0 2 78 number of components of G[V(G) - {degree => 3 vertices}] of graph
0 2 78 order of a largest component of G[V(G) - {degree => 3 vertices}] of graph
0 2 78 order of PrivNeigh set of V(G) - {degree => 3 vertices} of graph
0 2 78 number of edges between V(G) - {degree => 3 vertices}and its co-set  of graph
0 2 78 independence number of G[V(G) - {degree => 3 vertices}] of graph
0 2 78 clique number of G[V(G) - {degree => 3 vertices}] of graph
0 2 78 domination number of G[V(G) - {degree => 3 vertices}] of graph
0 2 78 matching number of G[V(G) - {degree => 3 vertices} ] of graph
0 2 79 Welsh_Powell invariant of graph
0 2 79 Szekeres_Wilf invariant of graph
0 2 81 number of degree > n/2 vertices of graph
0 2 81 number of edges in G[degree > n/2 vertices] of graph
0 2 81 longest induced cycle in G[degree > n/2 vertices] of graph
0 2 81 longest induced path in G[degree > n/2 vertices] of graph
0 2 81 number of isolates of G[degree > n/2 vertices] of graph
0 2 81 min deg of G[degree > n/2 vertices] of graph
0 2 81 max deg of G[degree > n/2 vertices] of graph
0 2 81 avg deg of G[degree > n/2 vertices] of graph
0 2 81 number of components of G[degree > n/2 vertices] of graph
0 2 81 order of a largest component of G[degree > n/2 vertices] of graph
0 2 81 order of PrivNeigh set of degree > n/2 vertices of graph
0 2 81 number of edges between degree > n/2 verticesand its co-set  of graph
0 2 81 independence number of G[degree > n/2 vertices] of graph
0 2 81 clique number of G[degree > n/2 vertices] of graph
0 2 81 domination number of G[degree > n/2 vertices] of graph
0 2 81 matching number of G[degree > n/2 vertices ] of graph
0 2 81 number of degree <= n/2 vertices of graph
0 2 81 number of edges in G[degree <= n/2 vertices] of graph
0 2 81 longest induced cycle in G[degree <= n/2 vertices] of graph
0 2 81 longest induced path in G[degree <= n/2 vertices] of graph
0 2 81 number of isolates of G[degree <= n/2 vertices] of graph
0 2 81 min deg of G[degree <= n/2 vertices] of graph
0 2 81 max deg of G[degree <= n/2 vertices] of graph
0 2 81 avg deg of G[degree <= n/2 vertices] of graph
0 2 81 number of components of G[degree <= n/2 vertices] of graph
0 2 81 order of a largest component of G[degree <= n/2 vertices] of graph
0 2 81 order of PrivNeigh set of degree <= n/2 vertices of graph
0 2 81 number of edges between degree <= n/2 verticesand its co-set  of graph
0 2 81 independence number of G[degree <= n/2 vertices] of graph
0 2 81 clique number of G[degree <= n/2 vertices] of graph
0 2 81 domination number of G[degree <= n/2 vertices] of graph
0 2 81 matching number of G[degree <= n/2 vertices ] of graph
0 2 82 maximum dominance of graph
0 2 82 minimum dominance of graph
0 2 82 number of neighbor dominators of graph
0 2 82 number of edges in G[neighbor dominators] of graph
0 2 82 longest induced cycle in G[neighbor dominators] of graph
0 2 82 longest induced path in G[neighbor dominators] of graph
0 2 82 number of isolates of G[neighbor dominators] of graph
0 2 82 min deg of G[neighbor dominators] of graph
0 2 82 max deg of G[neighbor dominators] of graph
0 2 82 avg deg of G[neighbor dominators] of graph
0 2 82 number of components of G[neighbor dominators] of graph
0 2 82 order of a largest component of G[neighbor dominators] of graph
0 2 82 order of PrivNeigh set of neighbor dominators of graph
0 2 82 number of edges between neighbor dominatorsand its co-set  of graph
0 2 82 independence number of G[neighbor dominators] of graph
0 2 82 clique number of G[neighbor dominators] of graph
0 2 82 domination number of G[neighbor dominators] of graph
0 2 82 matching number of G[neighbor dominators ] of graph
0 2 82 number of non-neighbor dominators of graph
0 2 82 number of edges in G[non-neighbor dominators] of graph
0 2 82 longest induced cycle in G[non-neighbor dominators] of graph
0 2 82 longest induced path in G[non-neighbor dominators] of graph
0 2 82 number of isolates of G[non-neighbor dominators] of graph
0 2 82 min deg of G[non-neighbor dominators] of graph
0 2 82 max deg of G[non-neighbor dominators] of graph
0 2 82 avg deg of G[non-neighbor dominators] of graph
0 2 82 number of components of G[non-neighbor dominators] of graph
0 2 82 order of a largest component of G[non-neighbor dominators] of graph
0 2 82 order of PrivNeigh set of non-neighbor dominators of graph
0 2 82 number of edges between non-neighbor dominatorsand its co-set  of graph
0 2 82 independence number of G[non-neighbor dominators] of graph
0 2 82 clique number of G[non-neighbor dominators] of graph
0 2 82 domination number of G[non-neighbor dominators] of graph
0 2 82 matching number of G[non-neighbor dominators ] of graph
0 3 0 Radius of graph
0 3 1 diameter of graph
0 4 0 independence number of graph
0 4 1 clique number of graph
0 4 2 chromatic number of graph
0 4 4 max local independence of graph
0 4 4 freq of max local independence of graph
0 4 4 min local independence of graph
0 4 4 freq of min local independence of graph
0 4 4 avg local independence of graph
0 4 4 |N(max local indep)| of graph
0 4 4 |N[max local indep]| of graph
0 4 5 domination number of graph
0 4 6 2-domination number of graph
0 4 7 total domination number of graph
0 4 8 connectivity number of graph
0 4 9 vertex covering of graph
0 4 10 independent domination number of graph
0 4 11 number of cut vertices of graph
0 4 11 number of edges in G[cut vertices] of graph
0 4 11 longest induced cycle in G[cut vertices] of graph
0 4 11 longest induced path in G[cut vertices] of graph
0 4 11 number of isolates of G[cut vertices] of graph
0 4 11 min deg of G[cut vertices] of graph
0 4 11 max deg of G[cut vertices] of graph
0 4 11 avg deg of G[cut vertices] of graph
0 4 11 number of components of G[cut vertices] of graph
0 4 11 order of a largest component of G[cut vertices] of graph
0 4 11 order of PrivNeigh set of cut vertices of graph
0 4 11 number of edges between cut verticesand its co-set  of graph
0 4 11 independence number of G[cut vertices] of graph
0 4 11 clique number of G[cut vertices] of graph
0 4 11 domination number of G[cut vertices] of graph
0 4 11 matching number of G[cut vertices ] of graph
0 4 13 3-domination number of graph
0 5 0 path covering of graph
0 5 1 maximum{deg(v) + matching number(<V-N(v)>) of graph
0 5 1 average{deg(v) + matching number(<V-N(v)>) of graph
0 5 1 minimum{deg(v) + matching number(<V-N(v)>) of graph
0 5 1 median{deg(v) + matching number(<V-N(v)>) of graph
0 5 1 frequencey of maximum{deg(v) + matching number(<V-N(v)>) of graph
0 5 1 frequencey of minimum{deg(v) + matching number(<V-N(v)>) of graph
0 5 2 max of |N(edge)| of graph
0 5 3 min of |N(edge)| of graph
0 5 4 sum of |N(edge)| of graph
0 5 5 matching number of graph
0 5 6 edge chromatic number of graph
0 6 0 number of triangles of graph
0 6 1 number of K4 of graph
0 6 2 girth of graph
0 6 3 induced circumference of graph
0 6 3 number of vertices incident to an induced circumference of graph
0 6 3 maximum degree of a circumference vertex of graph
0 6 3 minimum degree of a circumference vertex of graph
0 6 4 max of (number of triangles incident to a vertex) of graph
0 6 4 min of (number of triangles incident to a vertex) of graph
0 6 4 sum of (number of triangles incident to a vertex) of graph
0 6 4 freq of max of (number of triangles incident to a vertex) of graph
0 6 4 freq of min of (number of triangles incident to a vertex) of graph
0 6 4 number of distinct of (number of triangles incident to a vertex) of graph
0 6 5 max of (number of K4 incident to a vertex) of graph
0 6 5 min of (number of K4 incident to a vertex) of graph
0 6 5 sum of (number of K4 incident to a vertex) of graph
0 6 5 freq of max of (number of K4 incident to a vertex) of graph
0 6 5 freq of min of (number of K4 incident to a vertex) of graph
0 6 5 number of distinct of (number of K4 incident to a vertex) of graph
0 6 7 order of largest K(2,n) subgraph of graph
0 6 9 number of paths of length 3  of graph
0 6 10 maximum number of paths of length 3 starting a vertex  of graph
0 6 11 greedy maximum cut number of graph
0 7 0 _connected graph
0 7 1 _bipartite graph
0 7 2 _tree graph
0 7 3 _F-free graph
0 7 4 _triangle-free graph
0 7 5 _regular graph
0 7 5 _complete graph
0 7 6 _claw-free graph
0 7 7 _Traceable graph
0 7 8 _Hamiltonian graph
0 7 9 _C4-free graph
0 7 10 _min deg > 1 graph
0 7 10 _min deg > 2
0 7 10 _min deg > 3
0 7 10 _min deg > 4
0 7 10 _min deg > (n-1)/2
0 7 10 _min deg > n/2
0 7 10 _min deg >= (n-1)/2
0 7 10 _min deg >= n/2
0 7 11 _at most cubic graph
0 7 11 _max degree <= 4
0 7 11 _max degree <= n/4
0 7 11 _max degree <= n/3
0 7 11 _max degree <= n/2
0 7 11 _almost regular
0 7 13 _n >= 2
0 7 13 _n >= 3
0 7 13 _n >= 4
0 7 13 _n >= 5
0 7 13 _n >= 6
0 7 13 _n >= 7
0 7 14 _|E| <= n(n-1)/4
0 7 14 _|E| >= n(n-1)/4
0 7 14 _|E| >= n(n-1)/3
0 7 14 _|E| >= (n-1)(n-1)/2
0 7 14 _|E| <= (n-1)(n-1)/2
0 7 15 _girth >= 4
0 7 15 _girth >= 5
0 7 15 _girth >= 6
0 7 15 _even_girth
0 7 16 _planar
0 7 17 _diameter <= 2
0 7 17 _diameter <= 3
0 7 17 _diameter >= 3
0 7 17 _diameter = 2 or 3
0 7 18 _Konig-Egarvary graph
1 2 34 residue of complement graph
1 2 79 Welsh_Powell invariant of complement graph
1 2 79 Szekeres_Wilf invariant of complement graph
1 4 5 domination number of complement graph