Entire Equitable Dominating Graph
Author: B.Basavanagod
Publisher: Infinite Study
Published:
Total Pages: 8
ISBN-13:
DOWNLOAD EBOOKAll graphs considered here are finite, undirected with no loops and multiple edges. We denote by p the order(i.e number of vertices) and by q the size (i.e number of edges) of such a graph G. Any undefined term and notation in this paper may be found in Harary [5].