The (integral) sum number of \(K_n-E(K_r)\) (Q5957715)

A graph \(G=(V,E)\) is an (integral) sum graph, when we can assign to each vertex \(v\in V\) a distinct (integer) label, such that vertices are adjacent, if and only if the sum of their labels is the label of a vertex in \(V\). The (integral) sum number of a graph \(G\) is the minimum number of isolated vertices that must be added to \(G\) to turn \(G\) into an (integral) sum graph. This paper gives a precise characterization of the intgeral sum number of \(K_n - E(K_r)\), i.e., the graph obtained by removing the edges of a clique with \(r\) vertices from a clique with \(n\) vertices. When \(r\neq n-1\), then for these graphs, the integral sum number equals the sum number.