• No results found

[PDF] Top 20 Abstract: In this paper a new labeling known as n-edge magic labeling is introduced. Let G (V, E) be

Has 10000 "Abstract: In this paper a new labeling known as n-edge magic labeling is introduced. Let G (V, E) be" found on our website. Below are the top 20 most common "Abstract: In this paper a new labeling known as n-edge magic labeling is introduced. Let G (V, E) be".

Abstract: In this paper a new labeling known as n-edge magic labeling is introduced. Let G (V, E) be

Abstract: In this paper a new labeling known as n-edge magic labeling is introduced. Let G (V, E) be

... this paper are finite, simple, planer and undirected. The graph G has the vertex set V (G) and edge set E ...A labeling of a graph G is a mapping that carries graph ... See full document

8

Algorithm to Construct Super Vertex Magic
Total Labeling of Complete Graphs

Algorithm to Construct Super Vertex Magic Total Labeling of Complete Graphs

... Let G = (V, E) be a graph which is finite, simple and undirected ...graph G has a vertex set V = V (G) and edge set E = E(G) ...an ... See full document

5

Further Results on Complementary Super Edge Magic Graph Labeling

Further Results on Complementary Super Edge Magic Graph Labeling

... A labeling of a graph G is an assignment of mathematical objects to vertices , edges, or both vertices and edges subject to certain ...Graph labeling have applications in coding theory, networking ... See full document

6

Even Vertex Magic Total Labeling of Isomorphic and Non Isomorphic Suns

Even Vertex Magic Total Labeling of Isomorphic and Non Isomorphic Suns

... this paper all graphs are finite, simple and undirected. The graph G has vertex set V (G) and edge set E (G) and we let m = |E(G)| and n = ... See full document

10

Some New Families Of Face Integer Edge Cordial Graphs

Some New Families Of Face Integer Edge Cordial Graphs

... graph G means a graph G = (V,E), where V is the set of vertices with |V| = p, E is the set of edges with |E| = q and F is the set of interior faces of G with ... See full document

8

Edge Magic Total Labeling of the Cycle $C_n$ with $P_3$  Chords

Edge Magic Total Labeling of the Cycle $C_n$ with $P_3$ Chords

... A labeling of a graph is any map that carries some set of graph elements to numbers (usually to the positive or non-negative ...integers). Magic labeling was introduced by Sedlacek in 1963 [3 ... See full document

7

Abstract. In this paper, we investigate the SD-Prime cordial labeling of Pl n

Abstract. In this paper, we investigate the SD-Prime cordial labeling of Pl n

... neighborhood-prime labeling of graph was introduced by Patel et ...al. introduced the notation of k-neighborhood-prime labeling of graph in ...was introduced a variant of prime graph ... See full document

7

Totally magic cordial labeling of some graphs

Totally magic cordial labeling of some graphs

... this paper are finite, simple and undirected. The graph G has vertex set V = V ( G ) and edge set E = E ( G ) and we write p for | V | and q for | ... See full document

8

Some Graph Labelings on Middle Graph of Extended Duplicate Graph of a Path

Some Graph Labelings on Middle Graph of Extended Duplicate Graph of a Path

... graph labeling was introduced by Rosa in 1967. A graph labeling is an assignment of integers to the vertices or edges or both subject to certain ...various labeling of graphs such as graceful ... See full document

6

Adjacent Edge Graceful Graphs

Adjacent Edge Graceful Graphs

... this paper are finite, simple and undirected graphs. Let ( p , q ) be a graph with p = | V ( G ) | vertices and q = | E ( G ) | ...Graph labeling, where the vertices and ... See full document

11

Existence and Non-Existence of some V4 Cordial graphs

Existence and Non-Existence of some V4 Cordial graphs

... Let G = (V,E) be a simple graph. Let f:V(G) {0,1} and for each edge uv , assign the label ...cordial labeling if the number of vertices labeled 0 and the the ... See full document

7

Fuzzification of Some Cycle Related Graphs

Fuzzification of Some Cycle Related Graphs

... [1]Mathew Varkey T K and Sunoj B S, “ADCSS-Labeling of 2-Tuple Graphs of Some Graphs”,IOSR Journal of Mathematics,Vol.12,Issue 5 Ver.V(Sep-Oct2016), pp 12-15. [2] Mathew Varkey T K and Sreena T D , “Fuzzy Digraph ... See full document

6

On Edge Regular Fuzzy Soft Graphs

On Edge Regular Fuzzy Soft Graphs

... this paper, degree of an egde and total degree of an edge in a fuzzy soft graph is introduced, edge regular fuzzy soft graphs, and totally edge regular fuzzy soft graphs are also ... See full document

11

Radio mean D-distance number of cycle-related graphs

Radio mean D-distance number of cycle-related graphs

... D-distance labeling of a connected graph G is an injective map f from the vertex set V(G) to the such that for two distinct vertices u and v of G, d D (u, v) + ≥ 1 + diam ... See full document

5

Group Magic Labeling of Multiple Cycles

Group Magic Labeling of Multiple Cycles

... group magic labeling of few biregular graphs have been dealt ...group magic labeling of two or more cycles with a common vertex is ...this paper the group magic labeling ... See full document

5

V, Ebe a graph. A mapping

V, Ebe a graph. A mapping

... The research work presented here provide five new results in the theory of 3-equitable labeling of graphs. The entire work is focused on joining two copies of some graph by a path of arbitrary length. In ... See full document

15

SUM SQUARE PRIME LABELING OF SOME SNAKE GRAPHS

SUM SQUARE PRIME LABELING OF SOME SNAKE GRAPHS

... prime labeling. Graph labeling as a whole has applications in various scientific and engineering ...prime labeling is also useful to solve various application ... See full document

7

A Study on Magic Labeling Regular Graph

A Study on Magic Labeling Regular Graph

... Definition: Let G be a graph with vertex set V and edge set ...denote v = |V | and e = |E|. Let λ be a one-to-one mapping λ: VE → {1, 2, ... See full document

6

Edge Mean Labeling Of a Regular Graphs

Edge Mean Labeling Of a Regular Graphs

... that G = G(V, E) is a finite, simple and undirected graph with p vertices and q ...Mean labeling was introduced by ...this paper, we study the edge odd and even ... See full document

10

Pentagonal Graceful Labeling of Caterpillar Graphs

Pentagonal Graceful Labeling of Caterpillar Graphs

... graph G = (V, E) with p vertices and q edges is said to admit pentagonal graceful labeling if its vertices can be labeled by non negative integers such that the induced edge labels ... See full document

5

Show all 10000 documents...