A Detailed Study on Skolem Mean Labeling for Disjoint Union of Six Star Graphs
R Prathipa, S. Usharani · Shanlax International Journal of Arts Science and Humanities · 2022
Definition: GraphA graph G = (V(G), E(G)), consists of two finite sets, V(G), the vertex set of the graph, often denoted by just V, which is non-empty sets of elements called vertices, E(G), the edges set of the graph, often denoted by just E, which is possibly an empty set of element called edges.A graph G with five vertices and seven edges.V(G) = {V 1 , V 2 , V 3 , V 4 , V 5 ,} E(G) = {e 1 , e 2 , e 3 , e 4 , e 5 , e 6 , e 7, } Definition: Empty Graph An empty graph is graph with no edges.In the graph empty graph with two vertices. Definition: IsolatedA vertex of G which not end of any edge is called isolated.