In this paper we investigate mean labeling of shadow graph of bistar and comb and splitting graph of comb. The game is called sprouts and it is an invention of john horton conway. Math 215 project number 1 graph theory and the game. Barnes lnrcersrry of cambridge frank harary unroersi. Labeling theory provides a distinctively sociological approach that focuses on the role of social labeling in the development of crime and deviance. A graph is rpartite if its vertex set can be partitioned into rclasses so no edge lies within a class. The field of graph theory plays vital role in various fields.
If gis a graph we may write vg and eg for the set of vertices and the set of edges respectively. A graph2 consists of a set of points3, and a set of lines4 connecting these points. This outstanding book cannot be substituted with any other book on the present textbook market. Graph theory with applications to engineering and computer science by narsingh deo. If v is a vertex of graph g, then the degree of v, denoted degv d gv, or d v is the number of edges incident to v. Graph theory types of graphs there are various types of graphs depending upon the number of vertices, number of edges, interconnectivity, and their overall structure. A graph is kcolourable if it has a proper kcolouring. Library of congress cataloging in publication data. Proof letg be a graph without cycles withn vertices and n. 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.
A forest is an undirected graph in which any two vertices are connected by at most one path, or equivalently an acyclic undirected graph, or equivalently a disjoint union of trees. Acta scientiarum mathematiciarum deep, clear, wonderful. S, studies of graph theory factorizations and decompositions of graphs, ph. It is immaterial whether these lines are long or short, straight or crooked. Every acyclic graph contains at least one node with zero indegree. The explicit hnking of graph theory and network analysis began only in 1953 and has. Graph theory notes vadim lozin institute of mathematics university of warwick 1 introduction a graph g v. A graph with such a labeling is an edge labeled graph. The notes form the base text for the course mat62756 graph theory.
Such graphs are called trees, generalizing the idea of a family tree, and are considered in chapter 4. This is a serious book about the heart of graph theory. He introduced me to the world of graph theory and was always patient, encouraging and resourceful. Graph theory keijo ruohonen translation by janne tamminen, kungchung lee and robert piche 20. Pdf graph theory with applications to engineering and. Graph theory 3 a graph is a diagram of points and lines connected to the points. As we shall see, a tree can be defined as a connected graph. Berges fractional graph theory is based on his lectures delivered at the indian statistical institute twenty years ago. Complete bipartite graph, path union, join sum of graphs, star of a graph. These four regions were linked by seven bridges as shown in the diagram.
Introduction these brief notes include major definitions and theorems of the graph theory lecture held by prof. Introduction to graceful graphs 2 acknowledgment i am deeply indebted to my late supervisor prof. The concept of graphs in graph theory stands up on some basic terms such as point, line, vertex, edge, degree of vertices, properties of graphs, etc. It has every chance of becoming the standard textbook for graph theory. Graph theory in network analysis university of michigan. For the remainer of this paper whenever refering to a graph we will be refering to an edge labeled graph. In mathematics, graph theory is the study of graphs, which are mathematical structures used to model pairwise relations between objects. Graph theory and applications wh5 perso directory has no. Algorithmsslidesgraphtheory at master williamfiset. Graph theory is the mathematical study of connections between things. Turans graph, denoted t r n, is the complete r partite graph on n vertices which is the resultofpartitioning n verticesinto r almostequallysizedpartitionsb nr c, d nr eandtakingalledges.
In the course of the problems we shall also work on writing proofs that use mathematical. Gary chartrand, introductory graph theory, dover publ. Connections between graph theory and cryptography hash functions, expander and random graphs anidea. The authors have elaborated on the various applications of graph theory on social media and how it is represented viz.
Electronic edition 2000 c springerverlag new york 1997, 2000. The explicit linking of graph theory and network analysis began only in 1953 and has been rediscovered many times since. Hamilton hamiltonian cycles in platonic graphs graph theory history gustav kirchhoff trees in electric circuits graph theory history. The function f sends an edge to the pair of vertices that are its endpoints. It took a hundred years before the second important contribution of kirchhoff 9 had been made for the analysis of electrical networks. Consider the connected graph g with n vertices and m edges. This is formalized through the notion of nodes any kind of entity and edges relationships between nodes. Prove that if uis a vertex of odd degree in a graph, then there exists a path from uto another vertex vof the graph where valso has odd degree.
We also prove that star of complete bipartite graph is graceful. Math 215 project number 1 graph theory and the game of sprouts this project introduces you to some aspects of graph theory via a game played by drawing graphs on a sheet of paper. The dots are called nodes or vertices and the lines are called edges. They contain an introduction to basic concepts and results in graph theory, with a special emphasis put on the networktheoretic circuitcut dualism. Any graph produced in this way will have an important property. Mean labeling of some graphs international journal of. Nonplanar graphs can require more than four colors, for example this graph this is called the complete graph on ve vertices, denoted k5. Graph theory is a very popular area of discrete mathematics with not only numerous theoretical developments, but also countless applications to practical problems. When i had journeyed half of our lifes way, i found myself within a shadowed forest, for i had lost the path that does not. The aim of journal of graph labeling is to bring together original and significant research articles in different areas of graph labeling and graph coloring.
Basic concepts in graph theory the notation pkv stands for the set of all kelement subsets of the set v. It has at least one line joining a set of two vertices with no vertex connecting itself. The length of the lines and position of the points do not matter. Ringel, pearls in graph theory, academic press1994 6 meena. Applications of graph labeling in communication networks. Much of graph theory is concerned with the study of simple graphs. If f is an injection from the vertices of g to the set. Graph is a mathematical representation of a network and it describes the relationship between lines and points. This article gives an information about the most popular problem which is called travelling salesman problem. A graph is bipartite if and only if it has no odd cycles.
Analysts have taken from graph theory mainly concepts and terminology. Berge includes a treatment of the fractional matching number and the fractional edge chromatic number. Z, in other words it is a labeling of all edges by integers. Graph theory 81 the followingresultsgive some more properties of trees. Formally, a graph is a pair of sets v,e, where v is the. We present here cordial and 3equitable labeling for the graphs obtained by joining apex vertices of two shells to a new vertex. A graph is a set of points, called vertices, together with a collection of lines, called edges, connecting some of the points.
A graph consists of some points and lines between them. If the components are divided into sets a1 and b1, a2 and b2, et cetera, then let a iaiand b ibi. To formalize our discussion of graph theory, well need to introduce some terminology. A graph g is a pair of sets v and e together with a function f. Also to learn, understand and create mathematical proof, including an appreciation of why this is important. They were introduced by hoffman and singleton in a paper that can be viewed as one of the prime sources of algebraic graph theory. Lecture notes on graph theory budapest university of. The river divided the city into four separate landmasses, including the island of kneiphopf. Show that if every component of a graph is bipartite, then the graph is bipartite. In graph theory, a tree is an undirected graph in which any two vertices are connected by exactly one path, or equivalently a connected acyclic undirected graph. This little paperback contains a nice, easytoread introduction to. Reinhard diestel graph theory electronic edition 2000 c springerverlag new york 1997, 2000 this is an electronic version of the second 2000 edition of the above springer book, from their series graduate texts in mathematics, vol. Somasundaram and ponraj 4 have introduced the notion of mean labeling of graphs. 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.
56 1321 1557 867 589 377 473 231 968 2 269 130 404 401 1262 931 86 1325 1183 956 1340 1584 479 530 963 1616 381 800 1629 1386 846 697 532 1441 482 1483 765 1399 876 98