On Independent Vertices and Edges of a Graph
İvan Gutman · 1990
Let the numbers of k-element sets of independent vertices and edges of a graph G be denoted by n(G,k) and m(G,k), respectively. Some properties of the numbers n(G,k) and m(G,k) are outlined. In particular, it is shown that the circuits are the only connected graphs for which the equality n(G,k) = m(G,k) is satisfied for all values of k.