DOCSLIB.ORG

Graceful Pairings

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Graceful Pairings AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 75(3) (2019), Pages 343{356 Graceful pairings Jocelyn R. Bell Department of Mathematics and Computer Science Hobart and William Smith Colleges Geneva, NY 14456 U.S.A. [email protected] Desmond F. Cummins Department of Computer Science Wells College Aurora, NY 13026 U.S.A. [email protected] Abstract A graceful labeling of a graph G with n edges is an injection from the set of vertices of G to f0; 1; : : : ; ng such that if each edge of G is labeled by the absolute value of the difference of the labels of its incident vertices, then every edge has a distinct label in f1; : : : ; ng. The famously unsettled graceful labeling conjecture proposes that every tree has a graceful labeling. A graceful labeling θ of a graph G is said to be gracious if for each vertex v of G either all adjacent vertices have larger labels than θ(v) or all adjacent vertices have smaller labels than θ(v). We introduce novel machinery for combining graceful bipartite graphs to produce new graceful graphs. If the constituent graphs have a gracious labeling then our methods produce a gracious labeling. Infinite families of gracious trees are produced and new classes of graceful trees are introduced. Along the way we offer a partial solution to a question posed in 1979. 1 Introduction Graceful labelings of graphs were introduced by A. Rosa in 1967 [19]. These labelings have practical as well as theoretical applications. For example, graceful labelings played a central role in the solution of the two-table Oberwolfach problems [21]. A graceful graph with n edges cyclically decomposes the complete graph on 2n + 1 ISSN: 2202-3518 c The author(s). Released under the CC BY 4.0 International License J.R. BELL AND D.F. CUMMINS / AUSTRALAS. J. COMBIN. 75 (3) (2019), 343{356 344 Figure 1: A gracious tree which cannot be α-labeled vertices [19]. There are graphs which are not graceful but it is unknown whether or not every tree is graceful. The graceful tree conjecture proposes that every tree is graceful. While many papers have been written on this conjecture [9] it remains unresolved. Some general methods for generating graceful labelings have been discovered [9]; for some previous constructions, see [5] and [13]. The \product" method presented in [13] (in fact, it appears earlier in [20]) has been subsequently modified and extended many times (see [3, 14, 15]). In this paper we present new methods for combining certain families of gracefully labeled graphs to produce new gracefully labeled graphs. These theorems are of particular interest since our construction is fundamentally different from previous constructions. A graph G is a set of vertices V (G) together with a set of edges E(G) ⊆ V (G) × V (G) whose elements are denoted uv. All graphs are assumed to be simple and connected. If G is a graph and v is a vertex of G, the neighborhood of v in G, denoted by N(v); is the set of all vertices adjacent to v.A tree is a connected graph with no cycles. We refer the reader to West [22] for definitions omitted. A labeling of a graph G is an injection θ : V (G) ! f0; 1; 2;:::g.A labeled graph is a pair (G; θ) where G is a graph and θ is a labeling of G. When θ is clear from context, we may refer to the labeled graph (G; θ) as G and the vertex v of G which is labeled k as the k-vertex of G. Every labeling θ of a graph G induces a labeling on E(G) in the following manner: if uv is an edge of G, assign the induced edge label θ(uv) := jθ (u) − θ (v)j to the edge uv. A labeling θ of a graph G with n edges is graceful if the range of θ is contained in the set f0; 1; : : : ; ng and the set of induced edge labels is precisely f1; 2; : : : ; ng. If a graph G admits a graceful labeling then G is said to be graceful. All trees with at most 35 vertices are claimed to be graceful in [8]. For a comprehensive survey of known results on the topic of graceful labeling see [9]. A labeling θ of a graph G with n edges is said to be an α-labeling (originally termed an α-valuation by Rosa [19]) if there exists a natural number s such that for all edges uv of G, either θ(u) ≤ s < θ(v) or θ(v) ≤ s < θ(u). The number s is the boundary value of the α-labeling. In this paper Pn will denote the path with n edges and n + 1 vertices. All paths and caterpillar graphs (paths with any number of additional pendant vertices) can be α-labeled [19]. However, there are graceful trees for which an α-labeling does not exist. The smallest example of such a tree is the \spider" with 3 legs, each of which has two edges: see Figure 1. A labeling θ of a graph G is said to be ordered if for each v 2 V (G), either for all J.R. BELL AND D.F. CUMMINS / AUSTRALAS. J. COMBIN. 75 (3) (2019), 343{356 345 u 2 N(v), θ(u) < θ(v) or for all u 2 N(v), θ(u) > θ(v). This definition appears to be due to Cahit [6]; however the concept is also introduced in [10] in which it is called a gracious labeling and a graph admitting a gracious labeling is termed gracious. It is also rediscovered in [7], therein referred to as a near-α labeling. In this paper we will use the term gracious. Every α-labeled tree is also a gracious tree, but not conversely; see Figure 1. It is well-known that the tree in Figure 1 has no α-labeling. Every tree with at most 20 vertices has been verified to have a gracious labeling [10]. The ordered (or near-α or gracious) labeling conjecture proposes that every tree has an ordered labeling [6, 7, 10]. Every graph with k edges with a gracious labeling cyclically decomposes the complete graph on 2kn + 1 vertices [7]. A graph G is bipartite if there exists a partition (A; B) of V (G) such that for each edge e of G, e = uv where u 2 A and v 2 B. If G admits an α-labeling or a gracious labeling then G is bipartite. Not all bipartite graphs are graceful; for example the cycle graph C6 is bipartite yet fails to be graceful [19]. If (G; θ) is a gracefully labeled graph with n edges, the complementary labeling θ¯ of G is defined for each vertex v of G by θ¯(v) = n − θ(v). If θ is a graceful labeling, an α-labeling, or a gracious labeling, then so is θ:¯ If f is a function, ranf will denote the range of f. If (G; θ) is a labeled graph, a relabeling function is a function f : ranθ ! f0; 1; 2;:::g. We may abuse notation and denote (G; f ◦ θ) by (G; f). Suppose (G; θ) is a gracefully labeled bipartite graph with bipartition (A; B). We will say an edge e of G is positively oriented (with respect to the bipartition (A; B)) provided e = uv where u 2 A, v 2 B and θ(u) > θ(v). The labeling θ is gracious if and only if the set of positively oriented edges of G is either empty or is equal to E(G). Definition 1.1. Suppose C = f(G1; θ1) ;:::; (Gm; θm)g is an indexed collection of disjoint bipartite gracefully labeled graphs each with n edges. C is a compatible collection if there exists a partition (A; B) of f0; 1; : : : ; ng and for each i with 1 ≤ 0 0 0 i ≤ m there exists a bipartition (Ai;Bi) of V (Gi) so that if Ai = fθi(v): v 2 Aig, 0 Bi = fθi(v): v 2 Big and Pi = fθi(uv): uv is a positively oriented edge of Gig ; then for each i, Ai ⊆ A, Bi ⊆ B and Pi = P1. If C is a compatible collection in which all graphs are graciously labeled, then C is a gracious compatible collection. See Figure 2 for an example of a gracious compatible collection for which one may choose A = f3; 4; 6; 7g, B = f0; 1; 2; 5g, and 0 Bi to be the set of vertices of Gi colored white. Definition 1.2. Suppose C = f(G1; θ1) ;:::; (Gm; θm)g is a compatible collection of graphs. For each i with 1 ≤ i ≤ m, let wi be the 0-vertex of Gi and let Zi = fθi(vwi): vwi 2 E(Gi)g. C is a 0-compatible collection if for each i, Zi = Z1. See Figure 3 for an example of a 0-compatible collection of graphs each with 7 edges for which Z1 = f5; 7g. J.R. BELL AND D.F. CUMMINS / AUSTRALAS. J. COMBIN. 75 (3) (2019), 343{356 346 Figure 2: A gracious compatible collection Figure 3: A 0-compatible collection We introduce graceful pairings in Section 2. In Section 3 we prove that if m = 2k + 1, C = f(G1; θ1) ;:::; (Gm; θm)g is a (gracious) 0-compatible collection, and G is a (graciously) gracefully labeled graph with k edges, then the graph formed by identifying the graphs G; G1;:::;Gm at their 0-vertices is (gracious) graceful.
Load more

Recommended publications
  • Graceful Labeling for Bipartite Graceful Graphs and Related Graphs Chunfeng Liua, Xiuyingwangb ,Guozhu Liub 
    Graceful Labeling For bipartite graceful Graphs and related Graphs a b b Chunfeng Liu , XiuyingWang ,Guozhu Liu a ( College of Science, Liaoning University of Technology, Liaoning,Jinzhou，121013) ( bCollege of Information Science and Technology，Qingdao University of Science and Technology， Shandong, Qingdao 266000) Abstract: The concept of graceful labels was proposed by Rosa, scholars began to study graceful labels of various graphs and obtained relevant results.In this paper，let G is a bipartite graceful graph, we proved that t ★ S(t·G), Pn (tn·G), C(t·G) and G are graceful labelings. Key words: Graceful labeling, Bipartite graceful Graphs, Open star of graphs, Cycle of a graph, Path union of a graph 1. INTRODUCTION AND LEMMEL The graceful labeling was introduced by A Rosa [1] in 1967. Golomb [2] proved that the complete bipartite graph is graceful. Barrientos [3] proved that union of complete bipartite graphs is also graceful. Vaidya [4] introduced a star of cycle. Kaneria and Makadia [5] proved that star of a cycle is graceful. Kaneria [6] proved that join sum of path union and star are graceful graphs. The detail survey of graph labeling refer Gallian [7]. t Let G is a bipartite graceful graph, In this paper, we proved that S(t·G), Pn (tn·G), C(t·G) and G★ are graceful graphs. We assume G is a simple undirected, finite graph, with vertices and edges. For all terminology and notations we follow Harary [8]. We shall give brief summary of definitions which are useful in this paper. Definition1.1 A function f is called graceful labeling of a (p, q)-graph G if f: V(G) → {0,1,2,…,q}is injective and induced function f *: E(G)→{0,1,2,…,q} defined as f (e)=│f(u)−f(v)│ is bijective for every edge e=uv.
    [Show full text]
  • GRACEFUL and PRIME LABELINGS -Algorithms, Embeddings and Conjectures
    GRACEFUL AND PRIME LABELINGS-Algorithms, Embeddings and Conjectures Group Discussion (KREC, Surathkal: Aug.16-25, 1999). Improved Version. GRACEFUL AND PRIME LABELINGS -Algorithms, Embeddings and Conjectures Suryaprakash Nagoji Rao* Exploration Business Group MRBC, ONGC, Mumbai-400 022 Abstract. Four algorithms giving rise to graceful graphs from a known (non-)graceful graph are described. Some necessary conditions for a graph to be highly graceful and critical are given. Finally some conjectures are made on graceful, critical and highly graceful graphs. The Ringel-Rosa-Kotzig Conjecture is generalized to highly graceful graphs. Mayeda-Seshu Tree Generation Algorithm is modified to generate all possible graceful labelings of trees of order p. An alternative algorithm in terms of integers modulo p is described which includes all possible graceful labelings of trees of order p and some interesting properties are observed. Optimal and graceful graph embeddings (not necessarily connected) are given. Alternative proofs for embedding a graph into a graceful graph as a subgraph and as an induced subgraph are included. An algorithm to obtain an optimal graceful embedding is described. A necessary condition for a graph to be supergraceful is given. As a consequence some classes of non-supergraceful graphs are obtained. Embedding problems of a graph into a supergraceful graph are studied. A catalogue of super graceful graphs with at most five nodes is appended. Optimal graceful and supergraceful embeddings of a graph are given. Graph theoretical properties of prime and superprime graphs are listed. Good upper bound for minimum number of edges in a nonprime graph is given and some conjectures are proposed which in particular includes Entringer’s prime tree conjecture.
    [Show full text]
  • Decompositions and Graceful Labelings (Supplemental Material for Intro to Graph Theory)
    Decompositions and Graceful Labelings (Supplemental Material for Intro to Graph Theory) Robert A. Beeler∗ December 17, 2015 1 Introduction A graph decomposition is a particular problem in the field of combinatorial designs (see Wallis [22] for more information on design theory). A graph decomposition of a graph H is a partition of the edge set of H. In this case, the graph H is called the host for the decomposition. Most graph decomposition problems are concerned with the case where every part of the partition is isomorphic to a single graph G. In this case, we refer to the graph G as the prototype for the decomposition. Further, we refer to the parts of the partition as blocks. As an example, consider the host graph Q3 as shown in Figure 1. In this case, we want to find a decomposition of Q3 into isomorphic copies of the path on three vertices, P3. We label the vertices of P3 as an ordered triple (a, b, c). where ab and bc are the edges of P3. The required blocks in the decompositions are (0, 2, 4), (1, 0, 6), (1, 3, 2), (1, 7, 5), (3, 5, 4), and (4, 6, 7). Usually, the goal of a combinatorial design is to determine whether the particular design is possible. The same is true for graph decompositions. Namely, given a host graph H and a prototype G, determine whether there exist a decomposition of H into isomorphic copies of G. Often, this is a difficult problem. In fact, there are entire books written on the subject (for ∗Department of Mathematics and Statistics, East Tennessee State University, Johnson City, TN 37614-1700 USA email: [email protected] 1 2 0 1 2 3 4 5 6 7 Figure 1: A P3-decomposition of a Q3 example, see Bos´ak [1] and Diestel [5]).
    [Show full text]
  • Graceful Labeling of Graphs
    GRACEFUL LABELING OF GRAPHS Rodrigo Ming Zhou Dissertação de Mestrado apresentada ao Programa de Pós-graduação em Engenharia de Sistemas e Computação, COPPE, da Universidade Federal do Rio de Janeiro, como parte dos requisitos necessários à obtenção do título de Mestre em Engenharia de Sistemas e Computação. Orientadores: Celina Miraglia Herrera de Figueiredo Vinícius Gusmão Pereira de Sá Rio de Janeiro Dezembro de 2016 GRACEFUL LABELING OF GRAPHS Rodrigo Ming Zhou DISSERTAÇÃO SUBMETIDA AO CORPO DOCENTE DO INSTITUTO ALBERTO LUIZ COIMBRA DE PÓS-GRADUAÇÃO E PESQUISA DE ENGENHARIA (COPPE) DA UNIVERSIDADE FEDERAL DO RIO DE JANEIRO COMO PARTE DOS REQUISITOS NECESSÁRIOS PARA A OBTENÇÃO DO GRAU DE MESTRE EM CIÊNCIAS EM ENGENHARIA DE SISTEMAS E COMPUTAÇÃO. Examinada por: Prof. Celina Miraglia Herrera de Figueiredo, D.Sc. Prof. Vinícius Gusmão Pereira de Sá, D.Sc. Prof. Rosiane de Freitas Rodrigues, D.Sc. Prof. Raphael Carlos Santos Machado, D.Sc. RIO DE JANEIRO, RJ – BRASIL DEZEMBRO DE 2016 Zhou, Rodrigo Ming Graceful Labeling of Graphs/Rodrigo Ming Zhou. – Rio de Janeiro: UFRJ/COPPE, 2016. IX, 40 p.: il.; 29; 7cm. Orientadores: Celina Miraglia Herrera de Figueiredo Vinícius Gusmão Pereira de Sá Dissertação (mestrado) – UFRJ/COPPE/Programa de Engenharia de Sistemas e Computação, 2016. Bibliography: p. 38 – 40. 1. graceful labeling. 2. computational proofs. 3. graphs. I. de Figueiredo, Celina Miraglia Herrera et al. II. Universidade Federal do Rio de Janeiro, COPPE, Programa de Engenharia de Sistemas e Computação. III. Título. iii Resumo da Dissertação apresentada à COPPE/UFRJ como parte dos requisitos necessários para a obtenção do grau de Mestre em Ciências (M.Sc.) GRACEFUL LABELING OF GRAPHS Rodrigo Ming Zhou Dezembro/2016 Orientadores: Celina Miraglia Herrera de Figueiredo Vinícius Gusmão Pereira de Sá Programa: Engenharia de Sistemas e Computação Em 1966, A.
    [Show full text]
  • A Guide to the Graph Labeling Zoo
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector DISCRETE APPLIED MATHEMATICS ELSBVIER Discrete Applied Mathematics 49 (1994) 213-229 A guide to the graph labeling zoo Joseph A. Gallian Department of Mathematics and Statistics, University of Minnesota, Duluth, MN 55812. USA Received 12 June 1991: revised 10 December 1991 Abstract In this paper we survey many of the variations of graceful and harmonious labeling methods that have been introduced and summarize much of what is known about each kind. 1. Introduction A vertex labeling, valuation or numbering of a graph G is an assignment f of labels to the vertices of G that induces for each edge xy a label depending on the vertex labels f(x) and f(y). Most graph labeling methods trace their origin to one introduced by Rosa [Ga66]’ in 1967, or one given by Graham and Sloane [Ga36] in 1980. Rosa [Ga66] called a functionfa p-valuation of a graph G with 4 edges iffis an injection from the vertices of G to the set (0,1, . , q} such that, when each edge xy is assigned the label IS(x) -f(y) 1, the resulting edge labels are distinct. (Golomb [Ga32] sub- sequently called such labelings grac@ and this term is now the popular one.) Rosa introduced /?-valuations as well as a number of other valuations as tools for decompo- sing the complete graph into isomorphic subgraphs. In particular, /&valuations originated as a means of attacking the conjecture of Ringel [Ga64] that K2,,+ 1 can be decomposed into 2n + 1 subgraphs that are all isomorphic to a given tree with n edges.
    [Show full text]
  • Matching-Type Image-Labelings of Trees
    mathematics Article Matching-Type Image-Labelings of Trees Jing Su 1,†, Hongyu Wang 2,† and Bing Yao 3,*,† 1 School of Electronics Engineering and Computer Science, Peking University, No. 5 Yiheyuan Road, Haidian Distruct, Beijing 100871, China; [email protected] 2 National Computer Network Emergency Response Technical Team/Coordination Center of China, Beijing 100029, China; [email protected] 3 College of Mathematics and Statistics, Northwest Normal University, Lanzhou 730070, China * Correspondence: [email protected]; Tel.: +86-1335-942-8694 † These authors contributed equally to this work. Abstract: A variety of labelings on trees have emerged in order to attack the Graceful Tree Conjecture, but lack showing the connections between two labelings. In this paper, we propose two new labelings: vertex image-labeling and edge image-labeling, and combine new labelings to form matching-type image-labeling with multiple restrictions. The research starts from the set-ordered graceful labeling of the trees, and we give several generation methods and relationships for well-known labelings and two new labelings on trees. Keywords: graph labeling; tree; image-labeling; graceful labeling 1. Introduction and Preliminary 1.1. A Simple Introduction Citation: Su, J.; Wang, H.; Yao, B. A graph labeling is an assignment of non-negative integers to the vertices and edges Matching-Type Image-Labelings of of a graph subject to certain conditions. The problem of graph labeling can be traced to a Trees. Mathematics 2021, 9, 1393. well-known Ringel–Kotzig Decomposition Conjecture in popularization [1]: “A complete https://doi.org/10.3390/ graph K2n+1 can be decomposed into 2n + 1 subgraphs that are all isomorphic with a given tree math9121393 of n edges”.
    [Show full text]
  • Common Techniques in Graceful Tree Labeling with a New Computational Approach Michael Guyer
    Duquesne University Duquesne Scholarship Collection Electronic Theses and Dissertations Spring 2016 Common Techniques in Graceful Tree Labeling with a New Computational Approach Michael Guyer Follow this and additional works at: https://dsc.duq.edu/etd Recommended Citation Guyer, M. (2016). Common Techniques in Graceful Tree Labeling with a New Computational Approach (Master's thesis, Duquesne University). Retrieved from https://dsc.duq.edu/etd/609 This Immediate Access is brought to you for free and open access by Duquesne Scholarship Collection. It has been accepted for inclusion in Electronic Theses and Dissertations by an authorized administrator of Duquesne Scholarship Collection. For more information, please contact [email protected]. COMMON TECHNIQUES IN GRACEFUL TREE LABELING WITH A NEW COMPUTATIONAL APPROACH A Thesis Submitted to the McAnulty College & Graduate School of Liberal Arts Duquesne University In partial fulfillment of the requirements for the degree of Master of Science By Michael Guyer May 2016 Copyright by Michael Guyer 2016 COMMON TECHNIQUES IN GRACEFUL TREE LABELING WITH A NEW COMPUTATIONAL APPROACH By Michael Guyer Approved April 1, 2016 Dr. Karl Wimmer Dr. John Kern Associate Professor of Mathematics Associate Professor of Statistics (Committee Chair) (Department Chair) Dr. Rachael Neilan Dr. James Swindal Assistant Professor of Mathematics Dean, McAnulty College and Graduate (Committee Member) School of Liberal Arts Professor of Philosophy iii ABSTRACT COMMON TECHNIQUES IN GRACEFUL TREE LABELING WITH A NEW COMPUTATIONAL APPROACH By Michael Guyer May 2016 Thesis supervised by Dr. Karl Wimmer. The graceful tree conjecture was first introduced over 50 years ago, and to this day it remains largely unresolved. Ideas for how to label arbitrary trees have been sparse, and so most work in this area focuses on demonstrating that particular classes of trees are graceful.
    [Show full text]
  • A Note on Fuzzy Vertex Graceful Labeling on Double Fan Graph and Double Wheel Graph
    International Journal of Computational and Applied Mathematics. ISSN 1819-4966 Volume 12, Number 3 (2017), pp. 729-736 © Research India Publications http://www.ripublication.com A Note on Fuzzy Vertex Graceful labeling on Double Fan Graph and Double Wheel Graph K.Ameenal Bibi 1 and M.Devi2 2,1 PG and Research Department of Mathematics, D.K.M College for Women (Autonomous), Vellore-632001, India. Abstract A labeling on a Graph G which can be gracefully numbered is called a graceful labeling. If a fuzzy graph G admits a graceful labeling and if all the vertex labelings are distinct then G is called a fuzzy vertex graceful graph. In this paper, we discussed fuzzy vertex graceful labeling on double Fan Graph and Double Wheel Graph. Keywords: Fuzzy labeling, Graceful labeling, Fuzzy graceful labeling, Fuzzy Double Fan graph, Fuzzy Double Wheel graph. AMS Mathematics Subject Classification: 05C, 94D 1. INTRODUCTION Fuzzy is a newly emerging mathematical framework to exempt the phenomenon of uncertainty in real life tribulations. It was introduced by Zadeh in 1965, and the concepts were pioneered by various independent researchers, namely Rosenfeld, Kauffmann, etc. A Fuzzy set is defined mathematically by assigning a value to each possible individual in the universe of discourse, representing its grade of membership which corresponds to the degree, to which that individual is similar or compatible with the concept represented the fuzzy set. Based on Zadeh’s Fuzzy relation the first definition of a fuzzy graph was introduced by Kauffmann in 1973. The concept of a graceful 730 K.Ameenal Bibi and M.Devi labeling has been introduced by Rosa in 1967.This note is a further contribution on fuzzy graceful labeling.
    [Show full text]
  • Graceful Labelings of Partial Cubesଁ Boštjan Brešara, Sandi Klavžarb
    Discrete Mathematics 306 (2006) 1264–1271 www.elsevier.com/locate/disc -graceful labelings of partial cubesଁ Boštjan Brešara, Sandi Klavžarb aUniversity of Maribor, FEECS, Smetanova 17, 2000 Maribor, Slovenia bDepartment of Mathematics and Computer Science, University of Maribor, Koroška cesta 160, 2000 Maribor, Slovenia Received 19 February 2004; received in revised form 16 February 2006; accepted 28 February 2006 Available online 17 April 2006 Abstract Partial cubes are graphs that allow isometric embeddings into hypercubes. -graceful labelings of partial cubes are introduced as a natural extension of graceful labelings of trees. It is shown that several classes of partial cubes are -graceful, for instance even cycles, Fibonacci cubes, and (newly introduced) lexicographic subcubes. The Cartesian product of -graceful partial cubes is again such and we wonder whether in fact any partial cube is -graceful. A connection between -graceful labelings and representations of integers in certain number systems is established. Some directions for further investigation are also proposed. © 2006 Elsevier B.V. All rights reserved. Keywords: Graceful labelings; Trees; Ringel–Kotzig conjecture; Partial cubes; Fibonacci cubes; Hypercubes 1. Introduction Different graph labelings have been introduced so far, the origin of most of them is the seminal paper [22] by Rosa. For an overview of extensive developments in the area see the dynamic survey of graph labelings [11] as well as references therein. Let T be a tree on n vertices. A bijection f : V(T) →{0, 1,...,n− 1} is called a graceful labeling of T if the resulting edge labels, obtained by |f(x)− f(y)| on every edge xy, are all distinct.
    [Show full text]
  • Fuzzy Vertex Graceful Labeling on Wheel and Fan Graphs
    IOSR Journal of Mathematics (IOSR-JM) e-ISSN: 2278-5728, p-ISSN: 2319-765X. Volume 12, Issue 2 Ver. I (Mar. - Apr. 2016), PP 45-49 www.iosrjournals.org Fuzzy Vertex Graceful Labeling On Wheel And Fan Graphs R.Jebesty Shajila1, S.Vimala2, 1Ph D Research Scholar, Mother Teresa Women’s University, Kodaikanal 2Assistant Professor, Mother Teresa Women’s University, Kodaikanal, Abstract:A labeling graph G which can be gracefully numbered is said to be graceful. A graph which admits a fuzzy graceful labeling is called a fuzzy graceful graph. In this paper we introduced fuzzy vertex gracefulness and discussed to wheel graphs and fan graphs. Key words: Graceful labeling, Fuzzy graceful labelling I. Introduction Zadeh introduced the fuzzy set as a class of object with a continuum of grades of membership. In contrast to classical crisp sets where a set is defined by either membership or non-membership, the fuzzy approach relates to a grade of membership between [0,1], defined in terms of the membership function of a fuzzy number. Fuzzy relation on a set was first defined by Zadeh in 1965, the first definition of a fuzzy graph was introduced by Kaufmann in 1973 and the structure of fuzzy graphs developed by Azriel Rosenfeld in 1975. Fuzzy graphs have many more applications in modeling real time systems where the level of information inherent in the system varies with different levels of precision.The concept of a graceful labeling has been introduced by Rosa in 1966.This note is a further contribution on fuzzy labeling. Fuzzy labeling for fuzzy wheel graph and fuzzy fan graph are called a fuzzy labeling wheel graph and fuzzy labeling fan graph respectively.
    [Show full text]
  • Graceful Labeling Algorithms and Complexity - a Survey
    J. Indones. Math. Soc. Special Edition (2011), pp. 1–9. GRACEFUL LABELING ALGORITHMS AND COMPLEXITY - A SURVEY S. Arumugam1,2, Jay Bagga3 1National Centre for Advanced Research in Discrete Mathematics (n-CARDMATH), Kalasalingam University, Anand Nagar, Krishnankoil-626190, India, [email protected] 2School of Electrical Engineering and Computer Science, The University of Newcastle, NSW 2308, Australia. 3Department of Computer Science, Ball State University, Muncie, IN 47306, USA, [email protected] Abstract. Graceful graphs were first studied by Rosa in 1966. The Kotzig-Ringel graceful tree conjecture states that every tree has a graceful labeling. Aldred and McKay and others [6, 15, 20] have used computer programs to show that trees of order up to 35 are graceful. Bagga et al. investigated algorithms for generating all graceful labelings of certain known classes of graceful graphs, including paths, cycles, and certain other classes of unicyclic graphs. The data generated by such algorithms has led to the discovery of new properties of such graceful labelings. In this paper we present a survey of graceful graph labeling algorithms and related complexity issues. Key words: Graph labelings, graceful labeling, algorithms, complexity. Abstrak. Graf-graf graceful pertama kali dipelajari oleh Rosa pada tahun 1966. Konjektur pohon graceful Kotzig-Ringel menyatakan bahwa setiap pohon memi- liki suatu pelabelan graceful. Aldred dan McKay (1998), Fang (2011), dan Horton (2003) telah menggunakan program komputer untuk menunjukkan bahwa pohon dengan orde hingga 35 adalah graceful. Bagga dkk. (2007) telah menyelidiki algo- ritma untuk menghasilkan semua pelabelan graceful dari graf-graf graceful untuk kelas-kelas graf tertentu seperti lintasan, lingkaran, dan kelas tertentu lainnya dari graf unicyclic.
    [Show full text]
  • International Journal of Mathematical Combinatorics, Vol. 1, 2011
    ISSN 1937 - 1055 VOLUME 1, 2011 INTERNATIONAL JOURNAL OF MATHEMATICAL COMBINATORICS EDITED BY THE MADIS OF CHINESE ACADEMY OF SCIENCES March, 2011 Vol.1, 2011 ISSN 1937-1055 International Journal of Mathematical Combinatorics Edited By The Madis of Chinese Academy of Sciences March, 2011 Aims and Scope: The International J.Mathematical Combinatorics (ISSN 1937-1055) is a fully refereed international journal, sponsored by the MADIS of Chinese Academy of Sci- ences and published in USA quarterly comprising 100-150 pages approx. per volume, which publishes original research papers and survey articles in all aspects of Smarandache multi-spaces, Smarandache geometries, mathematical combinatorics, non-euclidean geometry and topology and their applications to other sciences. Topics in detail to be covered are: Smarandache multi-spaces with applications to other sciences, such as those of algebraic multi-systems, multi-metric spaces, , etc.. Smarandache geometries; · · · Differential Geometry; Geometry on manifolds; Topological graphs; Algebraic graphs; Random graphs; Combinatorial maps; Graph and map enumeration; Combinatorial designs; Combinatorial enumeration; Low Dimensional Topology; Differential Topology; Topology of Manifolds; Geometrical aspects of Mathematical Physics and Relations with Manifold Topology; Applications of Smarandache multi-spaces to theoretical physics; Applications of Combi- natorics to mathematics and theoretical physics; Mathematical theory on gravitational fields; Mathematical theory on parallel universes; Other applications of Smarandache multi-space and combinatorics. Generally, papers on mathematics with its applications not including in above topics are also welcome. It is also available from the below international databases: Serials Group/Editorial Department of EBSCO Publishing 10 Estes St. Ipswich, MA 01938-2106, USA Tel.: (978) 356-6500, Ext. 2262 Fax: (978) 356-9371 http://www.ebsco.com/home/printsubs/priceproj.asp and Gale Directory of Publications and Broadcast Media, Gale, a part of Cengage Learning 27500 Drake Rd.
    [Show full text]