[PDF] Top 20 Antimagic Labeling of Some Path and Cycle Related Graphs

... edge labeling of a graph is a bijection from E(G) to the set {1,2,… , ...edge labeling is called antimagic ...investigate antimagic labeling for some path and cycle ... See full document

... inating set of minimum cardinality. The concept of detour dominating set have been introduced in recent past by Char- trand et al. [2]. It is very interesting to investigate detour domination number of a graph as the ... See full document

... cordial labeling was introduced by Sundaram et ...unicyclic graphs of odd order, triangular snakes, dragons, helms and union of two path graphs are product ...The graphs obtained by ... See full document

... Cordial Labeling (LCL) was introduced in ...of some standard ...difference labeling of H- related graphs has been studied in ...of path related graphs is ... See full document

... cordial labeling of ...cordial labeling behavior of star, m copies of star ...cordial labeling behavior of path, cycle, complete graph, complete bipar- tite graph, star, bistar, comb, ... See full document

... cordial labeling behaviour of path, cycle, star, bistar, some complete graphs, comb, double comb, triangular snake, double triangular snake, ladder, friendship graph, flower graph, gear ... See full document

... All graphs in this paper are simple finite undirected and nontrivial graph G = (V, E) with vertex set V and the edge set ...graph labeling is regularly updated by Gallian [3] and it is published by ... See full document

... cordial labeling of ...remainder labeling of graphs and investigated the remainder cordial labeling behavior of several graphs like path, cycle, complete graph, star, ... See full document

... prime labeling of a graph is the labeling of the vertices with {0,1,2---,p-1} and the edges with mean of the square of the sum of the labels of the incident vertices or mean of the square of the sum of the ... See full document

... We look at a computer network as a connected undirected graph. A network designer may want to know which edges in the network are most important. If these edges are removed from the network, there will be a great ... See full document

... The graphs we consider are finite, connected, and simple and un- ...graph labeling [3] for definitions and ...a labeling called as vertex prime labeling of ...prime labeling is called ... See full document

... prime labeling of a graph is the labeling of the vertices with {0,1,2---------,p-1} and the edges with absolute difference of the sum of the squares of the labels of the incident vertices and product of the ... See full document

... cordial labeling of a graph G is a bijection f from V (G) to {1, 2, ...cordial labeling is called a divisor cordial ...that cycle with one chord, cycle with twin chords, barycentric ... See full document

... sum labeling has been introduced in [1]. The Pair sum labeling behavior of some standard graphs like complete graph, cycle, path, bistar, and some more standard ... See full document

... notations related to graph labeling, we refer to Gallian ...mean labeling of graph. Analytic mean labeling of various types of graphs are presented in ... See full document

... graph labeling is an assignment of integers to the vertices or edges or both subject to certain ...characterize some path related graphs for oblong mean prime ... See full document

... prime labeling of a graph is the labeling of the vertices with {1,2---,p} and the edges with absolute difference of the mean of the squares of the labels of the incident vertices and the sum of the labels ... See full document

... evidence labeling of a graph is a process of labeling the vertices and edges and there by fuzzify the ...verex labeling is done by an injective function m and the edge labeling is done by an ... See full document

... certain graphs for this ...cordial labeling of graphs. Also we investigate some general results on k- total prime cordial graphs and investigate 4-total prime cordial labeling of ... See full document

... magic labeling is introduced.Fuzzy magic labeling for some graphs like path, cycle and star graph are ...fuzzy labeling graph, but the converse is not ...a cycle ... See full document