Search
Now showing items 1-5 of 5
A study of local domination number of Sn H graph
(2018-02-28)
All graphs in this paper are undirected, connected and simple graph. Let G = (V,E) be a graph of order |V| and size |E|. We define a set D as a dominating set if for every vertex μ epsilon V – D is adjacent to some vertex ...
Super local edge antimagic total coloring of Pn . H
(2018-07-04)
In this paper, we consider that all graphs are ¯nite, simple and connected.
Let G(V; E) be a graph of vertex set V and edge set E. A bijection f : V (G) ¡!
f1; 2; 3; :::; jV (G)jg is called a local edge antimagic labeling ...
On locating independent domination number of amalgamation graphs
(2018-02-28)
An independent set or stable set is a set of vertices in a graph in which no two
of vertices are adjacent. A set D of vertices of graph G is called a dominating set if every
vertex u 2 V (G) ¡ D is adjacent to some vertex ...
On Super Local Antimagic Total Edge Coloring of Some Wheel Related Graphs
(2018-10-29)
Let G be a connected graph, let V(G) be the vertex set of graph G, and let
E(G) be the edge set of graph G. Thus, the
bijective function f : V(G) ∪ E(G) −→ {1, 2, 3, ..., |V(G)| + |E(G)|} is called a local antimagic ...
On Super Edge Local Antimagic Total Labeling by Using an Edge Antimagic Vertex Labeling Technique
(2019-07-25)
In this paper, we consider that all graphs are finite, simple and connected. Let G(V,E) be a graph of vertex set V and edge set E. By a edge local antimagic total labeling, we mean a bijection f:V(G)∪E(G)→{1,2,3,...,|V(G)|+|E(G)|} ...