query: Why are the number of verticies in a clique graph less than its a parent graph
positive_passages.docid: 149538
positive_passages.text: graph theory - clique graph
negative_passages.docid: 91229
negative_passages.text: Complexity of counting the number of triangles of a graph
negative_passages.docid: 78243
negative_passages.text: graph-theory problem about outdegree and indegree
negative_passages.docid: 19219
negative_passages.text: On the invertibility of the adjacency matrix of a graph
negative_passages.docid: 94838
negative_passages.text: Show that a self-complementary graph contains an odd number of vertices with degree $(n-1)/2$
negative_passages.docid: 128034
negative_passages.text: Problem on Extremal Graphs: three independent paths
negative_passages.docid: 39753
negative_passages.text: Proving that in a simple graph with $n$ vertices, two vertices have the same degree
negative_passages.docid: 54516
negative_passages.text: Number of edges of any spanning tree of a graph $G$ coming from a subgraph of $G$
negative_passages.docid: 127277
negative_passages.text: Graph Theory: Tree has at least 2 vertices of degree 1
negative_passages.docid: 10910
negative_passages.text: How many edges does an undirected tree with $n$ nodes have?
negative_passages.docid: 142202
negative_passages.text: eigenvalues of cycle graph and its complement graph
negative_passages.docid: 134440
negative_passages.text: An unexpected application of non-trivial combinatorics
negative_passages.docid: 116932
negative_passages.text: Proving a simple graph is a connected graph
negative_passages.docid: 99806
negative_passages.text: Given an undirected Graph
negative_passages.docid: 44563
negative_passages.text: Weakly Connected Graphs
negative_passages.docid: 37754
negative_passages.text: Number of vertices of a complete graph with $n$ edges
negative_passages.docid: 28877
negative_passages.text: Graph with $k$ components.