Question: What is the diameter of the graph (or largest component)?

Answer: 7


Question: What is the average degree among node 0, node 34, and node 67?

Answer: 3.667


Question: How many nodes are in the largest connected component?

Answer: 65


Question: What is the average degree of the graph?

Answer: 3.706


Question: If one bridge edge were removed, would the number of connected components likely increase?

Answer: yes


Question: If an edge were added between node 0 and node 67, would they be directly connected?

Answer: yes


Question: If the edge between node 0 and node 67 were removed, would the number of connected components increase?

Answer: no


Question: If one random edge were removed, would the total edge count decrease by one?

Answer: yes


Question: Are node 0 and node 37 connected?

Answer: yes


Question: What is the degree of node 0?

Answer: 11


Question: What is the degree of node 19?

Answer: 2


Question: What is the degree of node 37?

Answer: 2


Question: How many edges does this graph have?

Answer: 72


Question: How many immediate neighbors does node 4 have?

Answer: 13


Question: How many immediate neighbors does node 0 have?

Answer: 11


Question: What is the shortest path length between node 0 and node 37?

Answer: 2


Question: Which node has the highest degree?

Answer: 4


Question: What is the approximate clustering coefficient of the graph?

Answer: 0.223


Question: Is this graph bipartite?

Answer: no


Question: Does this graph contain a cycle?

Answer: yes


Question: Is there a path between node 0 and node 1?

Answer: yes


Question: Is there a path between node 0 and node 2?

Answer: yes


Question: Is there a path between node 0 and node 3?

Answer: yes


Question: What fraction of nodes belong to the largest connected component?

Answer: 1.0


Question: Which node has the highest betweenness centrality?

Answer: 4


Question: What is the diameter of the graph (or largest component)?

Answer: 5


Question: What is the average degree among node 0, node 19, and node 37?

Answer: 5.000


Question: How many nodes are in the largest connected component?

Answer: 38


Question: What is the average degree of the graph?

Answer: 3.789


Question: If one bridge edge were removed, would the number of connected components likely increase?

Answer: yes


Question: If an edge were added between node 0 and node 37, would they be directly connected?

Answer: yes


Question: If the edge between node 0 and node 37 were removed, would the number of connected components increase?

Answer: no


Question: If one random edge were removed, would the total edge count decrease by one?

Answer: yes


Question: Are node 0 and node 74 connected?

Answer: yes


Question: What is the degree of node 0?

Answer: 25


Question: What is the degree of node 37?

Answer: 4


Question: What is the degree of node 74?

Answer: 3


Question: How many edges does this graph have?

Answer: 216


Question: How many immediate neighbors does node 0 have?

Answer: 25


Question: How many immediate neighbors does node 4 have?

Answer: 20


Question: What is the shortest path length between node 0 and node 74?

Answer: 2


Question: Which node has the highest degree?

Answer: 0


Question: What is the approximate clustering coefficient of the graph?

Answer: 0.173


Question: Is this graph bipartite?

Answer: no


Question: Does this graph contain a cycle?

Answer: yes


Question: Is there a path between node 0 and node 1?

Answer: yes


Question: Is there a path between node 0 and node 2?

Answer: yes


Question: Is there a path between node 0 and node 3?

Answer: yes


Question: What fraction of nodes belong to the largest connected component?

Answer: 1.0


Question: Which node has the highest betweenness centrality?

Answer: 0


Question: What is the diameter of the graph (or largest component)?

Answer: 4


Question: What is the average degree among node 0, node 37, and node 74?

Answer: 10.667


Question: How many nodes are in the largest connected component?

Answer: 75


Question: What is the average degree of the graph?

Answer: 5.760


Question: If one bridge edge were removed, would the number of connected components likely increase?

Answer: yes


Question: If an edge were added between node 0 and node 74, would they be directly connected?

Answer: yes


Question: If the edge between node 0 and node 74 were removed, would the number of connected components increase?

Answer: no


Question: If one random edge were removed, would the total edge count decrease by one?

Answer: yes


Question: Are node 0 and node 55 connected?

Answer: yes


Question: What is the degree of node 0?

Answer: 24


Question: What is the degree of node 28?

Answer: 4


Question: What is the degree of node 55?

Answer: 4


Question: How many edges does this graph have?

Answer: 208


Question: How many immediate neighbors does node 0 have?

Answer: 24


Question: How many immediate neighbors does node 6 have?

Answer: 19


Question: What is the shortest path length between node 0 and node 55?

Answer: 2


Question: Which node has the highest degree?

Answer: 0


Question: What is the approximate clustering coefficient of the graph?

Answer: 0.212


Question: Is this graph bipartite?

Answer: no


Question: Does this graph contain a cycle?

Answer: yes


Question: Is there a path between node 0 and node 1?

Answer: yes


Question: Is there a path between node 0 and node 2?

Answer: yes


Question: Is there a path between node 0 and node 3?

Answer: yes


Question: What fraction of nodes belong to the largest connected component?

Answer: 1.0


Question: Which node has the highest betweenness centrality?

Answer: 0


Question: What is the diameter of the graph (or largest component)?

Answer: 4


Question: What is the average degree among node 0, node 28, and node 55?

Answer: 10.667


Question: How many nodes are in the largest connected component?

Answer: 56


Question: What is the average degree of the graph?

Answer: 7.429


Question: If one bridge edge were removed, would the number of connected components likely increase?

Answer: yes


Question: If an edge were added between node 0 and node 55, would they be directly connected?

Answer: yes


Question: If the edge between node 0 and node 55 were removed, would the number of connected components increase?

Answer: no


Question: If one random edge were removed, would the total edge count decrease by one?

Answer: yes


Question: Are node 0 and node 59 connected?

Answer: yes


Question: What is the degree of node 0?

Answer: 5


Question: What is the degree of node 30?

Answer: 4


Question: What is the degree of node 59?

Answer: 4


Question: How many edges does this graph have?

Answer: 120


Question: How many immediate neighbors does node 18 have?

Answer: 6


Question: How many immediate neighbors does node 24 have?

Answer: 6


Question: What is the shortest path length between node 0 and node 59?

Answer: 1


Question: Which node has the highest degree?

Answer: 18


Question: What is the approximate clustering coefficient of the graph?

Answer: 0.313


Question: Is this graph bipartite?

Answer: no


Question: Does this graph contain a cycle?

Answer: yes


Question: Is there a path between node 0 and node 1?

Answer: yes


Question: Is there a path between node 0 and node 2?

Answer: yes


Question: Is there a path between node 0 and node 3?

Answer: yes


Question: What fraction of nodes belong to the largest connected component?

Answer: 1.0


Question: Which node has the highest betweenness centrality?

Answer: 18


Question: What is the diameter of the graph (or largest component)?

Answer: 7


Question: What is the average degree among node 0, node 30, and node 59?

Answer: 4.333


Question: How many nodes are in the largest connected component?

Answer: 60


Question: What is the average degree of the graph?

Answer: 4.000


Question: If one bridge edge were removed, would the number of connected components likely increase?

Answer: yes


Question: If an edge were added between node 0 and node 59, would they be directly connected?

Answer: yes


Question: If the edge between node 0 and node 59 were removed, would the number of connected components increase?

Answer: no


Question: If one random edge were removed, would the total edge count decrease by one?

Answer: yes


Question: Are node 0 and node 83 connected?

Answer: yes


Question: What is the degree of node 0?

Answer: 4


Question: What is the degree of node 42?

Answer: 6


Question: What is the degree of node 83?

Answer: 4


Question: How many edges does this graph have?

Answer: 252


Question: How many immediate neighbors does node 2 have?

Answer: 8


Question: How many immediate neighbors does node 46 have?

Answer: 8


Question: What is the shortest path length between node 0 and node 83?

Answer: 2


Question: Which node has the highest degree?

Answer: 2


Question: What is the approximate clustering coefficient of the graph?

Answer: 0.452


Question: Is this graph bipartite?

Answer: no


Question: Does this graph contain a cycle?

Answer: yes


Question: Is there a path between node 0 and node 1?

Answer: yes


Question: Is there a path between node 0 and node 2?

Answer: yes


Question: Is there a path between node 0 and node 3?

Answer: yes


Question: What fraction of nodes belong to the largest connected component?

Answer: 1.0


Question: Which node has the highest betweenness centrality?

Answer: 35


Question: What is the diameter of the graph (or largest component)?

Answer: 7


Question: What is the average degree among node 0, node 42, and node 83?

Answer: 4.667


Question: How many nodes are in the largest connected component?

Answer: 84


Question: What is the average degree of the graph?

Answer: 6.000


Question: If one bridge edge were removed, would the number of connected components likely increase?

Answer: yes


Question: If an edge were added between node 0 and node 83, would they be directly connected?

Answer: yes


Question: If the edge between node 0 and node 83 were removed, would the number of connected components increase?

Answer: no


Question: If one random edge were removed, would the total edge count decrease by one?

Answer: yes


Question: Are node 0 and node 47 connected?

Answer: yes


Question: What is the degree of node 0?

Answer: 4


Question: What is the degree of node 24?

Answer: 5


Question: What is the degree of node 47?

Answer: 3


Question: How many edges does this graph have?

Answer: 96


Question: How many immediate neighbors does node 14 have?

Answer: 6


Question: How many immediate neighbors does node 28 have?

Answer: 6


Question: What is the shortest path length between node 0 and node 47?

Answer: 1


Question: Which node has the highest degree?

Answer: 14


Question: What is the approximate clustering coefficient of the graph?

Answer: 0.226


Question: Is this graph bipartite?

Answer: no


Question: Does this graph contain a cycle?

Answer: yes


Question: Is there a path between node 0 and node 1?

Answer: yes


Question: Is there a path between node 0 and node 2?

Answer: yes


Question: Is there a path between node 0 and node 3?

Answer: yes


Question: What fraction of nodes belong to the largest connected component?

Answer: 1.0


Question: Which node has the highest betweenness centrality?

Answer: 24


Question: What is the diameter of the graph (or largest component)?

Answer: 6


Question: What is the average degree among node 0, node 24, and node 47?

Answer: 4.000


Question: How many nodes are in the largest connected component?

Answer: 48


Question: What is the average degree of the graph?

Answer: 4.000


Question: If one bridge edge were removed, would the number of connected components likely increase?

Answer: yes


Question: If an edge were added between node 0 and node 47, would they be directly connected?

Answer: yes


Question: If the edge between node 0 and node 47 were removed, would the number of connected components increase?

Answer: no


Question: If one random edge were removed, would the total edge count decrease by one?

Answer: yes


Question: Are node 0 and node 44 connected?

Answer: yes


Question: What is the degree of node 0?

Answer: 2


Question: What is the degree of node 22?

Answer: 1


Question: What is the degree of node 44?

Answer: 4


Question: How many edges does this graph have?

Answer: 44


Question: How many immediate neighbors does node 4 have?

Answer: 4


Question: How many immediate neighbors does node 18 have?

Answer: 4


Question: What is the shortest path length between node 0 and node 44?

Answer: 6


Question: Which node has the highest degree?

Answer: 4


Question: What is the approximate clustering coefficient of the graph?

Answer: 0.000


Question: Is this graph bipartite?

Answer: yes


Question: Does this graph contain a cycle?

Answer: no


Question: Is there a path between node 0 and node 1?

Answer: yes


Question: Is there a path between node 0 and node 2?

Answer: yes


Question: Is there a path between node 0 and node 3?

Answer: yes


Question: What fraction of nodes belong to the largest connected component?

Answer: 1.0


Question: Which node has the highest betweenness centrality?

Answer: 32


Question: What is the diameter of the graph (or largest component)?

Answer: 13


Question: What is the average degree among node 0, node 22, and node 44?

Answer: 2.333


Question: How many nodes are in the largest connected component?

Answer: 45


Question: What is the average degree of the graph?

Answer: 1.956


Question: If one bridge edge were removed, would the number of connected components likely increase?

Answer: no


Question: If an edge were added between node 0 and node 44, would they be directly connected?

Answer: yes


Question: If the edge between node 0 and node 44 were removed, would the number of connected components increase?

Answer: no


Question: If one random edge were removed, would the total edge count decrease by one?

Answer: yes


Question: Are node 0 and node 95 connected?

Answer: yes


Question: What is the degree of node 0?

Answer: 2


Question: What is the degree of node 48?

Answer: 4


Question: What is the degree of node 95?

Answer: 2


Question: How many edges does this graph have?

Answer: 95


Question: How many immediate neighbors does node 10 have?

Answer: 5


Question: How many immediate neighbors does node 36 have?

Answer: 5


Question: What is the shortest path length between node 0 and node 95?

Answer: 12


Question: Which node has the highest degree?

Answer: 10


Question: What is the approximate clustering coefficient of the graph?

Answer: 0.000


Question: Is this graph bipartite?

Answer: yes


Question: Does this graph contain a cycle?

Answer: no


Question: Is there a path between node 0 and node 1?

Answer: yes


Question: Is there a path between node 0 and node 2?

Answer: yes


Question: Is there a path between node 0 and node 3?

Answer: yes


Question: What fraction of nodes belong to the largest connected component?

Answer: 1.0


Question: Which node has the highest betweenness centrality?

Answer: 7


Question: What is the diameter of the graph (or largest component)?

Answer: 20


Question: What is the average degree among node 0, node 48, and node 95?

Answer: 2.667


Question: How many nodes are in the largest connected component?

Answer: 96


Question: What is the average degree of the graph?

Answer: 1.979


Question: If one bridge edge were removed, would the number of connected components likely increase?

Answer: no


Question: If an edge were added between node 0 and node 95, would they be directly connected?

Answer: yes


Question: If the edge between node 0 and node 95 were removed, would the number of connected components increase?

Answer: no


Question: If one random edge were removed, would the total edge count decrease by one?

Answer: yes


Question: Are node 0 and node 63 connected?

Answer: yes


Question: What is the degree of node 0?

Answer: 2


Question: What is the degree of node 32?

Answer: 3


Question: What is the degree of node 63?

Answer: 2


Question: How many edges does this graph have?

Answer: 112


Question: How many immediate neighbors does node 9 have?

Answer: 4


Question: How many immediate neighbors does node 10 have?

Answer: 4


Question: What is the shortest path length between node 0 and node 63?

Answer: 14


Question: Which node has the highest degree?

Answer: 9


Question: What is the approximate clustering coefficient of the graph?

Answer: 0.000


Question: Is this graph bipartite?

Answer: yes


Question: Does this graph contain a cycle?

Answer: yes


Question: Is there a path between node 0 and node 1?

Answer: yes


Question: Is there a path between node 0 and node 2?

Answer: yes


Question: Is there a path between node 0 and node 3?

Answer: yes


Question: What fraction of nodes belong to the largest connected component?

Answer: 1.0


Question: Which node has the highest betweenness centrality?

Answer: 35


Question: What is the diameter of the graph (or largest component)?

Answer: 14


Question: What is the average degree among node 0, node 32, and node 63?

Answer: 2.333


Question: How many nodes are in the largest connected component?

Answer: 64


Question: What is the average degree of the graph?

Answer: 3.500


Question: If one bridge edge were removed, would the number of connected components likely increase?

Answer: yes


Question: If an edge were added between node 0 and node 63, would they be directly connected?

Answer: yes


Question: If the edge between node 0 and node 63 were removed, would the number of connected components increase?

Answer: no


Question: If one random edge were removed, would the total edge count decrease by one?

Answer: yes


Question: Are node 0 and node 49 connected?

Answer: yes


Question: What is the degree of node 0?

Answer: 2


Question: What is the degree of node 25?

Answer: 4


Question: What is the degree of node 49?

Answer: 2


Question: How many edges does this graph have?

Answer: 85


Question: How many immediate neighbors does node 11 have?

Answer: 4


Question: How many immediate neighbors does node 12 have?

Answer: 4


Question: What is the shortest path length between node 0 and node 49?

Answer: 13


Question: Which node has the highest degree?

Answer: 11


Question: What is the approximate clustering coefficient of the graph?

Answer: 0.000


Question: Is this graph bipartite?

Answer: yes


Question: Does this graph contain a cycle?

Answer: yes


Question: Is there a path between node 0 and node 1?

Answer: yes


Question: Is there a path between node 0 and node 2?

Answer: yes


Question: Is there a path between node 0 and node 3?

Answer: yes


Question: What fraction of nodes belong to the largest connected component?

Answer: 1.0


Question: Which node has the highest betweenness centrality?

Answer: 25


Question: What is the diameter of the graph (or largest component)?

Answer: 13


Question: What is the average degree among node 0, node 25, and node 49?

Answer: 2.667


Question: How many nodes are in the largest connected component?

Answer: 50


Question: What is the average degree of the graph?

Answer: 3.400


Question: If one bridge edge were removed, would the number of connected components likely increase?

Answer: yes


Question: If an edge were added between node 0 and node 49, would they be directly connected?

Answer: yes


Question: If the edge between node 0 and node 49 were removed, would the number of connected components increase?

Answer: no


Question: If one random edge were removed, would the total edge count decrease by one?

Answer: yes


Question: Are node 0 and node 31 connected?

Answer: yes


Question: What is the degree of node 0?

Answer: 31


Question: What is the degree of node 16?

Answer: 1


Question: What is the degree of node 31?

Answer: 1


Question: How many edges does this graph have?

Answer: 31


Question: How many immediate neighbors does node 0 have?

Answer: 31


Question: How many immediate neighbors does node 1 have?

Answer: 1


Question: What is the shortest path length between node 0 and node 31?

Answer: 1


Question: Which node has the highest degree?

Answer: 0


Question: What is the approximate clustering coefficient of the graph?

Answer: 0.000


Question: Is this graph bipartite?

Answer: yes


Question: Does this graph contain a cycle?

Answer: no


Question: Is there a path between node 0 and node 1?

Answer: yes


Question: Is there a path between node 0 and node 2?

Answer: yes


Question: Is there a path between node 0 and node 3?

Answer: yes


Question: What fraction of nodes belong to the largest connected component?

Answer: 1.0


Question: Which node has the highest betweenness centrality?

Answer: 0


Question: What is the diameter of the graph (or largest component)?

Answer: 2


Question: What is the average degree among node 0, node 16, and node 31?

Answer: 11.000


Question: How many nodes are in the largest connected component?

Answer: 32


Question: What is the average degree of the graph?

Answer: 1.938


Question: If one bridge edge were removed, would the number of connected components likely increase?

Answer: no


Question: If an edge were added between node 0 and node 31, would they be directly connected?

Answer: yes


Question: If the edge between node 0 and node 31 were removed, would the number of connected components increase?

Answer: yes


Question: If one random edge were removed, would the total edge count decrease by one?

Answer: yes


Question: Are node 0 and node 70 connected?

Answer: yes


Question: What is the degree of node 0?

Answer: 70


Question: What is the degree of node 35?

Answer: 1


Question: What is the degree of node 70?

Answer: 1


Question: How many edges does this graph have?

Answer: 70


Question: How many immediate neighbors does node 0 have?

Answer: 70


Question: How many immediate neighbors does node 1 have?

Answer: 1


Question: What is the shortest path length between node 0 and node 70?

Answer: 1


Question: Which node has the highest degree?

Answer: 0


Question: What is the approximate clustering coefficient of the graph?

Answer: 0.000


Question: Is this graph bipartite?

Answer: yes


Question: Does this graph contain a cycle?

Answer: no


Question: Is there a path between node 0 and node 1?

Answer: yes


Question: Is there a path between node 0 and node 2?

Answer: yes


Question: Is there a path between node 0 and node 3?

Answer: yes


Question: What fraction of nodes belong to the largest connected component?

Answer: 1.0


Question: Which node has the highest betweenness centrality?

Answer: 0


Question: What is the diameter of the graph (or largest component)?

Answer: 2


Question: What is the average degree among node 0, node 35, and node 70?

Answer: 24.000


Question: How many nodes are in the largest connected component?

Answer: 71


Question: What is the average degree of the graph?

Answer: 1.972


Question: If one bridge edge were removed, would the number of connected components likely increase?

Answer: no


Question: If an edge were added between node 0 and node 70, would they be directly connected?

Answer: yes


Question: If the edge between node 0 and node 70 were removed, would the number of connected components increase?

Answer: yes


Question: If one random edge were removed, would the total edge count decrease by one?

Answer: yes


Question: Are node 0 and node 71 connected?

Answer: yes


Question: What is the degree of node 0?

Answer: 12


Question: What is the degree of node 36?

Answer: 3


Question: What is the degree of node 71?

Answer: 8


Question: How many edges does this graph have?

Answer: 252


Question: How many immediate neighbors does node 45 have?

Answer: 14


Question: How many immediate neighbors does node 0 have?

Answer: 12


Question: What is the shortest path length between node 0 and node 71?

Answer: 3


Question: Which node has the highest degree?

Answer: 45


Question: What is the approximate clustering coefficient of the graph?

Answer: 0.201


Question: Is this graph bipartite?

Answer: no


Question: Does this graph contain a cycle?

Answer: yes


Question: Is there a path between node 0 and node 1?

Answer: yes


Question: Is there a path between node 0 and node 2?

Answer: yes


Question: Is there a path between node 0 and node 3?

Answer: yes


Question: What fraction of nodes belong to the largest connected component?

Answer: 1.0


Question: Which node has the highest betweenness centrality?

Answer: 45


Question: What is the diameter of the graph (or largest component)?

Answer: 4


Question: What is the average degree among node 0, node 36, and node 71?

Answer: 7.667


Question: How many nodes are in the largest connected component?

Answer: 72


Question: What is the average degree of the graph?

Answer: 7.000


Question: If one bridge edge were removed, would the number of connected components likely increase?

Answer: yes


Question: If an edge were added between node 0 and node 71, would they be directly connected?

Answer: yes


Question: If the edge between node 0 and node 71 were removed, would the number of connected components increase?

Answer: no


Question: If one random edge were removed, would the total edge count decrease by one?

Answer: yes


Question: Are node 0 and node 89 connected?

Answer: yes


Question: What is the degree of node 0?

Answer: 14


Question: What is the degree of node 45?

Answer: 8


Question: What is the degree of node 89?

Answer: 8


Question: How many edges does this graph have?

Answer: 372


Question: How many immediate neighbors does node 76 have?

Answer: 15


Question: How many immediate neighbors does node 0 have?

Answer: 14


Question: What is the shortest path length between node 0 and node 89?

Answer: 2


Question: Which node has the highest degree?

Answer: 76


Question: What is the approximate clustering coefficient of the graph?

Answer: 0.152


Question: Is this graph bipartite?

Answer: no


Question: Does this graph contain a cycle?

Answer: yes


Question: Is there a path between node 0 and node 1?

Answer: yes


Question: Is there a path between node 0 and node 2?

Answer: yes


Question: Is there a path between node 0 and node 3?

Answer: yes


Question: What fraction of nodes belong to the largest connected component?

Answer: 1.0


Question: Which node has the highest betweenness centrality?

Answer: 76


Question: What is the diameter of the graph (or largest component)?

Answer: 5


Question: What is the average degree among node 0, node 45, and node 89?

Answer: 10.000


Question: How many nodes are in the largest connected component?

Answer: 90


Question: What is the average degree of the graph?

Answer: 8.267


Question: If one bridge edge were removed, would the number of connected components likely increase?

Answer: yes


Question: If an edge were added between node 0 and node 89, would they be directly connected?

Answer: yes


Question: If the edge between node 0 and node 89 were removed, would the number of connected components increase?

Answer: no


Question: If one random edge were removed, would the total edge count decrease by one?

Answer: yes


Question: Are node 0 and node 53 connected?

Answer: yes


Question: What is the degree of node 0?

Answer: 9


Question: What is the degree of node 27?

Answer: 6


Question: What is the degree of node 53?

Answer: 13


Question: How many edges does this graph have?

Answer: 190


Question: How many immediate neighbors does node 53 have?

Answer: 13


Question: How many immediate neighbors does node 6 have?

Answer: 11


Question: What is the shortest path length between node 0 and node 53?

Answer: 3


Question: Which node has the highest degree?

Answer: 53


Question: What is the approximate clustering coefficient of the graph?

Answer: 0.224


Question: Is this graph bipartite?

Answer: no


Question: Does this graph contain a cycle?

Answer: yes


Question: Is there a path between node 0 and node 1?

Answer: yes


Question: Is there a path between node 0 and node 2?

Answer: yes


Question: Is there a path between node 0 and node 3?

Answer: yes


Question: What fraction of nodes belong to the largest connected component?

Answer: 1.0


Question: Which node has the highest betweenness centrality?

Answer: 53


Question: What is the diameter of the graph (or largest component)?

Answer: 4


Question: What is the average degree among node 0, node 27, and node 53?

Answer: 9.333


Question: How many nodes are in the largest connected component?

Answer: 54


Question: What is the average degree of the graph?

Answer: 7.037


Question: If one bridge edge were removed, would the number of connected components likely increase?

Answer: yes


Question: If an edge were added between node 0 and node 53, would they be directly connected?

Answer: yes


Question: If the edge between node 0 and node 53 were removed, would the number of connected components increase?

Answer: no


Question: If one random edge were removed, would the total edge count decrease by one?

Answer: yes


Question: Are node 0 and node 57 connected?

Answer: yes


Question: What is the degree of node 0?

Answer: 6


Question: What is the degree of node 29?

Answer: 3


Question: What is the degree of node 57?

Answer: 3


Question: How many edges does this graph have?

Answer: 120


Question: How many immediate neighbors does node 18 have?

Answer: 10


Question: How many immediate neighbors does node 6 have?

Answer: 9


Question: What is the shortest path length between node 0 and node 57?

Answer: 3


Question: Which node has the highest degree?

Answer: 18


Question: What is the approximate clustering coefficient of the graph?

Answer: 0.000


Question: Is this graph bipartite?

Answer: yes


Question: Does this graph contain a cycle?

Answer: yes


Question: Is there a path between node 0 and node 1?

Answer: yes


Question: Is there a path between node 0 and node 2?

Answer: yes


Question: Is there a path between node 0 and node 3?

Answer: yes


Question: What fraction of nodes belong to the largest connected component?

Answer: 1.0


Question: Which node has the highest betweenness centrality?

Answer: 18


Question: What is the diameter of the graph (or largest component)?

Answer: 6


Question: What is the average degree among node 0, node 29, and node 57?

Answer: 4.000


Question: How many nodes are in the largest connected component?

Answer: 58


Question: What is the average degree of the graph?

Answer: 4.138


Question: If one bridge edge were removed, would the number of connected components likely increase?

Answer: yes


Question: If an edge were added between node 0 and node 57, would they be directly connected?

Answer: yes


Question: If the edge between node 0 and node 57 were removed, would the number of connected components increase?

Answer: no


Question: If one random edge were removed, would the total edge count decrease by one?

Answer: yes


Question: Are node 0 and node 79 connected?

Answer: yes


Question: What is the degree of node 0?

Answer: 5


Question: What is the degree of node 40?

Answer: 4


Question: What is the degree of node 79?

Answer: 3


Question: How many edges does this graph have?

Answer: 153


Question: How many immediate neighbors does node 11 have?

Answer: 9


Question: How many immediate neighbors does node 26 have?

Answer: 9


Question: What is the shortest path length between node 0 and node 79?

Answer: 3


Question: Which node has the highest degree?

Answer: 11


Question: What is the approximate clustering coefficient of the graph?

Answer: 0.000


Question: Is this graph bipartite?

Answer: yes


Question: Does this graph contain a cycle?

Answer: yes


Question: Is there a path between node 0 and node 1?

Answer: yes


Question: Is there a path between node 0 and node 2?

Answer: yes


Question: Is there a path between node 0 and node 3?

Answer: yes


Question: What fraction of nodes belong to the largest connected component?

Answer: 1.0


Question: Which node has the highest betweenness centrality?

Answer: 26


Question: What is the diameter of the graph (or largest component)?

Answer: 7


Question: What is the average degree among node 0, node 40, and node 79?

Answer: 4.000


Question: How many nodes are in the largest connected component?

Answer: 80


Question: What is the average degree of the graph?

Answer: 3.825


Question: If one bridge edge were removed, would the number of connected components likely increase?

Answer: yes


Question: If an edge were added between node 0 and node 79, would they be directly connected?

Answer: yes


Question: If the edge between node 0 and node 79 were removed, would the number of connected components increase?

Answer: no


Question: If one random edge were removed, would the total edge count decrease by one?

Answer: yes