Open Problems in Exclusive Sum Labeling Mirka Miller, Joe Ryan, Slamin, Kiki Sugeng, Mauritsius Tuga School of Computer Science and Software Engineering.

Slides:



Advertisements
Similar presentations
Connectivity - Menger’s Theorem Graphs & Algorithms Lecture 3.
Advertisements

Chun-Cheng Chen Department of Mathematics National Central University 1.
Orthogonal Drawing Kees Visser. Overview  Introduction  Orthogonal representation  Flow network  Bend optimal drawing.
Lecture 5 Graph Theory. Graphs Graphs are the most useful model with computer science such as logical design, formal languages, communication network,
Definitions Distance Diameter Radio Labeling Span Radio Number Gear Graph.
22C:19 Discrete Math Graphs Fall 2014 Sukumar Ghosh.
13 May 2009Instructor: Tasneem Darwish1 University of Palestine Faculty of Applied Engineering and Urban Planning Software Engineering Department Introduction.
CompSci 102 Discrete Math for Computer Science April 19, 2012 Prof. Rodger Lecture adapted from Bruce Maggs/Lecture developed at Carnegie Mellon, primarily.
GOLOMB RULERS AND GRACEFUL GRAPHS
Graph Labeling Problems Appropriate for Undergraduate Research Cindy Wyels CSU Channel Islands Research with Undergraduates Session MathFest, 2009.
Graph Drawing and Information Visualization Laboratory Department of Computer Science and Engineering Bangladesh University of Engineering and Technology.
1 Section 8.2 Graph Terminology. 2 Terms related to undirected graphs Adjacent: 2 vertices u & v in an undirected graph G are adjacent (neighbors) in.
Vertex Cut Vertex Cut: A separating set or vertex cut of a graph G is a set SV(G) such that S has more than one component. Connectivity of G ((G)): The.
Discrete Structures Chapter 7A Graphs Nurul Amelina Nasharuddin Multimedia Department.
Graphs: Graceful, Equitable and Distance Labelings
Applied Discrete Mathematics Week 12: Trees
The Shortest Path Problem
9.2 Graph Terminology and Special Types Graphs
On Edge-Balance Index Sets of L-Product of Cycles by Cycles Daniel Bouchard, Stonehill College Patrick Clark, Stonehill College Hsin-hao Su, Stonehill.
Module #19: Graph Theory: part I Rosen 5 th ed., chs. 8-9 내년 3 월 ? 교환 학생 프로그램 영어 점수 미리미리 준비하세요.
Trees and Distance. 2.1 Basic properties Acyclic : a graph with no cycle Forest : acyclic graph Tree : connected acyclic graph Leaf : a vertex of degree.
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Sixth Edition, Mc Graw-Hill, 2007 Chapter 9 (Part 2): Graphs  Graph Terminology (9.2)
Copyright © Zeph Grunschlag, More on Graphs.
1 CS104 : Discrete Structures Chapter V Graph Theory.
The Sum Number of a Disjoint Union of Graphs Mirka Miller & Joe Ryan The University of Newcastle, Australia W. F. Smyth McMaster University, Hamilton,
(CSC 102) Lecture 28 Discrete Structures. Graphs.
Mathematics of Networks (Cont)
Indian Institute of Technology Kharagpur PALLAB DASGUPTA Graph Theory: Introduction Pallab Dasgupta, Professor, Dept. of Computer Sc. and Engineering,
Maximum density of copies of a graph in the n-cube John Goldwasser Ryan Hansen West Virginia University.
A Study of IC-coloring of Graphs 研 究 生:林耀仁 指導教授:江南波.
Chapter 1 Fundamental Concepts Introduction to Graph Theory Douglas B. West July 11, 2002.
1 12/2/2015 MATH 224 – Discrete Mathematics Formally a graph is just a collection of unordered or ordered pairs, where for example, if {a,b} G if a, b.
Graph.
Reflexivity in some classes of multicyclic treelike graphs Bojana Mihailović, Zoran Radosavljević, Marija Rašajski Faculty of Electrical Engineering, University.
1 Decomposition into bipartite graphs with minimum degree 1. Raphael Yuster.
An Introduction to Graph Theory
Graph Theory and Applications
Graphs 9.1 Graphs and Graph Models أ. زينب آل كاظم 1.
Some results on sum graph sum graph Wei Jianxin School of Mathematics and Information of Lu Dong University Lu Dong
 Quotient graph  Definition 13: Suppose G(V,E) is a graph and R is a equivalence relation on the set V. We construct the quotient graph G R in the follow.
Discrete Structures CISC 2315 FALL 2010 Graphs & Trees.
Introduction to Graph Theory
Graph Theory Unit: 4.
Basic Operations on Graphs Lecture 5.. Basic Operations on Graphs Deletion of edges Deletion of vertices Addition of edges Union Complement Join.
Chapter 11 - Graph CSNB 143 Discrete Mathematical Structures.
1 Complexities of some interesting problems on spanning trees M Sohel Rahman King’s College, London M Kaykobad KHU, NSU and BUET.
Chapter 9: Graphs.
Approximation Algorithms by bounding the OPT Instructor Neelima Gupta
1 GRAPH Learning Outcomes Students should be able to: Explain basic terminology of a graph Identify Euler and Hamiltonian cycle Represent graphs using.
MAT 2720 Discrete Mathematics Section 8.1 Introduction
Trees.
Multicolored Subgraphs in Properly Edge-colored Graphs
Introduction to the Design and Analysis of Algorithms
Applied Discrete Mathematics Week 13: Graphs
Graph theory Definitions Trees, cycles, directed graphs.
12. Graphs and Trees 2 Summary
Taibah University College of Computer Science & Engineering Course Title: Discrete Mathematics Code: CS 103 Chapter 10 Graphs Slides are adopted from “Discrete.
CS100: Discrete structures
Discrete Math II Howon Kim
Hamiltonian Cycles.
Rainbow Graph Designs Hung-Lin Fu (傅 恒 霖)
N(S) ={vV|uS,{u,v}E(G)}
Discrete Mathematics for Computer Science
Dr. P. Lawrence Rozario Raj
Graph Theory: Cuts and Connectivity
Graph Theory: Proof Techniques
TOTALLY MAGIC CORDIAL LABELING OF SOME SPECIAL GRAPHS
Dr. P. Lawrence Rozario Raj
Presentation transcript:

Open Problems in Exclusive Sum Labeling Mirka Miller, Joe Ryan, Slamin, Kiki Sugeng, Mauritsius Tuga School of Computer Science and Software Engineering The University of Newcastle- Australia

A Graph G(V,E) is a sum graph if there exist a labeling L of the vertices of G into distinct positive integers such that any two distinct vertices u and v of G are adjacent if and only if there is a vertex w whose label L(w) = L(u) + L(v). Every sum graph must contain isolated vertices. If a graph G is not a sum graph, it is always possible to add some finite number of isolated vertices to G to obtain a sum graph. The sum number  (G) of G is the smallest number of isolated vertices that will achieve this result. Sum Graph

Sum Graph (Cont’d) The notion of a sum graph was introduced by Harary in 1990 Gould and Rödl proved that there exist graphs G(V,E) such that  (G)   (|V| 2 ). Nagamochi et al proved that this fact should be quite common. More than a decade researchers have failed to produce an example of any such graph.

Exclusive Sum Labeling In a sum labeling of a graph G, a vertex w is said to label an edge uv  E(G) if and only if w=u+v. In this case the vertex w is called a working vertex. A sum labeling L is called an exclusive sum labeling with respect to a sub graph H of a graph G if none of the vertices of H are working vertices. We say that H is labeled exclusively The least number r of isolated vertices such that G=H  is a sum graph and H is labeled exclusively is called the exclusive sum number  (H) of graph H.

Exclusive Sum Labeling (Cont’d) The notion of an exclusive sum labeling was introduced by Miller et al. Figure 1 and Figure 2 are examples of exclusive sum labeling. Fig.1 Exclusive sum labeling for W 7

Exclusive Sum Labeling (Cont’d) Fig.2 Exclusive sum labeling for f 7

Facts on Exclusive Sum Labeling Observation 1:  (G)   (G). Observation 2: If L is a sum labeling of a graph G then so is L’ = kL, where k is any positive integer. Observation 3: If L is a sum labeling of a graph H in G=H  then so is the labeling L’ = {k 1 L + k 2 for non working vertices of G, and k 1 L+2k 2 for working vertices of G} where k 1 is any positive integer and k 2 is any integer which results only in positive distinct values in L’. Observation 4: Let  be the maximum degree of a vertex in a graph G. Then  (G)   (G).

Exclusive Sum Number for Several Classes of Graphs Graph G  (G)  (G) Stars S n, n  2, 1n Trees, T n, n  3, T n  S n 1? Paths P n 12 Cycles C 4 C n, n  4, Wheels W 4 W n, n  5, n odd n  6, n even 4 n n/ n Fans F n ?n Friendship graphs f n 22n

Exclusive Sum Number for Several Classes of Graphs (Cont’d) Graph G  (G)  (G) Complete graphs K n, n  3 2n-3 Cocktail Party graphs, H 2,n H m,n 4n-5 ? 4n-5 ? Bipartite Graphs, K n,n K m,n  k(n-1)/2 +m/(k-1)  Where k = ????

Open Problems Open Problem 1. Find the exclusive sum number for various families of graphs. Open Problem 2. Find the exclusive sum number for disjoint union of graphs. Open Problem 3. Find graphs with exclusive sum number in the order of |V| 2. This is likely to be a very difficult problem. An easier problem might be Open Problem 4. Find graphs with exclusive sum number in the order of |V| t, where t > 1. The caterpillar type of a tree has been shown to have exclusive sum number equal to its maximum degree. These results suggest Conjecture. Every tree has exclusive sum number equal to its maximum degree.

Bibliography D. Bergstrand, F. Harary, K. Hodges, G. Jennings, L.Kuklinski and J. Wiener, The sum number of a complete graph, Bull.Malaysian Math. Soc. 12 (1989) M. Ellingham, Sum graphs from trees, Ars. Combinatoria 35 (1993) R. Gould and V. Rödl, Bounds on the number of isolated vertices in sum graphs, Graph Theory, Combinatorics and Applications,(edited by Y. Alevi, G. Chartrand, O.R. Oellermann and A.J. Schwenk, John Wiley and Sons (1991), F. Harary, Sum graphs and difference graphs, Congressus Numerantium 72} (1990) N. Harstfield and W.F. Smyth, The sum number of complete bipartite graphs, Graphs and Matrices,(edited by Rolf Rees), Marcel Dekker (1992) N. Hartsfiels and W.F. Smyth, A family of sparse graphs of large sum number, Discrete Math. 141 (1995) W. He, Y. Shen, L. Wang, Y. Chang, Q. Kang and X. Yu, The integral sum number of complete bipartite graphs K r,s, Discrete Math, 239 (2001),

Bibliography (Cont’d) M. Miller, J. Ryan, Slamin and W.F. Smyth, Labelling Wheels for minimum sum number, JCMCC, Vol. 28 (1998), M. Miller, J. Ryan and W.F. Smyth, The sum labeling for the cocktail party graph, Bulletin of ICA, Vol 22 (1998), M. Miller, J. Ryan, Slamin, K. Sugeng and M. Tuga,Exclusive sum graph labeling, preprint, H. Nagamochi, M.Miller and Slamin, Bounds on the number of isolates in sum graph labeling, Discrete Math. (2001), no 1-3, A.V. Pyatkin, New formula for the sum number for the complete bipartite graphs, Discrete Math, 239 (2001), A. Sharary, Integral sum graphs from complete graphs, cycles and wheels, Arab Gulf J. Sci. Res. (1996) M. Tuga and M. Miller, Optimal exclusive sum labeling for some trees, in preparation. Y. Wang and B. Liu, The sum number and integral sum number of complete bipartite graph, Discrete Math, 239 (2001),