The line graph lg of a graph g is the graph whose vertex set is. Here we introduce a new notion called mean cordial labeling. On 3total edge product cordial labeling of tadpole, book. Computing narayana prime cordial labeling of web graphs and. Hereafter, we denote by gn the subfamily containing thennode graphs ofg. Introduction all the graphs considered are simple and undirected. Graph theory by harary4, dynamic survey of graph labeling 3. Theory and applications labeled graphs are becoming an increasingly useful family of mathematical models for a broad range of applications.
A graph with admits a cordial labeling is called a cordial graph. By combining the divisibility concept in number theory and cordial labeling concept in graph labeling, varatharajan, navaneethakrishnan and nagarajan22 introduced a new concept called divisor cordial labeling in 2011. A graph labeling is an assignment to vertices or edges or both subject to certain conditions. Divisor cordial graphs smarandache notions journal. Graph labeling connects many branches of mathematics and is considered one of important blocks of graph theory, for more details see 3. Difference cordial labeling of graphs obtained from.
All the graphs with p 5 are graceful except c 5, k. Abstract the total product cordial labeling is a variant of cordial labeling. A graph which admits prime cordial labeling is called prime cordial graph. The graph g is called signed cordial if it is admits a signed cordial labeling.
Supergraph of a graceful graph need not be a graceful graph. Graph labeling connects many branches of mathematics and is consider one of the important blocks of graph theory. The origin of the study of graph labeling as a major area of graph theory can be traced to a research paper by rosa 4. Total magic cordial labeling of complete multipartite graphs n. The cordial labeling for the fourleaved rose graph. The cordial labeling for edges of p k i,j,i 1 to t, k 1 to4rtand j 1 as 0011 sequence is. A graph g is cordial if it admits cordial labeling. A graph labeling is an assignment of labels to edges, vertices or both.
Most graph labeling methods were introduced by rosa 10 in 1967. In this paper we deal only finite, simple, connected and undirected graphs obtained through graph operations. A cordial graph is a graph that admits a cordial labeling. Apr 25, 2016 part bipartite graph in discrete mathematics in hindi example definition complete graph theory duration. Every graph is a subgraph of a connected difference cordial graph. A graph labeling is an assignment of integers to the vertices or edges or both subject to certain condition s. The vital application of labeled graphs can be found in science, engineering and technology and we refer 4 for the same. Computing narayana prime cordial labeling of web graphs.
Further we prove that the wheel graph wn admits prime cordial labeling for n. Computation of narayana prime cordial labeling of book graphs. The concept of cordial labeling was introduced by cahit, i. One of the important areas in graph theory is graph labeling used in many applications like coding theory, xray crystallography, radar, astronomy, circuit design, communication network addressing, data base management. Subgraph of a graceful graph need not be a graceful graph. In this article, we compute the narayana prime cordial labeling of web graphs and flower graphs. Rosa, on certain valuation of the vertices of a graph, theory of graphs internat. A graph is called total edge product cordial if it admits total edge product cordial labeling. Introduction the concept of graph labeling was introduced by rosa in 1967 6. Cordial and 3equitable labeling for some wheel related graphs s k vaidya, n a dani, k k kanani, p l vihol abstractwe present here cordial and 3equitable labeling for the graphs obtained by joining apex vertices of two wheels to a new vertex. We prove that the mirror graphs of even cycle cn, even path pn and hypercube qk are e cordial graphs.
The total edge product cordial labeling of graph with pendant vertex. A graph is perfectly cordial if there exists a vertex labeling f such that vfo vf1 and efo ef1. It is a graph consisting of triangles sharing a common edge. Every edge product cordial graph of either even order or even size admits total edge product cordial labeling. The 7page book graph of this type provides an example of a graph with no harmonious labeling. An edgegraceful labelling on a simple graph without loops or multiple edges on p vertices and q edges is a labelling of the edges by distinct integers in 1, q such that the labelling on the vertices induced by labelling a vertex with the sum of the incident edges taken modulo p assigns all values from 0 to p. Total edge product cordial labeling of graphs samir k.
For the basic definitions of graph theory refer douglas b. A fan graph fn is obtained from a path pn by adding a new vertex and. Cordial labeling for some new graphs, international journal of mechanical. In the intervening years dozens of graph labelings techniques have been studied in over 1700 papers. Qualitative labelings of graph elements have inspired research in diverse fields of human enquiry such as conflict resolution in social psychology. Here we investigate e cordial labeling of some mirror graphs. Total magic cordial labeling of complete multipartite. We follow the standard notations and terminology of graph theory as in. Let g be an edge product cordial graph with order p and size q. He also investigated several results on this newly dened concept. We follow the basic notations and terminologies of graph theory as in 2. Part of the advances in intelligent systems and computing book series aisc, volume 412 in this paper we introduce a new graph labeling called zumkeller cordial labeling of a graph g.
Product cordial and total product cordial labelings of. Hence it is clear that the graph gis cordial labeled graph or cordial graph. For graph theoretic terminology, we refer to harary 2 and bondy 1. Pdf kcordial labeling of triangular book, triangular book with. We investigate product cordial labeling for some new graphs. Riskin 12, seoud and abdel maqusoud 14, diab 2, lee and liu 5, vaidya, ghodasara, srivastav, and kaneria 15 were worked in cordial labeling. A wheel graph wn is obtained from a cycle cn by adding a new vertex and joining it to all the vertices of the cycle by an edge, the new edges are called the spokes of the wheel. Harary 7 and dynamic survey of graph labeling by galian j. The total edge product cordial labeling of graph with. The concept of acordial labeling was introduced by hovey 2 and proved the following results. This process on the graph g is known as narayana prime cordial labeling of g and this graph g is called narayana prime cordial graph. Selvaraj 3 department of mathematics periyar university salem, tamil nadu, india abstract let g v,e be a graph. A graph is called cordial if it admits cordial labeling. It is important to note that the function f, responsible of the distance computation, is independent of g.
Solving the wolverine problem with graph coloring infinite. In this paper, we prove that path, comb, star, complete bipartite, k. In this paper an analysis is made on union of graphs are prime cordial labeling. When, is cycle and is product cordial if and only if. This process on the graph g is known as narayana prime cordial labeling of g and this graph g is called narayana prime cordial. In cordial labeling the induced edge labels are absolute difference of vertex labels while in product cordial labeling the induced edge labels are product of vertex labels. More generally, l,f is a distance labeling scheme for the graph family g if it is a distance labeling for every graph g. We investigate the mean cordial labeling behavior of some standard graphs. The vital application of labeled graphs can be found in science, engineering and technology and we refer 4 for. Cordial and 3equitable labeling for some wheel related graphs. Barasarab adepartment of mathematics, saurashtra university, rajkot 360005, gujarat, india. In 1980, cahit 1 introduced the concept of cordial labeling of graphs. R m prihandini 1,4, i h agustin 1,3, dafik 1,2, e r albirri 1,2, r adawiyah 1,2 and r alfarisi 1,4. We prove that splitting graph of the star graph and triangular book graph are.
On 3total edge product cordial labeling of tadpole, book and. Keywords graph labeling, duplicate graph, triangular ladder, bistar, double star, signed product cordial labeling. The concept of cordial labeling was introduced by cahit. Some new standard graphs labeled by 3total edge product. After this some labelings schemes like prime cordial labeling, a cordial labeling, h cordial labeling, product. The word cordial was used first time in this paper. A graph which admits a prime cordial labeling is called a prime cordial graph. The mirror graph mg of g is obtained from g and g\ by joining each vertex of v2 to its corresponding vertex in v2\ by an edge. Applications of graph labeling in communication networks. In any cordial labeling of graph the values assigned to vertex. A graph g vg,eg is said to be acordial if there is a mapping f. A graph g is called cordial if it admits cordial labeling. Cordial labeling concept was first introduced in 1987 by cahit 1, and there has been a. Paper open access the total edge product cordial labeling.
Signed product cordial labeling in duplicate graphs of bistar. A labeling of a graph is a map that carries the graph elements to the set of numbers, usually to the set of non. The process of assigning the binary numbers 0 and 1 to the edges of a graph \g v, e\ through evaluating functions defined on the vertex set v and the edge set e of g using the concepts of prime and narayana numbers by satisfying cordiality on the edges. A note on lcordial labeling of graphs international journal of. Finally, we investigate total vertex product cordial labeling for many families of graphs, namely fan graph, wheel graph, helm graph, double star graph, cycle and fully binary tree graph. In, if for, then the number of these vertices has the same parity with, and these vertices induce a path in the. We have the following notations, in order to know cordial labeling \h\ and its sorts. Graph theory, signed cordial graph, petersen graph, book graph, jahangir graph. Lcordial labeling, double snake, book graph, union. A labeling of a graph is an assignment of labels to vertices or edges or both following certain rules 4. Sathish narayanan, difference cordial labeling of graphs obtained from triangular snakes, application and applied mathematics, 92 2014, 811825. A graph labeling is an assignment of integers to the vertices or edges, or both, subject to certain conditions.
A prime cordial labeling of a graph with the vertex set is a bijection such that each edge is assigned the label 1 if and 0 if. Theory and applications graph labelings, where the vertices and edges are assigned, real values subject to certain conditions, have often been motivated by their utility to various applied fields and their intrinsic mathematical interest logico mathematical. Keywords graph labeling, cordial graphs, cordial labeling, product cordial labeling, vertex total cordial labeling, total vertex product cordial labeling. Pdf some more sum divisor cordial labeling of graphs. The concepts of graph labeling began about 50 years ago, and have been research topics for many mathematicians all over the world. Let g be a graph obtained by joining two copies of shell graph by a path of length.
Chapter 5 total edge product cordial labeling of graphs. A note on difference cordial graphs palestine journal of mathematics. Cahit was the rst person to use the word cordial 3. Apr 06, 2017 graph coloring may seem simple but the mathematics behind it is surprising difficult and it pops up in a number strange places. Some new results on prime cordial labeling hindawi. Cordial labeling of graphs if the vertex labels a ii 1. A graph labeling is an assignment of integers to the vertices or edges, or both, subject. For any undefined term in graph theory we rely upon gross and yellen 8. A graph with a difference cordial labeling is called a difference cordial graph. Cahit3 introduced cordial labeling of graphs and derived various results on cordial graphs.
Here we have contributed some new result is by investigating cordial. Yilmaz and cahit 1997 6 introduced edgecordial labeling as a weaker. Remainder cordial labeling of cycle related graph s. Let, be the successive vertices of 1st copy of shell graph and let. In this paper we investigate that cycle with one chord path cycle with one chord, cycle with twin chord path cycle with twin chord admit sum divisor cordial labeling. On analogous of this, the notion of difference cordial labeling has been introduced by ponraj et al. By a graph we mean a finite, undirected graph without multiple edges or loops. In 1967 rosa introduced graceful labeling of graphs. Cordial labeling was rst introduced in 1987 by cahit 1, then there was a major e ort in this area made this topic growing steadily and widely,see2.
We refer the text book harary 3, for notations, concepts and terminology in graph theory. The following is a simple example of a difference cordial graph. A prime cordial labeling of a graph with vertex set is a bijection. A prime cordial labeling of a graph with the vertex set is a bijection such that. The concept of cordial labeling was introduced by cahit2. The concept of prime cordial labeling was introduced by sundaram 5 et al. Kragujevacjournalofmathematics volume4022016,pages290297. Most graph labeling methods trace their origin to one introduced by rosa 8 in 1967, or one given by graham and sloane 4 in 1980. A graph labeling is an assignment of numbers to the vertices or edges or both subject to certain conditions. Pdf we discuss here 4cordial labeling of three graphs. The origin of graph labeling is graceful labeling which was introduced by rosa 1967.
A cordial graph is a graph whose vertices and edges have 01 labeling in such a way that the number of vertices edges labelled with zeros and the number of vertices edges labelled with ones differ absolutely by at most one. L cordial labeling, double snake, book graph, union. We follow the basic notation and terminology of graph theory as in 7, while for number theory we refer to burton 6 and of graph labeling as in 3. The graph obtained by joining two copies of shell graph by a path of arbitrary length is cordial. In the same paper cahit 1 proved many results on cordial labeling. Cordial labeling for the splitting graph of some standard graphs. For even m, mkn has an even number of vertices and an even number of edges, so cordiality is equivalent to perfect cordiality when m is even. Note that interchanging the vertex labels 0 and 1 in a cordial labeling results in a new cordial labeling of g. In this paper we prove that the split graphs of k1,n and bn,n are prime cordial graphs. To understand more about graph labeling as well as bibliographic references we refer gallian 1. A binary vertex labeling of graph g is called cordial labeling if jvf 0 vf 1 j 1 and jef 0 ef 1 j 1.
A cordial labeling is a friendly labeling f for which c f. Labeling of graphs plays an important role in application of graph theory in neural networks, coding theory, circuit. Ebrahim salehi 2010 defined the notion of product cordial set. A second type, which might be called a triangular book, is the complete tripartite graph k 1,1,p. Kelsey discusses sudoku, the four color theorem, the hadwiger nelson. Lucky edge labeling, lucky number, ladder graph, shell graph and book with triangular pages. G maxfdv j v 2 vg is the maximum degree of the vertices in the graph g. In the present chapter we contribute eleven new results corresponding to product cordial labeling. A divisor cordial labeling of a graph g with vertex set v is a bijection f from.
We prove that the friendship graph, cycle with one chord except when n is even and the chord joining the vertices at diameter distance. Difference cordial labeling of the graphs related to. We introduce a new type of graph labeling called as lcordial labeling and show that k 1,n,path p n, c n,sc 3,n are families of lcordial graphs. Ecordial labeling of path union of wheel related graphs. We introduce a new type of graph labeling called as l cordial labeling and show that k 1,n,path p n, c n,sc 3,n are families of l cordial graphs.
Dec 19, 2015 in this paper we introduce a new graph labeling called zumkeller cordial labeling of a graph g v, e. In each possibility the graph under consideration satisfies the vertex conditions and edge conditions for 7 cordial labeling as shown in table 2. A graph with a sum divisor cordial labeling is called a sum divisor cordial graph. Let v g be the vertex set and e g be the edge set of graph g. In this paper we investigate signedcordiality of complete graph k n, book graph, jahangir graph, flower graph. A sum divisor cordial labeling of a graph g with vertex set v is a bijection f from. The concept of cordial labeling was introduced by cahit 1. Labeled graphs plays an important role in communication network addressing and models for constraint programming over finite domains 2. We also show that the square graph of bn,n is a prime cordial graph while middle graph of pn is a prime cordial graph for n. Graph labelings were rst introduced in the late 1960s. Graph labeling is a strong communication between number theory and structure of graphs. The field of graph theory plays vital role in various fields.
95 1353 622 1516 318 718 39 579 1133 403 1085 192 943 1507 1119 181 665 105 748 1127 912 50 581 392 1475 1207 920 1117 992 61 925 78 913 232 110 215 417 966 625 1052