A graph g is said to be edgegraceful if it admits an. Introduction a graph g of size q is odd graceful, if there is an injection. In this paper, we study the super gracefulness of complete graph, the disjoint union of certain star graphs, the complete tripartite graphs k 1, 1, n, and certain families of trees. In this paper we introduced fuzzy vertex gracefulness and discussed to wheel graphs and fan graphs. Some topics in graph theory the purpose of this book is to provide some results in a class of problems categorized as graph labeling. Graceful labeling for open star of graphs by invention. Mehendale sir parashurambhau college, pune411030, india. The book includes number of quasiindependent topics. In this paper, we have constructed an edge even graceful labeling on. The handbook of graph theory is the most comprehensive singlesource guide to graph theory ever published. Rosa a 1967 on certain valuations of the vertices of a graph. Edge even graceful labeling on circulant graphs with.
The graph labeling model and its application to the problem of edge linking. Finally, we introduce a new conjecture the revised friendship graph fkc n is odd graceful where k is any positive integer and n 0 mod 4. As a research area, graph theory is still relatively young, but it is maturing rapidly with many deep results having been discovered over the last couple of decades. Subbiah lecturer sg in mathematics, periyar evr college, trichy 620 023, india email. A graph g is called graceful if it has a graceful labeling. Pdf graceful labeling of some graphs and their subgraphs. Applications of graph labeling in communication networks. Labeling the nodes of g with distinct nonnegative integers and then labeling the e edges of g with the absolute differences between node values, if the graph edge numbers run from 1 to e, the graph g is gracefully numbered.
A graceful labeling of a graph g with q edges is an injective assignment of labels from 0, 1. Some of the major themes in graph theory are shown in figure 3. We discussed here graceful labeling for cycle of graphs. In this paper the prime labeling of certain classes of graphs are discussed. Each diagonal parallel to the main diagonal of must have exactly one black square for the graph to be graceful. Bestselling authors jonathan gross and jay yellen assembled an outstanding team of experts to contribute overviews of more than 50 of the most significant topics in graph theoryincluding those related to algorithmic and optimization approach. Odd graceful labeling of acyclic graphs science publishing. Abstract a method to obtain all possible graceful spanning trees in a complete graph is proposed.
Let be a graph obtained by replacing each vertices of except the apex vertex by the graph let is the. Graph theory is a very popular area of discrete mathematics with not only numerous theoretical developments, but also countless applications to practical problems. Nov 28, 2014 graceful labeling for open star of graphs ii. A comprehensive introduction by nora hartsfield and gerhard ringel. On graceful labeling of some graphs with pendant edges. This is a very good introductory book on graph theory.
Let g v, e be a finite, simple and undirected graph. This labeling was originally introduced in 1967 by rosa. Graceful labeling of arbitrary supersubdivision of grid. 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. A graph with such a function defined is called a vertexlabeled graph. Introduction a graph g of size q is oddgraceful, if there is an injection. A graph g with q edges is said to be oddgraceful if there is an injection f. If you dont want to be overwhelmed by doug wests, etc. Identify the edges of with suitable edges of, where q eg 3. On sequential labelings of graphs grace 1983 journal of. A labeled graph g which can be gracefully numbered is said to be graceful.
Research in graph theory has lead to one of the important area called labeling of graphs. As we mention there the ringel conjecture and many efforts to settle it provided the reason for various graph labeling problems. There are many kinds of graph labeling such as graceful labeling, magic labeling, prime labeling, and other different labeling techniques. The upperright and lowerleft squares of the adjacency matrix thus always contain a 1, shown as a black square here. A graph g with q edges is said to be odd graceful if there is an injection f. Z, in other words it is a labeling of all edges by integers.
Graceful labeling for corona and flower graph aip publishing. A valuation on a simple graph g is an assignment of labels to the vertices of g which induces an assignment of labels to the edges of g. A graph is called graceful if it has at least one such labeling. Graceful labeling is one of the interesting topics in graph theory. V 1,2, n for every vertex such that each edge is labeled a distinct integer 1,2, n. A graph g, which admits graceful labeling is called graceful graph. Edge even graceful labeling of polar grid graphs mdpi. Odd graceful labeling of the revised friendship graphs. The graceful labeling was introduced by rosa rosa 1967, p. A complete bipartite graph is a bipartite graph such that two vertices are adjacent if and only if they are in different partite sets. Most of these topics have been discussed in text books. A bit of history the concept of graceful labeling was initially used to attack the problem of the decomposition of graphs. Graceful labeling i for a connected graph g with q edges, a vertex labeling f. The notation and terminology used in this paper are taken from gallian 9.
Solairaju and chithra introduced a new type of labeling of a graph g with p vertices and q edges called an edge odd graceful labeling if there is a bijection f from the edges of the graph to the set 1, 3, 2 q. For anyone interested in learning graph theory, discrete structures, or algorithmic design for graph. This book teaches basic graph theory through excerpts from original papers in english translation. Gracefully labeled graphs serve as models in a wide range of applications including coding theory and communication network addressing. A generalized theta graph consisting of n internal disjoint paths. A labeling graph g which can be gracefully numbered is said to be graceful. The injective mapping is called graceful if the weight of edge are all different for every edge xy. Covers design and analysis of computer algorithms for solving problems in graph theory. 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 new graceful labeling for pendant graphs springerlink. Fuzzy vertex graceful labeling on wheel and fan graphs. A graceful labeling of a graph g is a mapping of function f. Keywords graph theory, odd graceful labeling, friendship graphs. Read, highlight, and take notes, across web, tablet, and phone. Introductory graph theory by gary chartrand, handbook of graphs and networks. In graph theory, a graceful labeling of a graph with m edges is a labeling of its vertices with some subset of the integers between 0 and m inclusive, such that no two vertices share a label, and each edge is uniquely identified by the absolute difference between its endpoints, such that this magnitude lies between 1 and m inclusive. Further results on super graceful labeling of graphs. In mathematics, graph theory is the study of graphs, which are mathematical structures used to model pairwise relations between objects. The study of graceful labeling of graphs with pendant edges is given by christian barrientos 14. It is of interest to note that hgraph which is a 3 regular. In between, the authors discuss the history and the mathematical concepts at an elementary level, hoping that the book may serve as a first textbook of graph theory. Some labeling with variations in graceful theme are also. Concluding remarks we introduced here a new graph is called cycle of graphs.
The labeling pattern is demonstrated by means of illustrations, which provide better understanding of derived results. A graph g with q edges and p vertices is said to be edge graceful if there exists a bijection f from the. For k 1, the function f is called a super graceful labeling and a graph is super graceful if it admits a super graceful labeling. Includes a collection of graph algorithms, written in java, that are ready for compiling and running. Discusses applications of graph theory to the sciences. A distinction is made between undirected graphs, where edges link two vertices symmetrically, and directed. Each time the count of lattice points decreases by unity as we move down by one row till. It covers all the topics required for an advanced undergrad course or a graduate level graph theory course for math, engineering, operations research or. An edge even graceful labeling of a simple graph g with p vertices and q edges is a bijection f from the edges of the graph to the set 2, 4, 2 q such that, when each vertex is assigned the sum of all edges incident to it mod 2 r where r max p, q, the resulting vertex labels are distinct. There are different types of labeling such as graceful labeling, magic labeling, edgegraceful labeling, prime labeling, radio labeling, harmonious labeling etc. 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. Formally, given a graph g v, e, a vertex labelling is a function of v to a set of labels. There are several types of graph labeling and a detailed survey is found in 4. The field of graph theory plays vital role in various fields.
An algorithm to generate all the labeled spanning trees in a complete graph is developed and modified to generate all graceful spanning trees. Let g be an undirected graph without loops or double connections between vertices. In this paper we investigate strong edge graceful labeling of windmill graph. Each vertex and each edge of is rotated times from the original position. Graph labeling is an important area of research in graph theory. A graph with such a labeling is an edge labeled graph. Square graceful labeling of some graphs open access journals. I used this book to teach a course this semester, the students liked it and it is a very good book indeed.
Contents 1 introduction 3 2 notations 3 3 preliminaries 4 4 matchings 5 connectivity 16 6 planar graphs 20 7 colorings 25 8 extremal graph theory 27 9 ramsey theory 31 10 flows 34 11 random graphs 36 12 hamiltonian cycles 38 references 39. Chapter 5 fibonacci graceful labeling of some graphs. Several authors worked on graceful labeling, odd graceful labeling, even graceful labeling, super graceful labeling and skolem graceful labeling. A function f is called graceful labeling of a graph g v. Agraph which admits graceful labeling is called graceful graph. Haggkvist conjectured that if g is a 2m regular graph and t is a tree with m edges then eg decomposes into n copies of t. I such a labeling is called graceful if the edges are labeled 1. A graph which admits a fuzzy graceful labeling is called a fuzzy graceful graph. The name graceful labeling was coined later by golomb. The graceful labeling of the graph then corresponds to the.
Abstract we define so called ndelta lattice containing n1 lattice points in first topmost row, n2 lattice points in second row, and so on. Gao 6 in which he studied the odd graceful labeling of union of any number of paths and union of any number of stars, we have determined odd graceful labeling for some other union of graphs. Fibonacci and super fibonacci graceful labeling of some graphs 103 5. Edge odd graceful labeling of some path and cycle related. A graph in this context is made up of vertices also called nodes or points which are connected by edges also called links or lines. A graph g is said to be strong edge graceful if it admits a strong edge graceful labeling.
303 1434 4 1130 939 1592 1346 228 1393 815 1202 671 1321 730 491 447 644 173 317 74 973 1016 207 296 1080 478 211 1636 1400 1579 824 935 1000 831 857 785 1607 282 613 1139 505 33 784 1017 68 1432 1299 1214 323