[PDF] Top 20 Public investment and growth: a survey

... of cordial labeling of graphs ...of prime cordial labeling. A prime cordial labeling of a graph G with vertex set V is a bijection f : V → {1, 2, ...the prime ... See full document

... We consider simple, finite, connected and undirected graph G = (V, E). For various graph theoretic notations and terminology we follow Gross and Yellen[2] and for the concepts and terminology of number theory we follow ... See full document

... -prime cordial labeling is called a k-prime cordial ...4- prime cordial labeling behavior of complete graph, book, flower, mC n and some more ... See full document

... complete graphs, comb, double comb, triangular snake, double triangular snake, ladder, friendship graph, flower graph, gear graph, Jelly fish, book, irregular triangular snake, corona of irregular triangular ... See full document

... assign the labels 2,3,1 to the vertices u 1 , u 2 , u 3 respectively. Then we assign the labels 2,3,1 to the next three vertices u 4 , u 5 , u 6 resepctively. Continuing this way to assign the next six vertices ... See full document

... – Cordial Labeling (LCL) was introduced in ...standard graphs. Prime cordial, Cube difference and Square difference labeling of H- related graphs has been studied in ...related ... See full document

... [8]A prime cordial labeling of G with vertex set V(G) is a bijection f : V(G) → {1, 2, 3, … , |()|} such that each edge uv is assigned the label 1 if gcd (f(u), f(v)) = 1 and 0 if gcd (f(u), f(v)) ... See full document

... A prime cordial labeling of a graph G with vertex set V(G) is a bijection f : V(G) → {1, 2, 3,… ,|V(G)|} such that for every edge uv is assigned the label 1 if gcd (f(u), f(v)) = 1 and 0 if gcd ... See full document

... path graphs, subdivision of comb graph, subdivision of ladder graph and the graph obtained by attaching star graph at one end of the path are SD-prime cordial ...SD-prime cordial ... See full document

... Labeled graphs serve as useful models in a broad range of applications such as circuit design, communication network addressing, X-ray crystallography, radar, astronomy, data base management and coding ...of ... See full document

... of cordial labeling of graphs. The cocept of k-difference cordial graph was introduced in [4] ...k-total prime cordial graph ...difference cordial labeling of ...differnce ... See full document

... of prime graph labeling of graph in ...SD-prime cordial labeling and they discussed SD-prime cordial labeling for some standard ...SD-prime cordial graph. In [3], ... See full document

... the possible assignment of la- bels to adjacent v e (1,2),(1,3), (1,4), (1,5), (2,3), (2,4), (2,5), (3,4), (3,5). Such assignment will generate maximum one bel 0 and minimum four edges with label 1. That e f   0  e f ... See full document

... Let G = (V (G),E (G)) be a simple, finite and undirected graph with vertex set V (G) and edge set E (G). All notation not defined in this paper can be found in [4]. Graph labeling is currently an emerging area in the ... See full document

... The recent survey on graph labeling can be found in Gallian [6]. Vast amount of literature is available on different types of graph labeling. According to Beineke and Hegde [2] graph labeling serves as a frontier between ... See full document

... is called a wheel. In a wheel, a vertex of degree 3 is called a rim vertex. A vertex which is adjacent to all the rim vertices is called the central vertex. The edges with one end incident with the rim and the ... See full document

... Double-Blind Peer Reviewed Refereed Open Access International e-Journal - Included in the International Serial Directories Aryabhatta Journal of Mathematics and Informatics. http://www.[r] ... See full document

... A graph G is a finite non-empty set of objects called vertices together with a set of unordered pairs of distinct vertices of G called edges.Each pair e={u,v} of vertices in E is called edges or a line of G.In this ... See full document

... Let 𝐺 = (𝑉, 𝐺) be a graph with 𝑝 vertices and 𝑞 edges. A Analytic Mean Cordial Labeling of a Graph G with vertex set is a bijection from 𝑣 = {1,2 … . . 𝑝}.The induced edge labelling are defined by 𝑓(𝑢, 𝑣) = 0 if ... See full document

... a cordial labeling if the number of vertices labeled 0 and the the number of vertices labeled 1 differ by atmost 1 and also the number of edges labeled 0 and the the number of edges labeled 1 differ by atmost ... See full document