What are some good books for selfstudying graph theory. We investigate prime labeling for some graphs resulted by identifying any two vertices of some graphs. If is an odd integer then the prism graph is not prime proof. Further we prove that the wheel graph wn admits prime cordial labeling for n.
Introductory graph theory by gary chartrand, handbook of graphs and networks. Studies in graph theory magic labeling and related. A graph which admits prime labeling is called a prime graph. Free graph theory books download ebooks online textbooks. A graph with no cycle in which adding any edge creates a cycle. A second type, which might be called a triangular book, is the complete tripartite graph k 1,1,p.
A concise introduction to a fascinating field of data analytics. A graph with a minimal number of edges which is connected. Prime labeling for duplication of graph elements in k e. The most interesting problem is to prove the prime tree conjecture. Find the top 100 most popular items in amazon books best sellers. Buy studies in graph theory magic labeling and related concepts. In the present work we investigate some classes of graphs which admit prime.
One kind, which may be called a quadrilateral book, consists of p quadrilaterals sharing a common edge known as the spine or base of the book. Pdf a graph g v, e with n vertices is said to admit prime labeling if its vertices. 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. Some topics in graph theory the purpose of this book is to provide some results in a class of problems categorized as graph labeling. Computation of narayana prime cordial labeling of book graphs. Under the umbrella of social networks are many different types of graphs. In mathematics, graph theory is the study of graphs, which are mathematical structures used to model pairwise relations between objects. It is a graph consisting of triangles sharing a common edge. I used this book to teach a course this semester, the students liked it and it is a very good book indeed. In the mathematical discipline of graph theory, a graph labelling is the assignment of labels, traditionally represented by integers, to edges andor vertices of a graph.
A coprime labeling of a simple graph of order n is a labeling in which adjacent vertices are given relatively prime labels, and a graph is prime if the labels used can be taken to be the rst n positive integers. If is odd then we can use at the most even integers to label the vertices of a cycle. A read is counted each time someone views a publication summary such as the title, abstract, and list of authors, clicks on a figure, or views or downloads the fulltext. The notion of prime labeling was originated by entringer and was discussed in a. Studies in graph theory magic labeling and related concepts. Prime labeling for some helm related graphs open access. A graph with maximal number of edges without a cycle. A graph with such a function defined is called a vertexlabeled graph. Vg 1,2,p is called a prime labeling if for each edge euv, gcdfu, fv1. Thus in all the possibilities f1 admits a prime labeling for 1. In this paper, we consider when ladder graphs are prime and when the corresponding labeling may be done in a cyclic manner around. A comprehensive introduction by nora hartsfield and gerhard ringel. So those guards can monitor the change and ensure coverage. A graph g v, e with n vertices is said to admit prime labeling if its vertices can be labeled with distinct positive integers not exceeding n such that the labels of each pair of adjacent.
This book depicts graph labelings that have led to thoughtprovoking. Aa a a the labels assigned to x and y are relatively prime. A graph which satisfies the conditions of prime labeling and harmonious labeling is called a prime harmonious labeling. They contain an introduction to basic concepts and results in graph theory, with a special emphasis put on the networktheoretic circuitcut dualism. Formally, given a graph g v, e, a vertex labelling is a function of v to a set of labels. Z, in other words it is a labeling of all edges by integers. A graph which admits total prime labeling is called total prime graph. Gallians survey paper on graph labelings claims one exists and cites fu and huangs on prime labelling, which in turn cites an unpublished paper for this result.
Identify the edges of with suitable edges of, where q eg 3. A graph which admits a prime harmonious labeling is called a prime harmonious graph and it is denoted by p h. For graph theoretic terminology, we refer to harary 2. A graph that admits a prime labelling is called a prime graph. In this paper we investigate prime labeling for k n e where e is an edge. Most of these topics have been discussed in text books.
Graph labeling is one of the fascinating areas of graph theory with wide ranging applications. A prime labeling of a graph of order is an injective function such that for every pair of adjacent vertices and. The 7page book graph of this type provides an example of a graph with no harmonious labeling. A graph with such a labeling is an edge labeled graph. Vaidya and vihol 6 have also discussed prime cordial labeling in the context of graph operations while in 7 the same authors have discussed prime cordial labeling for some cycle related graphs. Umbrella graph, p nqs n graph, c nq sn graphs are square difference graphs. Nagarajan 1 investigate neighbourhood prime labeling for some special graphs like friendship graph, gear, ladder, triangular book and coconut tree. Buy studies in graph theory magic labeling and related. By a prime labeling, we mean a way to label the n vertices with the integers 1 to n such that each pair of adjacent vertices is relatively prime.
The prime labeling for the vertices of wheel graph g is v0 1. Vaidya and shah 8 have investigated many results on this concept. In this paper we prove that the split graphs of k1,n and bn,n are prime cordial graphs. In this paper the prime labeling of certain classes of graphs are discussed. There are many kinds of graph labeling such as graceful labeling, magic labeling, prime labeling, and other different labeling techniques. In the following figures 3 and 4 prime labeling of a graph of order 5 and the prime labeling for the graph g1 obtained by identifying the vertices of with label 1 and 5 are shown. Immersion and embedding of 2regular digraphs, flows in bidirected graphs, average degree of graph powers, classical graph properties and graph parameters and their definability in sol, algebraic and modeltheoretic methods in. A graph with n nodes and n1 edges that is connected. In this paper, we investigate several families of edge vertex prime labeling for triangular and rectangular book, butterfly graph, drums graph dn. Some new results on prime graphs scientific research publishing. A graph is known as graceful when its vertices are labeled from 0 to v, the size of the graph, and this labelling induces an edge labelling from 1 to e.
Many families of graphs are known to admit prime labelings such as paths, stars, caterpillars, complete binary trees, spiders, palm trees, fans, flowers, and. From the above assignment the vertex labelings are distinct. Applied graph theory provides an introduction to the fundamental concepts of graph theory and its applications. Set theory, matrix maths and some calculus is a prerequisite to using the tools in this book.
Neighbourhood prime labeling on some graphs semantic scholar. Covering all its major recent developments it can be used both as a reliable textbook for an introductory course and as a graduate text. For all other terminology and notations we follows harary harary 1972. A difference labeling of g is an injection f from v to the set of non. The book includes number of quasiindependent topics. The notion of prime labeling was originated by entringer and was discussed in t out, a. 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. Around 1980 roger etringer conjectured that all trees have prime labeling which is not settled till today. It is of interest to note that hgraph which is a 3 regular graph satisfy prime labeling.
It focuses on the linguistic tendency of majorities to negatively label minorities or those seen as deviant from norms. The notes form the base text for the course mat62756 graph theory. Research directions, contains ten articles, mainly survey type, on some current research areas in graph theory, namely, graceful labeling, l2,1labelling, complexity of graph labeling problems, dominations, interval graphs, matrices and graphs, colouring of labelled graphs and hypergraphs, selfcomplementary graphs, and strongly regular graphs. In general, all the graphs are not prime, it is very interesting to investigate graph families which admit prime labelling. Edge vertex prime labeling of some graphs malaya journal of. The fourth edition of this standard textbook of modern graph theory has been carefully revised, updated, and substantially extended. The 7page book graph of this type provides an example of a graph with no harmonious labeling a second type, which might be called a triangular book, is the complete. Square difference labeling, square difference graph. Prime labeling of families of trees with gaussian integers. Covers basic graph theory and then goes off into a wide range of applications and analytic tools. All unicyclic graphs have a prime vertex labeling seoud and youssef 5.
We consider only simple, finite, connected and undirected graph. A coprime labeling of a simple graph of order n is a labeling in which adjacent vertices are given relatively prime labels, and a graph is prime if the labels used can be taken to be the. That is, it is a cartesian product of a star and a single edge. A graph g which admits prime labeling is called a prime graph. Discover delightful childrens books with prime book box, a subscription that.
Pdf some results on prime and kprime labeling researchgate. Graph theorydefinitions wikibooks, open books for an open. Each vertex and each edge of is rotated times from the original position. In the following figures 3 and 4 prime labeling of a graph of order 5 and the prime labeling for the graph g1 obtained by. So we have to use 1 to natural numbers to label these vertices, and from 1 to there are even integers. Grid paper notebook, quad ruled, 100 sheets large, 8. The vital application of labeled graphs can be found in science, engineering and technology and we refer 4 for the same. Yellen, graph theory and its applications, crc press, boca raton, 1999. We also introduce the concept of strongly prime graph and prove that the graphs c n, p n, and k 1,n are strongly prime graphs. Many families of graphs are known to admit prime labelings such as paths, stars, caterpillars, complete binary trees, spiders, palm trees, fans, flowers, and many more. V1,2,3, is called prime labelling if for each eu,v belong to e, we have gcd fu,fv1.
An enormous body of literature has grown around graph labeling in the last five decades. The overflow blog how the pandemic changed traffic trends from 400m visitors across 172 stack. Moreover we prove that w n is a strongly prime graph for every even integer n. In recent years, graph theory has established itself as an important mathematical tool in a wide variety of subjects, ranging from operational research and chemistry to genetics and linguistics, and from electrical engineering and geography to sociology and architecture. The graph which admits prime labeling is called a prime graph. Applications of graph labeling in communication networks. Department of mathematics, seattle university, 901 12th avenue, seattle. 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. Browse other questions tagged binatorics graphtheory primenumbers graphcolorings applications or ask your own question. Dec 11, 2009 labeling theory holds that deviance is not a quality of the act because it is the result of personality factors associated with committing deviance. A graph in which any two nodes are connected by a unique path path edges may only be traversed once. Topics include basic graph theory, colorings of graphs, circuits and cycles, labeling graphs, drawings of graphs, measurements of closeness to planarity, graphs. Every wheel graph wn is prime graph when n is odd and n. We prove that the graph obtained by subdivision of pendent edges of stars, bistars, coconut trees and kite graphs are all total prime graphs.
E be a simple, undirected and nite graph with p vertices and q edges. Introduction all graphs in this paper are simple finite undirected and nontrivial graph gv, e with vertex set v and the edge set e. Around 1980 roger etringer conjectured that all trees have prime labeling which is. Buy studies in graph theory magic labeling and related concepts book online at best prices in india on. It is of interest to note that h graph which is a 3 regular graph satisfy prime labeling. A graph with vertex set v is said to have a prime labeling if its vertices are labeled with distinct integers 1,2,3 aa a a such that for edge aa a a. Quad ruled 4 squares per inch blank graphing paper notebook large 8. Diestel is excellent and has a free version available online. A graph on n vertices admits a prime labeling if its vertices can be labeled with the first n natural numbers in such a way that any two adjacent vertices have relatively prime labels. It is not the easiest book around, but it runs deep and has a nice unifying theme of studying how. Covers fundamentals of different interpretations of labeling graphs. For the remainer of this paper whenever refering to a graph we will be refering to an edge labeled graph. Some of the major themes in graph theory are shown in figure 3.
1284 504 1463 391 516 199 625 1160 935 208 1282 1478 1433 1553 1421 990 424 1636 1218 247 1147 341 113 548 426 1656 216 711 777 608 1633 1224 693 320 1289 366 10 35 1020 1490 196