Graph Theory and Metric


 Shon Rodgers
 1 years ago
 Views:
Transcription
1 Chapter 2 Graph Theory and Metric Dimension 2.1 Science and Engineering Multi discipline teams and multi discipline areas are words that now a days seem to be important in the scientific research. Indeed this is even more important if we focus on ancittae scientiae, i.e. sciences, which are used as tools in other sciences such as Mathematics is with respect to Engineering. Mathematicians are usually looking for new varieties of problems and Engineers are usually looking for new arrival solutions. The dialogue of both areas is interesting for both communities and conducive to to betterment of science and society. Nevertheless dialogue is not always easy and requires sufficient efforts from both Mathematicians and Engineers. The translation of a problem arising from Engineering to mathematical language requires a deep knowledge of the discipline in which a problem is contextualized. Setting up of assumptions and hypothesis of the model is always a compromise between realism and tractability. Finally the result given by the mathematical models must be validated by using engineering tools for conducting experimental or simulation investigations. This thesis deals with two such problems of engineering which are useful in 17
2 communication networks. We model the problem using the theory of graphs, solve it using graph theory concepts and using this concept the design and develop a routing algorithm for a clustered network is presented. 2.2 Graph Theory Concepts A graph G = (V, E) is an ordered pair consisting of a nonempty set V = V (G) of elements called vertices and a set E = E(G) of unordered pairs of vertices called edges. Two vertices u, v V (G) are said to be adjacent if there is an edge uv E(G) joining them. The edge uv E(G) is also said to be incident to vertices u and v. The degree of a vertex v, denoted by deg(v) is the number of vertices in V (G) adjacent to it. The minimum and maximum degrees of the graph δ and respectively, are defined as the minimum and maximum over the degrees of all the vertices of the graph. A uvpath is a sequence of distinct vertices u = v 0, v 1, v 2,..., v n = v so that v i 1 is adjacent to v i for all i, 1 i n, such a path is said to be of length n. A uupath of length n is a cycle, denoted by C n. Among all the uvpaths, the one having minimum length is called the shortest uvpath. The Shortest uvpath is also called a Geodesic. A triangle formed in a graph G is often called a cycle of length 3. A graph is said to be connected if there is a path between every pair of vertices. If the graph is connected, the distance between every two vertices a and b, denoted by d(a, b), is the length of the shortest path joining a and b, and the diameter of the graph, denoted by diam G, is the maximum among the distances between all pairs of vertices of the graph. The eccentricity of a vertex v of a graph G, denoted by e(g), is the maximum length of shortest path from vertex v to a vertex of G. The minimum eccentricity among all the vertices of G is called radius of G and is denoted by r(g). The vertices u and v, which are at a distance equal to the diameter of the graph G 18
3 are called antipodal vertices. A vertex is joined to itself, forms a loop in G. Two or more edges join with the same vertices x and y called multiple edges. A graph having no loops or multiple edges is called a simple graph. The number of vertices in a graph G is called the order of G and the number of edges in a graph G is called its size. A vertex of degree one is called a pendant vertex and the edge incident with the pendant vertex is called the pendant edge. A vertex of degree zero is called an isolated vertex. A graph in which all the vertices are of equal degree is called a regular graph. A graph G is called rregular graph if the degree of its every vertex is r. A graph having no cycles is called an acyclic graph or a forest. A tree is a connected acyclic graph. A tree of order n is denoted by T n. A graph H is called a subgraph of G if every vertex of H is a vertex in G and every edge of H is an edge of G. If H is a subgraph of G and contains all the edges of G that join two vertices in V (H) then H is said to be the induced subgraph, denoted by H. A maximal connected subgraph of G is called its component. A complete graph is a simple graph with an edge between every pair of vertices. A complete graph on n vertices is denoted by K n. A graph is bipartite if its vertex set can be partitioned into two nonempty subsets V 1 and V 2 so that each edge of G has one end vertex in V 1 and other in V 2. A complete bipartite graph is a bipartite graph in which each vertex of V 1 of order m is adjacent to all the vertices of V 2 of order n and is denoted by K m,n. A graph K 1,n is called a star. Two graphs G 1 and G 2 are said to be isomorphic if there exists a bijection f between their vertex sets such that two vertices are adjacent in G 1 if and only if their images under f are adjacent in G 2. If G is any graph and v is a vertex of G, then G v is a graph obtained from G by deleting the vertex v and all the edges incident with v in G. Similarly, if e is an edge of G, then G e is the graph obtained from G by just deleting the edge e in G. 19
4 A subset S of the vertex set V of a graph G, is called an independent set if no two vertices of S are adjacent in G. Since a graph is a binary relationship within elements on a generic set, it is not surprising that graphs appear, at least implicitly, in many different contexts of the scientific knowledge such as Sociology, Economy, or Engineering. 2.3 Metric Dimension Graph structure can be used to study the various concepts of Navigation in space. A work place can be denoted as node in the graph, and edges denote the connections between the places. The problem of minimum machines (or Robots) to be placed at certain nodes to trace each and every node exactly once is a classical one. This problem can be solved by using networks where places are interconnected in which, the navigating agent moves from one node to another in the network. The places or nodes of a network where we place the machines (robots) are called landmarks. The minimum number of machines required to locate each and every node of the network is termed the metric dimension and the set of all minimum possible number of landmarks constitute metric basis. The machines, where they are placed at nodes of the network, know their distances to sufficiently large set of landmarks and the positions of these machines on the network are uniquely determined. However there is neither the concept of direction nor that of visibility. Instead we shall assume that a Robot navigating on a graph can sense the distance to a set of landmarks. The problem of finding metric dimension requires a study of metric Geometry. In metric Geometry [51] and [52], the following concepts are standard. Let S = {v 1, v 2,..., v n } be an ordered set of nodes in metric space M. The S coordinates of a node u is given by the vector consisting of distances {d(u, v 1 ), d(u, v 2 ),..., d(u, v n )}. The set S is called metric basis for M if, 1. No two nodes of M have the same S coordinates, and 20
5 2. There is no smaller set satisfying the property 1. The metric dimension of the space M is the cardinality of any metric basis. These entire concepts can be applied at once to simple connected, undirected finite graphs. We give a formal definition of the notion of metric dimension introduced by F. Harary and R.A Melter in 1976 [15]. The metric dimension of a graph G = (V, E) is the cardinality of a minimal subset S of V such that for each pair of vertices u, v of V there is a vertex w in S such that the length of the shortest path from w to u is different from the length of the shortest path from w to v. The coordinate associated with each node is based on the distance from the node to the landmarks, so as to pick just enough landmarks in such a way that each node has a unique tuple of coordinates. A coordinate system on G is defined as follows. Select a set M of nodes as the landmarks. For each landmark, the coordinate of a node v V in G having the elements equal to the cardinality of the set M and i th element of coordinate of v is equal to the length of shortest path from the i th landmark to the vertex v in G. For example: Consider the Figure 2.1 Figure 2.1: The graph G Taking landmarks a and b the assigned coordinates are shown in the Figure
6 Figure 2.2: The graph G(with a and b as landmarks) Taking the vertices a and c, the associated coordinate is shown in Figure 2.3 Figure 2.3: The graph G(with a and c as Landmarks) Remark 2.1. For the above graph we obtained two different sets namely {a, b} and {a, c} both of these consist of two elements. Further we observed that, there exists no singleton set of vertices satisfying the property that the associated coordinates of the vertices of the graph are all distinct with respect to the set. Thus the above sets are minimal with this property and such a minimum set of landmarks constitutes a metric basis. The cardinality of this metric basis is called metric dimension of the graph. On the other hand: 2.4 Definition The metric dimension of a graph G, denoted by β(g), is defined as the cardinality of a minimal subset S of V having the property that for each pair of vertices 22
7 u, v there exists a vertex w in S such that d(u, w) d(v, w). The coordinate of each vertex v of V (G) with respect to each landmark u i belong to S is defined as usual with i th component of v as d(v, u i ) for each i and is of dimension β(g). Remark 2.2. As the concept of metric dimension is defined on the basis of the distances between the vertices we here onwards consider only finite simple connected graphs without loops. Remark 2.3. We obtained two distinct element subsets a, b and a, c of V (G) for the graph of Figure 2.1, both of which constitute a metric basis for G. However the second set is an internally stable set. Such sets often are more important to compute the actual metric dimension of our future graphs as it minimizes the number of landmarks by maximizing the possible assignments. Example: The metric dimension of the Petersen graph G(5, 2) [53] is 3 and the metric basis consists of the vertices u1, u2, u3 : Preliminaries: The Figure 2.4: Petersen Graph following are the results according to F.Harary and Melter in [15]. Theorem 2.4. The metric dimension of a complete graph of order n is n 1, for n > 1. Proof. : Since each vertex is adjacent to the other, the set of n 2 vertices cannot constitute a metric basis as it yields the same coordinate (1, 1, 1,... 1) }{{} n 1times 23
8 for exactly two non landmarks, and hence exactly one of these two vertices should be in the metric basis along with the above n 2 landmarks. We now consider a path P n on n vertices. By choosing one of the end vertices as a landmark we observe that all the vertices are at distinct distances from this vertex. Hence one of the end vertices constitutes a metric basis. Further if G is not a tree then it contains a circuit and hence at least two landmarks are necessary to constitute a metric basis. Thus we have: Theorem 2.5. [30] The metric dimension of a graph G is 1 if and only if G is a path. Remark 2.6. In view of the above Theorem 2.4 and minimality of a cardinality of set of landmarks for a metric dimension of a graph, it suffices to show β(g) 2 whenever β(g) = 2. Remark 2.7. Theorem 2.3 and Theorem 2.4 together imply that for a connected graph G of order n,1 β(g) n 1, for n > 1. We now see the complexity in computation of the metric dimension of a graph G. Consider the graphs shown in the Figure 2.5 (a) and 2.5 (b). Figure 2.5: The Graph G 1 (a), The Graph G 2 (b) by adding an edge ae The metric dimension of G 1 is 2. The graph G 2 is obtained from G 1 by adding an edge ae and β(g 2 ) = 2. Thus, the addition of an edge retains the 24
9 metric dimension in this case. However it is not true in general. For example consider the graph K 4 e. The metric dimension of K 4 e is 2 and that of K 4 is3. Further by adding an edge, even though the metric dimension is increased or stable in the above cases, this cannot be true for all the graphs. As a counter example we observe that for the following graph G 3 in Figure 2.6: β(g) = 3, Figure 2.6: The Graph G 3 with the metric basis M = {a, b, f}. β(g + ab) = 2, with the metric basis M = {f, b}. A similar set of graphs can be obtained for the addition of vertices also. Thus, while defining the graphs throughout the thesis we concentrate on either the increasing or the decreasing side (but not both) of metric dimensions. 2.5 Metric Dimension of Wheels In 1976 F. Harary and R.A. Melter [15] mentioned that the metric dimension of the wheel W 1,n on n + 1 vertices is 2, i.e.β(w 1,n ) = 2. However this result will not hold good for large values of n. In fact by Theorem 2.3 we have metric dimension of the complete graph K n for n > 1 is n 1, and the wheel W 1,3 is isomorphic to K 4 thus β(w 1,3 ) = β(k 4 ) = 3 2(Disproved by Shanmukha 25
10 et.al,[24]). By this simple observation, Shanmukha et.al [24] conclude that the result obtained by F. Harary and R.A. Melter[15] is valid only when n = 4 or Graphs with Metric Dimension Two Graphs with β(g) = 2 have a richer structure. We list a few important properties of such graphs. Theorem 2.8. [15] If C n is a cycle of order n, then β(c n ) = 2. Theorem 2.9. [30] (Kuller et.al) has shown that the graphs with β(g)=2 contain neither K 5 nor K 3,3 as a subgraph. This might lead one to conjecture that such graphs have to be planar; but (Kuller et.al) has exhibited in a nonplanar graph with metric dimension 2. A graph G with β(g) = 2 cannot have either K 5 or K 3,3. Remark The proof can be extended to show that a graph G with β(g) = k cannot have K 2 +1, as a subgraph. k Example: if k = 2, then β(g) = 2 cannot have K 5 as a subgraph (follows from the above Theorem 2.9) The following theorem captures a few other properties of graphs with metric dimension 2. Theorem [30] Let G = (V, E) be a graph with metric dimension 2 and let {a, b} V be a metric basis in G. The following are true. 1. There is a unique shortest path P between a and b. 2. The degrees of a and b are at most Every other node on p has degree at most 5. Theorem [61] For any graph G with β(g) = 2, all the vertices of triangle of G cannot have either the same first or the same second coordinate. 26
11 Theorem [54] For any graph with β(g) = 2, the metric basis S of G cannot have a vertex V of a sub graph K 4 of G. Theorem [30] Let G = (V, E) be a graph with metric dimension two. Let D be the diameter of G. Then V D Theorem [15] Let G = G(P m P n ) be a Cartesian product of two paths P m and P n. Then β(p m P n ) = 2. Theorem [30] The bound on V can be slightly refined based on some of the observations made earlier in Theorem Thus V (D 1) Theorem [15] If W 1,n is a wheel for n 3, then β(w 1,4 ) = β(w 1,5 ) = 2. β(w 1,n ) = 2 was the earlier result which was disproved by Shanmukha et.al and stated that the above result is valid only for n = 4 or 5. Theorem [28] Let G = G(P m C n ) be a Cartesian product of a path P m and a cycle C n.thenβ(p m C n ) = 2, if n is odd. Theorem [28] Let G = G(K m C n ) be a Cartesian product of a complete graph K n and a cycle C m. Then 2, if n = 1 β(k m C n ) = 2, if n = 2 and m isodd Theorem [28] If β(g H) = 2, then G or H is a path. Theorem [28] For every graph G and for all n 3, we have β(g C n ) = 2 if and only if G is a path and n is odd. Theorem [28] For every integer n 4 there is a tree B n with β(b n ) = 2. 27
Special Classes of Divisor Cordial Graphs
International Mathematical Forum, Vol. 7,, no. 35, 737749 Special Classes of Divisor Cordial Graphs R. Varatharajan Department of Mathematics, Sri S.R.N.M. College Sattur  66 3, Tamil Nadu, India varatharajansrnm@gmail.com
More informationGraph Theory Problems and Solutions
raph Theory Problems and Solutions Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles November, 005 Problems. Prove that the sum of the degrees of the vertices of any finite graph is
More informationCourse on Social Network Analysis Graphs and Networks
Course on Social Network Analysis Graphs and Networks Vladimir Batagelj University of Ljubljana Slovenia V. Batagelj: Social Network Analysis / Graphs and Networks 1 Outline 1 Graph...............................
More informationSocial Media Mining. Graph Essentials
Graph Essentials Graph Basics Measures Graph and Essentials Metrics 2 2 Nodes and Edges A network is a graph nodes, actors, or vertices (plural of vertex) Connections, edges or ties Edge Node Measures
More informationCOMBINATORIAL PROPERTIES OF THE HIGMANSIMS GRAPH. 1. Introduction
COMBINATORIAL PROPERTIES OF THE HIGMANSIMS GRAPH ZACHARY ABEL 1. Introduction In this survey we discuss properties of the HigmanSims graph, which has 100 vertices, 1100 edges, and is 22 regular. In fact
More informationDiscrete Mathematics & Mathematical Reasoning Chapter 10: Graphs
Discrete Mathematics & Mathematical Reasoning Chapter 10: Graphs Kousha Etessami U. of Edinburgh, UK Kousha Etessami (U. of Edinburgh, UK) Discrete Mathematics (Chapter 6) 1 / 13 Overview Graphs and Graph
More informationBOUNDARY EDGE DOMINATION IN GRAPHS
BULLETIN OF THE INTERNATIONAL MATHEMATICAL VIRTUAL INSTITUTE ISSN (p) 04874, ISSN (o) 04955 www.imvibl.org /JOURNALS / BULLETIN Vol. 5(015), 19704 Former BULLETIN OF THE SOCIETY OF MATHEMATICIANS BANJA
More informationOn Integer Additive SetIndexers of Graphs
On Integer Additive SetIndexers of Graphs arxiv:1312.7672v4 [math.co] 2 Mar 2014 N K Sudev and K A Germina Abstract A setindexer of a graph G is an injective setvalued function f : V (G) 2 X such that
More informationGRAPH THEORY LECTURE 4: TREES
GRAPH THEORY LECTURE 4: TREES Abstract. 3.1 presents some standard characterizations and properties of trees. 3.2 presents several different types of trees. 3.7 develops a counting method based on a bijection
More informationprinceton univ. F 13 cos 521: Advanced Algorithm Design Lecture 6: Provable Approximation via Linear Programming Lecturer: Sanjeev Arora
princeton univ. F 13 cos 521: Advanced Algorithm Design Lecture 6: Provable Approximation via Linear Programming Lecturer: Sanjeev Arora Scribe: One of the running themes in this course is the notion of
More informationV. Adamchik 1. Graph Theory. Victor Adamchik. Fall of 2005
V. Adamchik 1 Graph Theory Victor Adamchik Fall of 2005 Plan 1. Basic Vocabulary 2. Regular graph 3. Connectivity 4. Representing Graphs Introduction A.Aho and J.Ulman acknowledge that Fundamentally, computer
More informationMean RamseyTurán numbers
Mean RamseyTurán numbers Raphael Yuster Department of Mathematics University of Haifa at Oranim Tivon 36006, Israel Abstract A ρmean coloring of a graph is a coloring of the edges such that the average
More informationConnectivity and cuts
Math 104, Graph Theory February 19, 2013 Measure of connectivity How connected are each of these graphs? > increasing connectivity > I G 1 is a tree, so it is a connected graph w/minimum # of edges. Every
More informationLecture 17 : Equivalence and Order Relations DRAFT
CS/Math 240: Introduction to Discrete Mathematics 3/31/2011 Lecture 17 : Equivalence and Order Relations Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT Last lecture we introduced the notion
More informationEvery tree contains a large induced subgraph with all degrees odd
Every tree contains a large induced subgraph with all degrees odd A.J. Radcliffe Carnegie Mellon University, Pittsburgh, PA A.D. Scott Department of Pure Mathematics and Mathematical Statistics University
More informationFull and Complete Binary Trees
Full and Complete Binary Trees Binary Tree Theorems 1 Here are two important types of binary trees. Note that the definitions, while similar, are logically independent. Definition: a binary tree T is full
More informationDegree Hypergroupoids Associated with Hypergraphs
Filomat 8:1 (014), 119 19 DOI 10.98/FIL1401119F Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat Degree Hypergroupoids Associated
More informationGraph Theory and Complex Networks: An Introduction. Chapter 06: Network analysis. Contents. Introduction. Maarten van Steen. Version: April 28, 2014
Graph Theory and Complex Networks: An Introduction Maarten van Steen VU Amsterdam, Dept. Computer Science Room R.0, steen@cs.vu.nl Chapter 0: Version: April 8, 0 / Contents Chapter Description 0: Introduction
More informationZachary Monaco Georgia College Olympic Coloring: Go For The Gold
Zachary Monaco Georgia College Olympic Coloring: Go For The Gold Coloring the vertices or edges of a graph leads to a variety of interesting applications in graph theory These applications include various
More informationOutline 2.1 Graph Isomorphism 2.2 Automorphisms and Symmetry 2.3 Subgraphs, part 1
GRAPH THEORY LECTURE STRUCTURE AND REPRESENTATION PART A Abstract. Chapter focuses on the question of when two graphs are to be regarded as the same, on symmetries, and on subgraphs.. discusses the concept
More informationP. Jeyanthi and N. Angel Benseera
Opuscula Math. 34, no. 1 (014), 115 1 http://dx.doi.org/10.7494/opmath.014.34.1.115 Opuscula Mathematica A TOTALLY MAGIC CORDIAL LABELING OF ONEPOINT UNION OF n COPIES OF A GRAPH P. Jeyanthi and N. Angel
More informationIntroduction to Graph Theory
Introduction to Graph Theory Allen Dickson October 2006 1 The Königsberg Bridge Problem The city of Königsberg was located on the Pregel river in Prussia. The river divided the city into four separate
More informationIE 680 Special Topics in Production Systems: Networks, Routing and Logistics*
IE 680 Special Topics in Production Systems: Networks, Routing and Logistics* Rakesh Nagi Department of Industrial Engineering University at Buffalo (SUNY) *Lecture notes from Network Flows by Ahuja, Magnanti
More informationDiscrete Mathematics Problems
Discrete Mathematics Problems William F. Klostermeyer School of Computing University of North Florida Jacksonville, FL 32224 Email: wkloster@unf.edu Contents 0 Preface 3 1 Logic 5 1.1 Basics...............................
More informationGraph Theory and Complex Networks: An Introduction. Chapter 06: Network analysis
Graph Theory and Complex Networks: An Introduction Maarten van Steen VU Amsterdam, Dept. Computer Science Room R4.0, steen@cs.vu.nl Chapter 06: Network analysis Version: April 8, 04 / 3 Contents Chapter
More information3. Eulerian and Hamiltonian Graphs
3. Eulerian and Hamiltonian Graphs There are many games and puzzles which can be analysed by graph theoretic concepts. In fact, the two early discoveries which led to the existence of graphs arose from
More informationAnalysis of Algorithms, I
Analysis of Algorithms, I CSOR W4231.002 Eleni Drinea Computer Science Department Columbia University Thursday, February 26, 2015 Outline 1 Recap 2 Representing graphs 3 Breadthfirst search (BFS) 4 Applications
More informationOn Some Vertex Degree Based Graph Invariants
MATCH Communications in Mathematical and in Computer Chemistry MATCH Commun. Math. Comput. Chem. 65 (20) 723730 ISSN 03406253 On Some Vertex Degree Based Graph Invariants Batmend Horoldagva a and Ivan
More information8. Matchings and Factors
8. Matchings and Factors Consider the formation of an executive council by the parliament committee. Each committee needs to designate one of its members as an official representative to sit on the council,
More information3. Equivalence Relations. Discussion
3. EQUIVALENCE RELATIONS 33 3. Equivalence Relations 3.1. Definition of an Equivalence Relations. Definition 3.1.1. A relation R on a set A is an equivalence relation if and only if R is reflexive, symmetric,
More information136 CHAPTER 4. INDUCTION, GRAPHS AND TREES
136 TER 4. INDUCTION, GRHS ND TREES 4.3 Graphs In this chapter we introduce a fundamental structural idea of discrete mathematics, that of a graph. Many situations in the applications of discrete mathematics
More informationCS 598CSC: Combinatorial Optimization Lecture date: 2/4/2010
CS 598CSC: Combinatorial Optimization Lecture date: /4/010 Instructor: Chandra Chekuri Scribe: David Morrison GomoryHu Trees (The work in this section closely follows [3]) Let G = (V, E) be an undirected
More informationLarge induced subgraphs with all degrees odd
Large induced subgraphs with all degrees odd A.D. Scott Department of Pure Mathematics and Mathematical Statistics, University of Cambridge, England Abstract: We prove that every connected graph of order
More informationHandout #Ch7 San Skulrattanakulchai Gustavus Adolphus College Dec 6, 2010. Chapter 7: Digraphs
MCS236: Graph Theory Handout #Ch7 San Skulrattanakulchai Gustavus Adolphus College Dec 6, 2010 Chapter 7: Digraphs Strong Digraphs Definitions. A digraph is an ordered pair (V, E), where V is the set
More informationOn the independence number of graphs with maximum degree 3
On the independence number of graphs with maximum degree 3 Iyad A. Kanj Fenghui Zhang Abstract Let G be an undirected graph with maximum degree at most 3 such that G does not contain any of the three graphs
More informationGRAPHS AND ZERODIVISORS. In an algebra class, one uses the zerofactor property to solve polynomial equations.
GRAPHS AND ZERODIVISORS M. AXTELL AND J. STICKLES In an algebra class, one uses the zerofactor property to solve polynomial equations. For example, consider the equation x 2 = x. Rewriting it as x (x
More informationNetwork (Tree) Topology Inference Based on Prüfer Sequence
Network (Tree) Topology Inference Based on Prüfer Sequence C. Vanniarajan and Kamala Krithivasan Department of Computer Science and Engineering Indian Institute of Technology Madras Chennai 600036 vanniarajanc@hcl.in,
More informationThe chromatic spectrum of mixed hypergraphs
The chromatic spectrum of mixed hypergraphs Tao Jiang, Dhruv Mubayi, Zsolt Tuza, Vitaly Voloshin, Douglas B. West March 30, 2003 Abstract A mixed hypergraph is a triple H = (X, C, D), where X is the vertex
More informationApproximation Algorithms
Approximation Algorithms or: How I Learned to Stop Worrying and Deal with NPCompleteness Ong Jit Sheng, Jonathan (A0073924B) March, 2012 Overview Key Results (I) General techniques: Greedy algorithms
More information1 Definitions. Supplementary Material for: Digraphs. Concept graphs
Supplementary Material for: van Rooij, I., Evans, P., Müller, M., Gedge, J. & Wareham, T. (2008). Identifying Sources of Intractability in Cognitive Models: An Illustration using Analogical Structure Mapping.
More informationMidterm Practice Problems
6.042/8.062J Mathematics for Computer Science October 2, 200 Tom Leighton, Marten van Dijk, and Brooke Cowan Midterm Practice Problems Problem. [0 points] In problem set you showed that the nand operator
More informationSEMITOTAL AND TOTAL BLOCKCUTVERTEX GRAPH
CHAPTER 3 SEMITOTAL AND TOTAL BLOCKCUTVERTEX GRAPH ABSTRACT This chapter begins with the notion of block distances in graphs. Using block distance we defined the central tendencies of a block, like Bradius
More informationPROBLEM SET 7: PIGEON HOLE PRINCIPLE
PROBLEM SET 7: PIGEON HOLE PRINCIPLE The pigeonhole principle is the following observation: Theorem. Suppose that > kn marbles are distributed over n jars, then one jar will contain at least k + marbles.
More informationTriangle deletion. Ernie Croot. February 3, 2010
Triangle deletion Ernie Croot February 3, 2010 1 Introduction The purpose of this note is to give an intuitive outline of the triangle deletion theorem of Ruzsa and Szemerédi, which says that if G = (V,
More informationGraph theoretic techniques in the analysis of uniquely localizable sensor networks
Graph theoretic techniques in the analysis of uniquely localizable sensor networks Bill Jackson 1 and Tibor Jordán 2 ABSTRACT In the network localization problem the goal is to determine the location of
More informationClass One: Degree Sequences
Class One: Degree Sequences For our purposes a graph is a just a bunch of points, called vertices, together with lines or curves, called edges, joining certain pairs of vertices. Three small examples of
More informationDegreeassociated reconstruction parameters of complete multipartite graphs and their complements
Degreeassociated reconstruction parameters of complete multipartite graphs and their complements Meijie Ma, Huangping Shi, Hannah Spinoza, Douglas B. West January 23, 2014 Abstract Avertexdeleted subgraphofagraphgisacard.
More informationAll trees contain a large induced subgraph having all degrees 1 (mod k)
All trees contain a large induced subgraph having all degrees 1 (mod k) David M. Berman, A.J. Radcliffe, A.D. Scott, Hong Wang, and Larry Wargo *Department of Mathematics University of New Orleans New
More informationProduct irregularity strength of certain graphs
Also available at http://amc.imfm.si ISSN 18553966 (printed edn.), ISSN 18553974 (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 7 (014) 3 9 Product irregularity strength of certain graphs Marcin Anholcer
More informationA Study of Sufficient Conditions for Hamiltonian Cycles
DeLeon 1 A Study of Sufficient Conditions for Hamiltonian Cycles Melissa DeLeon Department of Mathematics and Computer Science Seton Hall University South Orange, New Jersey 07079, U.S.A. ABSTRACT A graph
More informationLabeling outerplanar graphs with maximum degree three
Labeling outerplanar graphs with maximum degree three Xiangwen Li 1 and Sanming Zhou 2 1 Department of Mathematics Huazhong Normal University, Wuhan 430079, China 2 Department of Mathematics and Statistics
More informationFundamentals of Media Theory
Fundamentals of Media Theory ergei Ovchinnikov Mathematics Department an Francisco tate University an Francisco, CA 94132 sergei@sfsu.edu Abstract Media theory is a new branch of discrete applied mathematics
More informationGraphs without proper subgraphs of minimum degree 3 and short cycles
Graphs without proper subgraphs of minimum degree 3 and short cycles Lothar Narins, Alexey Pokrovskiy, Tibor Szabó Department of Mathematics, Freie Universität, Berlin, Germany. August 22, 2014 Abstract
More informationExponential time algorithms for graph coloring
Exponential time algorithms for graph coloring Uriel Feige Lecture notes, March 14, 2011 1 Introduction Let [n] denote the set {1,..., k}. A klabeling of vertices of a graph G(V, E) is a function V [k].
More informationSection Summary. Introduction to Graphs Graph Taxonomy Graph Models
Chapter 10 Chapter Summary Graphs and Graph Models Graph Terminology and Special Types of Graphs Representing Graphs and Graph Isomorphism Connectivity Euler and Hamiltonian Graphs ShortestPath Problems
More informationChapter 3. Cartesian Products and Relations. 3.1 Cartesian Products
Chapter 3 Cartesian Products and Relations The material in this chapter is the first real encounter with abstraction. Relations are very general thing they are a special type of subset. After introducing
More informationGraphical degree sequences and realizations
swap Graphical and realizations Péter L. Erdös Alfréd Rényi Institute of Mathematics Hungarian Academy of Sciences MAPCON 12 MPIPKS  Dresden, May 15, 2012 swap Graphical and realizations Péter L. Erdös
More informationarxiv: v2 [math.co] 30 Nov 2015
PLANAR GRAPH IS ON FIRE PRZEMYSŁAW GORDINOWICZ arxiv:1311.1158v [math.co] 30 Nov 015 Abstract. Let G be any connected graph on n vertices, n. Let k be any positive integer. Suppose that a fire breaks out
More informationA 2factor in which each cycle has long length in clawfree graphs
A factor in which each cycle has long length in clawfree graphs Roman Čada Shuya Chiba Kiyoshi Yoshimoto 3 Department of Mathematics University of West Bohemia and Institute of Theoretical Computer Science
More informationINDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS
INDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS STEVEN P. LALLEY AND ANDREW NOBEL Abstract. It is shown that there are no consistent decision rules for the hypothesis testing problem
More informationThe Open University s repository of research publications and other research outputs
Open Research Online The Open University s repository of research publications and other research outputs The degreediameter problem for circulant graphs of degree 8 and 9 Journal Article How to cite:
More information5 Directed acyclic graphs
5 Directed acyclic graphs (5.1) Introduction In many statistical studies we have prior knowledge about a temporal or causal ordering of the variables. In this chapter we will use directed graphs to incorporate
More informationLecture 16 : Relations and Functions DRAFT
CS/Math 240: Introduction to Discrete Mathematics 3/29/2011 Lecture 16 : Relations and Functions Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT In Lecture 3, we described a correspondence
More informationCycles in a Graph Whose Lengths Differ by One or Two
Cycles in a Graph Whose Lengths Differ by One or Two J. A. Bondy 1 and A. Vince 2 1 LABORATOIRE DE MATHÉMATIQUES DISCRÉTES UNIVERSITÉ CLAUDEBERNARD LYON 1 69622 VILLEURBANNE, FRANCE 2 DEPARTMENT OF MATHEMATICS
More informationA MEASURE OF GLOBAL EFFICIENCY IN NETWORKS. Aysun Aytac 1, Betul Atay 2. Faculty of Science Ege University 35100, Bornova, Izmir, TURKEY
International Journal of Pure and Applied Mathematics Volume 03 No. 05, 670 ISSN: 38080 (printed version); ISSN: 343395 (online version) url: http://www.ijpam.eu doi: http://dx.doi.org/0.73/ijpam.v03i.5
More informationA Turán Type Problem Concerning the Powers of the Degrees of a Graph
A Turán Type Problem Concerning the Powers of the Degrees of a Graph Yair Caro and Raphael Yuster Department of Mathematics University of HaifaORANIM, Tivon 36006, Israel. AMS Subject Classification:
More informationInstitut für Informatik Lehrstuhl Theoretische Informatik I / Komplexitätstheorie. An Iterative Compression Algorithm for Vertex Cover
FriedrichSchillerUniversität Jena Institut für Informatik Lehrstuhl Theoretische Informatik I / Komplexitätstheorie Studienarbeit An Iterative Compression Algorithm for Vertex Cover von Thomas Peiselt
More informationOn three zerosum Ramseytype problems
On three zerosum Ramseytype problems Noga Alon Department of Mathematics Raymond and Beverly Sackler Faculty of Exact Sciences Tel Aviv University, Tel Aviv, Israel and Yair Caro Department of Mathematics
More informationTotal colorings of planar graphs with small maximum degree
Total colorings of planar graphs with small maximum degree Bing Wang 1,, JianLiang Wu, SiFeng Tian 1 Department of Mathematics, Zaozhuang University, Shandong, 77160, China School of Mathematics, Shandong
More informationTools for parsimonious edgecolouring of graphs with maximum degree three. J.L. Fouquet and J.M. Vanherpe. Rapport n o RR201010
Tools for parsimonious edgecolouring of graphs with maximum degree three J.L. Fouquet and J.M. Vanherpe LIFO, Université d Orléans Rapport n o RR201010 Tools for parsimonious edgecolouring of graphs
More informationCompetition Parameters of a Graph
AKCE J. Graphs. Combin., 4, No. 2 (2007), pp. 183190 Competition Parameters of a Graph Suk J. Seo Computer Science Department Middle Tennessee State University Murfreesboro, TN 37132, U.S.A Email: sseo@mtsu.edu
More informationTHE BANACH CONTRACTION PRINCIPLE. Contents
THE BANACH CONTRACTION PRINCIPLE ALEX PONIECKI Abstract. This paper will study contractions of metric spaces. To do this, we will mainly use tools from topology. We will give some examples of contractions,
More informationNetwork/Graph Theory. What is a Network? What is network theory? Graphbased representations. Friendship Network. What makes a problem graphlike?
What is a Network? Network/Graph Theory Network = graph Informally a graph is a set of nodes joined by a set of lines or arrows. 1 1 2 3 2 3 4 5 6 4 5 6 Graphbased representations Representing a problem
More informationR u t c o r Research R e p o r t. Boolean functions with a simple certificate for CNF complexity. Ondřej Čepeka Petr Kučera b Petr Savický c
R u t c o r Research R e p o r t Boolean functions with a simple certificate for CNF complexity Ondřej Čepeka Petr Kučera b Petr Savický c RRR 22010, January 24, 2010 RUTCOR Rutgers Center for Operations
More informationMA651 Topology. Lecture 6. Separation Axioms.
MA651 Topology. Lecture 6. Separation Axioms. This text is based on the following books: Fundamental concepts of topology by Peter O Neil Elements of Mathematics: General Topology by Nicolas Bourbaki Counterexamples
More informationMinimum degree condition forcing complete graph immersion
Minimum degree condition forcing complete graph immersion Matt DeVos Department of Mathematics Simon Fraser University Burnaby, B.C. V5A 1S6 Jacob Fox Department of Mathematics MIT Cambridge, MA 02139
More informationTreerepresentation of set families and applications to combinatorial decompositions
Treerepresentation of set families and applications to combinatorial decompositions BinhMinh BuiXuan a, Michel Habib b Michaël Rao c a Department of Informatics, University of Bergen, Norway. buixuan@ii.uib.no
More informationFinding and counting given length cycles
Finding and counting given length cycles Noga Alon Raphael Yuster Uri Zwick Abstract We present an assortment of methods for finding and counting simple cycles of a given length in directed and undirected
More information1. Determine all real numbers a, b, c, d that satisfy the following system of equations.
altic Way 1999 Reykjavík, November 6, 1999 Problems 1. etermine all real numbers a, b, c, d that satisfy the following system of equations. abc + ab + bc + ca + a + b + c = 1 bcd + bc + cd + db + b + c
More informationOn the kpath cover problem for cacti
On the kpath cover problem for cacti Zemin Jin and Xueliang Li Center for Combinatorics and LPMC Nankai University Tianjin 300071, P.R. China zeminjin@eyou.com, x.li@eyou.com Abstract In this paper we
More information2partitiontransitive tournaments
partitiontransitive tournaments Barry Guiduli András Gyárfás Stéphan Thomassé Peter Weidl Abstract Given a tournament score sequence s 1 s s n, we prove that there exists a tournament T on vertex set
More informationAn algorithmic classification of open surfaces
An algorithmic classification of open surfaces Sylvain Maillot January 8, 2013 Abstract We propose a formulation for the homeomorphism problem for open ndimensional manifolds and use the Kerekjarto classification
More informationCycle transversals in bounded degree graphs
Electronic Notes in Discrete Mathematics 35 (2009) 189 195 www.elsevier.com/locate/endm Cycle transversals in bounded degree graphs M. Groshaus a,2,3 P. Hell b,3 S. Klein c,1,3 L. T. Nogueira d,1,3 F.
More informationChapter 6: Graph Theory
Chapter 6: Graph Theory Graph theory deals with routing and network problems and if it is possible to find a best route, whether that means the least expensive, least amount of time or the least distance.
More informationOn the crossing number of K m,n
On the crossing number of K m,n Nagi H. Nahas nnahas@acm.org Submitted: Mar 15, 001; Accepted: Aug 10, 00; Published: Aug 1, 00 MR Subject Classifications: 05C10, 05C5 Abstract The best lower bound known
More informationCOUNTING INDEPENDENT SETS IN SOME CLASSES OF (ALMOST) REGULAR GRAPHS
COUNTING INDEPENDENT SETS IN SOME CLASSES OF (ALMOST) REGULAR GRAPHS Alexander Burstein Department of Mathematics Howard University Washington, DC 259, USA aburstein@howard.edu Sergey Kitaev Mathematics
More information5.1 Bipartite Matching
CS787: Advanced Algorithms Lecture 5: Applications of Network Flow In the last lecture, we looked at the problem of finding the maximum flow in a graph, and how it can be efficiently solved using the FordFulkerson
More informationTU e. Advanced Algorithms: experimentation project. The problem: load balancing with bounded lookahead. Input: integer m 2: number of machines
The problem: load balancing with bounded lookahead Input: integer m 2: number of machines integer k 0: the lookahead numbers t 1,..., t n : the job sizes Problem: assign jobs to machines machine to which
More informationDiscrete Applied Mathematics. The firefighter problem with more than one firefighter on trees
Discrete Applied Mathematics 161 (2013) 899 908 Contents lists available at SciVerse ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam The firefighter problem with
More information1 Introduction. Dr. T. Srinivas Department of Mathematics Kakatiya University Warangal 506009, AP, INDIA tsrinivasku@gmail.com
A New Allgoriitthm for Miiniimum Costt Liinkiing M. Sreenivas Alluri Institute of Management Sciences Hanamkonda 506001, AP, INDIA allurimaster@gmail.com Dr. T. Srinivas Department of Mathematics Kakatiya
More informationDetermination of the normalization level of database schemas through equivalence classes of attributes
Computer Science Journal of Moldova, vol.17, no.2(50), 2009 Determination of the normalization level of database schemas through equivalence classes of attributes Cotelea Vitalie Abstract In this paper,
More informationFALSE ALARMS IN FAULTTOLERANT DOMINATING SETS IN GRAPHS. Mateusz Nikodem
Opuscula Mathematica Vol. 32 No. 4 2012 http://dx.doi.org/10.7494/opmath.2012.32.4.751 FALSE ALARMS IN FAULTTOLERANT DOMINATING SETS IN GRAPHS Mateusz Nikodem Abstract. We develop the problem of faulttolerant
More informationScheduling Shop Scheduling. Tim Nieberg
Scheduling Shop Scheduling Tim Nieberg Shop models: General Introduction Remark: Consider non preemptive problems with regular objectives Notation Shop Problems: m machines, n jobs 1,..., n operations
More informationMathematics for Algorithm and System Analysis
Mathematics for Algorithm and System Analysis for students of computer and computational science Edward A. Bender S. Gill Williamson c Edward A. Bender & S. Gill Williamson 2005. All rights reserved. Preface
More informationThe Minimum Consistent Subset Cover Problem and its Applications in Data Mining
The Minimum Consistent Subset Cover Problem and its Applications in Data Mining Byron J Gao 1,2, Martin Ester 1, JinYi Cai 2, Oliver Schulte 1, and Hui Xiong 3 1 School of Computing Science, Simon Fraser
More informationOn end degrees and infinite cycles in locally finite graphs
On end degrees and infinite cycles in locally finite graphs Henning Bruhn Maya Stein Abstract We introduce a natural extension of the vertex degree to ends. For the cycle space C(G) as proposed by Diestel
More informationMathematical induction. Niloufar Shafiei
Mathematical induction Niloufar Shafiei Mathematical induction Mathematical induction is an extremely important proof technique. Mathematical induction can be used to prove results about complexity of
More informationSHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH
31 Kragujevac J. Math. 25 (2003) 31 49. SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH Kinkar Ch. Das Department of Mathematics, Indian Institute of Technology, Kharagpur 721302, W.B.,
More informationFoundations of Logic and Mathematics
Yves Nievergelt Foundations of Logic and Mathematics Applications to Computer Science and Cryptography Birkhäuser Boston Basel Berlin Contents Preface Outline xiii xv A Theory 1 0 Boolean Algebraic Logic
More informationPh.D. Thesis. Judit NagyGyörgy. Supervisor: Péter Hajnal Associate Professor
Online algorithms for combinatorial problems Ph.D. Thesis by Judit NagyGyörgy Supervisor: Péter Hajnal Associate Professor Doctoral School in Mathematics and Computer Science University of Szeged Bolyai
More information