DOCSLIB.ORG

Graph Theory

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Graph Theory Graph Theory Judith Stumpp 6. November 2013 Bei dem folgenden Skript handelt es sich um einen Mitschrieb der Vorlesung Graph Theory vom Winter- semester 2011/2012. Sie wurde gehalten von Prof. Maria Axenovich Ph.D. Der Mitschrieb erhebt weder Anspruch auf Vollständigkeit, noch auf Richtigkeit! 1 Kapitel 1 Definitions The graph is a pair V; E. V is a finite set and E V a pair of elements in V . V is called the set of vertices ⊆ 2 and E the set of edges. 1 2 5 Visualize: G = (V; E);V = 1; 2; 3; 4; 5 ;E = 1; 2 ; 1; 3 ; 2; 4 3 f g ff g f g f gg 4 History: word: Sylvester (1814-1897) and Cayley (1821-1895) Euler - developed graph theory Königsberg bridges (today Kaliningrad in Russia): A A D C D C B B Problem: Travel through each bridge once, come back to the original point. Impossible! Notations: V Kn= (V; ) - complete graph on n vertices V = n • 2 j j v1 v2 v6 v3 v5 v4 K5 K3 C6 = v1v2v3v4v5v6 Cn - cycle on n vertices • V = v1; v2; : : : ; vn ;E = v1; v2 ; v2; v3 ;:::; vn−1; vn ; vn; v1 f g ff g f g f g f gg n Pn - path on n vertices (Note: P . path on n edges (Diestel)) • V = v1; v2; : : : ; vn ;E = v1; v2 ; v2; v3 ;:::; vn−1; vn f g ff g f g f gg 2 Let P be a path from v1 to vn. The subpath of P from vi to vj is viP vj and the subpath from vi+1 to • ◦ vj is viP vj. En= (V; ); V = n isolated vertices • ; j j m n E10 Km,n Kn;m= (A B; A B);A B = complete bipartite graph • [ × \ ; Peterson graph: V = f1;2;3;4;5g ;E = i; j ; k; l : i; j k; l = • 2 fff g f g f g \ f g ;g 1, 2 { } 4, 5 3, 5 3, 4 { } { } { } 1, 3 2, 5 { } { } 1, 4 2, 4 { } { } 2, 3 1, 5 { } { } Kneser Graph K(n; k)= ( V ;E) • k V = n; E = A; B : A; B V and A B = : j j ff g 2 k \ ;g V is the set of k-element subsets of V, V = jV j k j k j k Q n- hypercube of dimension n. • f1;2;:::;ng Qn = 2 ;E ;E = A; B : A B = 1 (A B := (A B) (A B)) f g ff g j 4 j g 4 [ − \ V - set of binary n-tuples E - pairs of binary tuples different in 1 position Q1 Q2 Q3 V = ; 1 = (0); (1) V = (0; 0); (0; 1); (1; 0); (1; 1) V = (0; 0; 0);:::; (1; 1; 1) f; f gg f g f g f (1,1,1) g (1,0,1) (1,1) (1,1,0) (0,1,1) 1 (1,0,0) (0,0,1) (0,1) (1,0) (0,1,0) 0 (0,0) (0,0,0) Qn : (1,..., 1) n n 1 weight n-1 − n n 2 1001 0001 n 3 Qn 1 n weight 2 Qn 1 − 2 weight 1 (# 1’s in a binary tuple) − n (0,..., 0) 3 Parameter: Let G = (V; E) be a graph. The order of G ist the number of vertices ( V ) and the size of G j j is the number of edges ( E ). j j If the order of G is n, then 0 size(G) n . ≤ ≤ 2 If e = x; y E, x is adjacent to y and x is incident to e. f g 2 There is a n n matrix A of G = ( v1; : : : ; vn ;E) which is called the adjacent matrix. × f g v1 0 1 1 0 1 0 1 1 For v3 v2 v4 A = 0 1. 1 1 0 0 B0 1 0 0C B C @ A Subgraph: H G; H = (V 0;E0);G = (V; E);V 0 V; E0 E ⊆ ⊆ ⊆ v1 v1 v3 v2 v4 v3 v2 H H is an induced subgraph of G if H G and for v1; v2 V (H): v1; v2 E(H) v1; v2 E(G). ind⊆ ⊆ 2 f g 2 , f g 2 In the upper example it is no induced subgraph. An induced subgraph is obtained from G by deleting vertices. E.g.: v1 v1 v1 v1 v v3 v2 v4 v3 2 v2 v4 v3 v2 v4 v3 v4 Let G = (V; E) and G0 = (V 0;E0) be graphs. Then we define G G0 := (V C0;E E0) and G G0 := [ [ [ \ (V C0;E E0). \ \ G[X] := (X; x; y : x; y X; x; y E(G) ) is called the subgraph of G induced by a vertex set ff g 2 f g 2 g X V (G). E.g.: ⊆ G 2 G[ 1, 2, 3, 4 ] 2 { } 4 1 3 5 4 1 3 A degree d(v) = deg v of a vertex is the number of edges incident to that vertex. v1 v v3 2 v4 deg v1 = 2; deg v2 = 3; deg v3 = 2; deg v4 = 1 In this example the degree sequence is (2; 3; 2; 1), the minimum degree δ(G) is 1 and the maximum degree ∆(G) is 3. n 1 Apparently E(G) = 2 deg vi is true. j j i=1 n P Thus deg vi is even and therefore the number of vertices with odd degree is even. i=1 P n 1 d(G) := n deg vi is called the average degree of G. i=1 P 4 2 Extremal graph theorem: We’ll prove that if G has n vertices and > n edges G has a 4 ) triangle. l m Let A; B V; A B = . P is an A-B-path if P = v1 : : : vk;V (P ) A = v1 and V (P ) B = vk . ⊆ \ ; \ f g \ f g A graph is connected if any two vertices are linked by a path. A maximal connected subgraph of a graph is a connected component. A connected graph without cycles is called a tree. A graph without cycles (acyclic graph) is called a forest. Other „special named“ graphs: star caterpillar spider broom Proposition: If a graph G has a minimum degree δ(G) 2 then G has a path of length δ(G) and a cycle with at least δ(G) + 1 vertices. ≥ proof: Let P = (x0; : : : ; xk) be a longest path in G. Then all neighbors of xk are in V (P ) (y is a neighbor of x if x; y E). In particular k δ(G). f g 2 ≥ Let i = min j 0; : : : ; k : xk; xj E . Then xixkxk−1 : : : xi is a cycle of length at least δ + 1. f 2 f g f g 2 g δ ≥ xk xi x0 The girth of a graph G is the length of a smallest cycle in G. The distance dG(v; w) of v; w G is the length of the smallest path between them (min = ). 2 ; 1 The diameter of G is max dG(v; w): v; w G . f 2 g Proposition: Every nontrivial tree T has a leaf. proof: Assume T has no leaves. T has no isolated vertices δ(T ) 2 Cn T ) ≥ ) ⊆ - A tree T of order n 1 has n 1 edges. ≥ − proof: T = K1 X Assume it holds for all trees of order < n. Let v be a leaf of T , T 0 := T v: T 0 = n 1 < n. − T)0 is j acyclic.j − 0 0 0 Let v ; w T : P v = v0; v1; : : : ; vn = w T . 2 9 ⊆ To show: vi = v for all i = 0; : : : ; n 6 0 0 v0; vn = v because v0; vn T ; v T 6 2 62 vi = v (i = 1; : : : ; n 1) because dT (vi) 2, vi is not a leaf. 6 − ≥ 5 0 0 P T connecting v0 and w T connected T is a tree. ) ⊆ ) ) With induction hypothesis T 0 has (n 1) 1 edges. Thus T has (n 1) 1 + 2 = n 1 edges. − − − − − A walk is an alternating sequence v0e0v1e1 : : : vn of vertices and edges so that ei = vivi+1 for all n = 0; : : : ; n 1. Compared to a path it is allowed to pass edges and vertices more than once. If − v0 = vn, then the walk is a closed walk. - If G has a u-v-walk (between vertices u; v) G has a u-v-path. ) proof: Consider the shortest walk between u and v is W . Then W is a path. If not, W has a repeated 0 vertex W = ue0v1e1 ::: vi ::: vi : : : v, then W = W1W2 is a shorter u-v-walk. =:W1 =:W~ =:W2 - If G has an| odd{z closed} | {zwalk} | {z (i.e.} odd # edges) then G has an odd cycle. proof: If there are no repeated vertices (except for first and last) we have an odd cycle. ) If there is a repeated vertex vi;W = v0e0v1 ::: vi : : : vi : : : vn = v0 : 1’st part of W2 W1 2’nd part of W2 W is a union of two closed walks W1 and W2. Either W1 or W2 is an odd closed walk | {z } | {z } | {z } by induction it contains an odd cycle. ) - If G has a closed walk with a non-repeated edge W = v0e0v1 : : : ei : : : ei is unique, then G contains a cycle. proof: Induction on # vertices. Basis: Step: W = v0e0v1 ::: vi : : : vi : : : vn = v0 1’st part of W2 W1 2’nd part of W2 (note, there is a repeated vertex vj, otherwise W is a cycle) | {z } | {z } | {z } So, W is a union of two closed walks W1 and W2 and either W1 or W2 has a non-repeated edge.
Load more

Recommended publications
  • The Strong Perfect Graph Theorem
    Annals of Mathematics, 164 (2006), 51–229 The strong perfect graph theorem ∗ ∗ By Maria Chudnovsky, Neil Robertson, Paul Seymour, * ∗∗∗ and Robin Thomas Abstract A graph G is perfect if for every induced subgraph H, the chromatic number of H equals the size of the largest complete subgraph of H, and G is Berge if no induced subgraph of G is an odd cycle of length at least five or the complement of one. The “strong perfect graph conjecture” (Berge, 1961) asserts that a graph is perfect if and only if it is Berge. A stronger conjecture was made recently by Conforti, Cornu´ejols and Vuˇskovi´c — that every Berge graph either falls into one of a few basic classes, or admits one of a few kinds of separation (designed so that a minimum counterexample to Berge’s conjecture cannot have either of these properties). In this paper we prove both of these conjectures. 1. Introduction We begin with definitions of some of our terms which may be nonstandard. All graphs in this paper are finite and simple. The complement G of a graph G has the same vertex set as G, and distinct vertices u, v are adjacent in G just when they are not adjacent in G.Ahole of G is an induced subgraph of G which is a cycle of length at least 4. An antihole of G is an induced subgraph of G whose complement is a hole in G. A graph G is Berge if every hole and antihole of G has even length. A clique in G is a subset X of V (G) such that every two members of X are adjacent.
    [Show full text]
  • Induced Path Factors of Regular Graphs Arxiv:1809.04394V3 [Math.CO] 1
    Induced path factors of regular graphs Saieed Akbari∗ Daniel Horsley† Ian M. Wanless† Abstract An induced path factor of a graph G is a set of induced paths in G with the property that every vertex of G is in exactly one of the paths. The induced path number ρ(G) of G is the minimum number of paths in an induced path factor of G. We show that if G is a connected cubic graph on n > 6 vertices, then ρ(G) 6 (n − 1)=3. Fix an integer k > 3. For each n, define Mn to be the maximum value of ρ(G) over all connected k-regular graphs G on n vertices. As n ! 1 with nk even, we show that ck = lim(Mn=n) exists. We prove that 5=18 6 c3 6 1=3 and 3=7 6 c4 6 1=2 and that 1 1 ck = 2 − O(k− ) for k ! 1. Keywords: Induced path, path factor, covering, regular graph, subcubic graph. Classifications: 05C70, 05C38. 1 Introduction We denote the path of order n by Pn. A subgraph H of a graph G is said to be induced if, for any two vertices x and y of H, x and y are adjacent in H if and only if they are adjacent in G. An induced path factor (IPF) of a graph G is a set of induced paths in G with the property that every vertex of G is in exactly one of the paths. We allow paths of any length in an IPF, including the trivial path P1.
    [Show full text]
  • Polynomial-Time Algorithms for the Longest Induced Path and Induced Disjoint Paths Problems on Graphs of Bounded Mim-Width∗†
    Polynomial-Time Algorithms for the Longest Induced Path and Induced Disjoint Paths Problems on Graphs of Bounded Mim-Width∗† Lars Jaffke‡1, O-joung Kwon§2, and Jan Arne Telle3 1 Department of Informatics, University of Bergen, Norway [email protected] 2 Logic and Semantics, Technische Universität Berlin, Berlin, Germany [email protected] 3 Department of Informatics, University of Bergen, Norway [email protected] Abstract We give the first polynomial-time algorithms on graphs of bounded maximum induced matching width (mim-width) for problems that are not locally checkable. In particular, we give nO(w)-time algorithms on graphs of mim-width at most w, when given a decomposition, for the following problems: Longest Induced Path, Induced Disjoint Paths and H-Induced Topological Minor for fixed H. Our results imply that the following graph classes have polynomial-time algorithms for these three problems: Interval and Bi-Interval graphs, Circular Arc, Per- mutation and Circular Permutation graphs, Convex graphs, k-Trapezoid, Circular k-Trapezoid, k-Polygon, Dilworth-k and Co-k-Degenerate graphs for fixed k. 1998 ACM Subject Classification F.2.2 Nonnumerical Algorithms and Problems, Computations on discrete structures, G.2.2 Graph Theory, Graph algorithms Keywords and phrases graph width parameters, dynamic programming, graph classes, induced paths, induced topological minors Digital Object Identifier 10.4230/LIPIcs.IPEC.2017.21 1 Introduction Ever since the definition of the tree-width of graphs emerged from the Graph Minors project of Robertson and Seymour, bounded-width structural graph decompositions have been a successful tool in designing fast algorithms for graph classes on which the corresponding width-measure is small.
    [Show full text]
  • Long Induced Paths in Graphs∗ Arxiv:1602.06836V2 [Math.CO] 1
    Long induced paths in graphs∗ Louis Esperety Laetitia Lemoinez Fr´ed´ericMaffrayx December 2, 2016 Abstract We prove that every 3-connected planar graph on n vertices contains an induced path on Ω(log n) vertices, which is best possible and improves the best known lower bound by a multiplicative factor of log log n. We deduce that any planar graph (or more generally, any graph embeddable on a fixed surface) with a path on n vertices, also contains an induced path on Ω(plog n) vertices. We conjecture that for any k, there is a positive constant c(k) such that any k-degenerate graph with a path on n vertices also contains an induced path on Ω((log n)c(k)) vertices. We provide examples showing that this order of magnitude would be best possible (already for chordal graphs), and prove the conjecture in the case of interval graphs. 1 Introduction A graph contains a long induced path (i.e., a long path as an induced subgraph) only if it contains a long path. However, this necessary condition is not sufficient, as shown by complete graphs and complete bipartite graphs. On the other hand, it was proved by Atminas, Lozin and Ragzon [2] that if a graph G contains a long path, but does not contain a large complete graph or complete bipartite graph, then G contains a long induced path. Their proof uses several applications of Ramsey theory, and the resulting bound on the size of a long induced path is thus quantitatively weak. The specific case of k-degenerate graphs (graphs such that any subgraph contains a arXiv:1602.06836v2 [math.CO] 1 Dec 2016 vertex of degree at most k) was considered by Neˇsetˇriland Ossona de Mendez in [6].
    [Show full text]
  • Exact and Approximate Algorithms for the Longest Induced Path Problem
    RAIRO-Oper. Res. 55 (2021) 333{353 RAIRO Operations Research https://doi.org/10.1051/ro/2021004 www.rairo-ro.org EXACT AND APPROXIMATE ALGORITHMS FOR THE LONGEST INDUCED PATH PROBLEM Ruslan´ G. Marzo and Celso C. Ribeiro∗ Abstract. The longest induced path problem consists in finding a maximum subset of vertices of a graph such that it induces a simple path. We propose a new exact enumerative algorithm that solves problems with up to 138 vertices and 493 edges and a heuristic for larger problems. Detailed computational experiments compare the results obtained by the new algorithms with other approaches in the literature and investigate the characteristics of the optimal solutions. Mathematics Subject Classification. 05C30, 05C38, 05C85, 68W25, 90C27, 90C35. Received October 16, 2020. Accepted January 14, 2021. 1. Introduction Let G = (V; E) be an undirected graph defined by its set of n vertices V = f1; ··· ; ng and its edge set E ⊆ V × V . For any subset of vertices S ⊆ V , let G[S] = (S; E0) denote the subgraph induced by S in G, where E0 contains all edges from E that have both of their endpoints in S. The longest induced path problem (LIPP) is defined as that of finding the subset S ⊆ V of largest cardinality such that the resulting induced subgraph, G[S], is a simple path [13]. The longest induced path problem has applications in various network analysis and design contexts. The graph diameter, which is defined as the length of the longest shortest path in a graph, is often used to quantify graph communication properties.
    [Show full text]
  • Stronger ILP Models for Maximum Induced Path
    1 Stronger ILP Models for Maximum Induced Path 2 Fritz Bökler 3 Theoretical Computer Science, Osnabrück University, Germany 4 [email protected] 5 Markus Chimani 6 Theoretical Computer Science, Osnabrück University, Germany 7 [email protected] 8 Mirko H. Wagner 9 Theoretical Computer Science, Osnabrück University, Germany 10 [email protected] 11 Tilo Wiedera 12 Theoretical Computer Science, Osnabrück University, Germany 13 [email protected] 14 Abstract 15 Given a graph G = (V, E), the Longest Induced Path problem asks for a maximum cardinality 16 node subset W ⊆ V such that the graph induced by W is a path. It is a long established problem 17 with applications, e.g., in network analysis. We propose two novel integer linear programming (ILP) 18 formulations for the problem and discuss algorithms to implement them efficiently. Comparing them 19 with known formulations from literature, we show that they are both beneficial in theory, yielding 20 stronger relaxations. Furthermore, we show that our best models yield running times faster than 21 the state-of-the-art by orders of magnitudes in practice. 22 2012 ACM Subject Classification Mathematics of computing → Paths and connectivity problems; 23 Theory of computation → Integer programming 24 Keywords and phrases longest induced path, ILP, polyhedral analysis, experimental algorithmics 25 Digital Object Identifier 10.4230/LIPIcs.submitted.2019.0 26 1 Introduction 27 Let G = (V, E) be an undirected graph, and W ⊆ V a node subset. The induced graph 28 G[W ] contains exactly those edges of G whose incident nodes are both in W .
    [Show full text]
  • Polynomial Kernel for Distance-Hereditary Deletion
    A POLYNOMIAL KERNEL FOR DISTANCE-HEREDITARY VERTEX DELETION EUN JUNG KIM AND O-JOUNG KWON Abstract. A graph is distance-hereditary if for any pair of vertices, their distance in every connected induced subgraph containing both vertices is the same as their distance in the original graph. The Distance-Hereditary Vertex Deletion problem asks, given a graph G on n vertices and an integer k, whether there is a set S of at most k vertices in G such that G − S is distance-hereditary. This problem is important due to its connection to the graph parameter rank-width that distance-hereditary graphs are exactly graphs of rank-width at most 1. Eiben, Ganian, and Kwon (MFCS' 16) proved that Distance-Hereditary Vertex Deletion can be solved in time 2O(k)nO(1), and asked whether it admits a polynomial kernelization. We show that this problem admits a polynomial kernel, answering this question positively. For this, we use a similar idea for obtaining an approximate solution for Chordal Vertex Deletion due to Jansen and Pilipczuk (SODA' 17) to obtain an approximate solution with O(k3 log n) vertices when the problem is a Yes-instance, and we exploit the structure of split decompositions of distance-hereditary graphs to reduce the total size. 1. Introduction The graph modification problems, in which we want to transform a graph to satisfy a certain property with as few graph modifications as possible, have been extensively studied. For instance, the Vertex Cover and Feedback Vertex Set problems are graph modification problems where the target graphs are edgeless graphs and forests, respectively.
    [Show full text]
  • Perfect Graphs Chinh T
    University of Dayton eCommons Computer Science Faculty Publications Department of Computer Science 2015 Perfect Graphs Chinh T. Hoang Wilfrid Laurier University R. Sritharan University of Dayton Follow this and additional works at: http://ecommons.udayton.edu/cps_fac_pub Part of the Graphics and Human Computer Interfaces Commons, and the Other Computer Sciences Commons eCommons Citation Hoang, Chinh T. and Sritharan, R., "Perfect Graphs" (2015). Computer Science Faculty Publications. 87. http://ecommons.udayton.edu/cps_fac_pub/87 This Book Chapter is brought to you for free and open access by the Department of Computer Science at eCommons. It has been accepted for inclusion in Computer Science Faculty Publications by an authorized administrator of eCommons. For more information, please contact [email protected], [email protected]. CHAPTE R 28 Perfect Graphs Chinh T. Hoang* R. Sritharan t CO NTENTS 28.1 Introd uction ... .. ..... ............. ............................... .. ........ .. 708 28.2 Notation ............................. .. ..................... .................... 710 28.3 Chordal Graphs ....................... ................. ....... ............. 710 28.3.1 Characterization ............ ........................... .... .. ... 710 28.3.2 Recognition .................... ..................... ... .. ........ .. ... 712 28.3.3 Optimization ................................................ .. ......... 715 28.4 Comparability Graphs ............................................... ..... .. 715 28.4.1 Characterization
    [Show full text]
  • Solving the Snake in the Box Problem with Heuristic Search: First Results
    Solving the Snake in the Box Problem with Heuristic Search: First Results Alon Palombo, Roni Stern, Scott Kiesel and Wheeler Ruml Rami Puzis and Ariel Felner Department of Computer Science Department of Information Systems Engineering University of New Hampshire Ben-Gurion University of the Negev Durham, NH 03824 USA Beer Sheva, Israel [email protected] [email protected] skiesel and ruml at cs.unh.edu sternron, puzis, felner at post.bgu.ac.il Abstract 110 111 Snake in the Box (SIB) is the problem of finding the 100 101 longest simple path along the edges of an n-dimensional cube, subject to certain constraints. SIB has impor- tant applications in coding theory and communications. State of the art algorithms for solving SIB apply unin- formed search with symmetry breaking techniques. We 010 011 formalize this problem as a search problem and propose several admissible heuristics to solve it. Using the pro- posed heuristics is shown to have a huge impact on the number of nodes expanded and, in some configurations, 000 001 on runtime. These results encourage further research in using heuristic search to solve SIB, and to solve maxi- Figure 1: An example of a snake in a 3 dimensional cube. mization problems more generally. Introduction vi. Gray codes generated from snakes are particularly useful for error correction and detection because they are relatively The longest simple path (LPP) problem is to find the longest robust to one-bit errors: flipping one bit in the label of v is path in a graph such that any vertex is visited at most once.
    [Show full text]
  • Solving the Snake in the Box Problem with Heuristic Search: First Results
    Solving the Snake in the Box Problem with Heuristic Search: First Results Alon Palombo, Roni Stern, Scott Kiesel and Wheeler Ruml Rami Puzis and Ariel Felner Department of Computer Science Department of Information Systems Engineering University of New Hampshire Ben-Gurion University of the Negev Durham, NH 03824 USA Beer Sheva, Israel [email protected] [email protected] skiesel and ruml at cs.unh.edu sternron, puzis, felner at post.bgu.ac.il Abstract 110 111 Snake in the Box (SIB) is the problem of finding the 100 101 longest simple path along the edges of an n-dimensional cube, subject to certain constraints. SIB has impor- tant applications in coding theory and communications. State of the art algorithms for solving SIB apply unin- formed search with symmetry breaking techniques. We 010 011 formalize this problem as a search problem and propose several admissible heuristics to solve it. Using the pro- posed heuristics is shown to have a huge impact on the number of nodes expanded and, in some configurations, 000 001 on runtime. These results encourage further research in using heuristic search to solve SIB, and to solve maxi- Figure 1: An example of a snake in a 3 dimensional cube. mization problems more generally. Introduction vi. Gray codes generated from snakes are particularly useful for error correction and detection because they are relatively The longest simple path (LPP) problem is to find the longest robust to one-bit errors: flipping one bit in the label of v is path in a graph such that any vertex is visited at most once.
    [Show full text]
  • Induced Path Number for the Complementary Prism of a Grid Graph
    INDUCED PATH NUMBER FOR THE COMPLEMENTARY PRISM OF A GRID GRAPH By Jeffrey Vance Christopher Terry Walters Francesco Barioli Professor of Mathematics Associate Professor of Mathematics (Committee Chair) (Committee Member) Ossama Saleh Lucas Van der Merwe Professor of Mathematics Professor of Mathematics (Committee Member) (Committee Member) INDUCED PATH NUMBER FOR THE COMPLEMENTARY PRISM OF A GRID GRAPH By Jeffrey Vance Christopher A Thesis Submitted to the Faculty of the University of Tennessee at Chattanooga in Partial Fulfillment of the Requirements of the Degree of Master of Science: Mathematics The University of Tennessee at Chattanooga Chattanooga, Tennessee May 2019 ii ABSTRACT The induced path number ρ(G) of a graph G is defined as the minimum number of subsets into which the vertex set of G can be partitioned so that each subset induces a path. A complementary prism of a graph G that we will refer to as CP (G) is the graph formed from the disjoint union of G and G and adding the edges between the corresponding vertices of G and G. These new edges are called prism edges. The graph grid(n; m) is the Cartesian product of Pn with Pm. In this thesis we will give an overview of a selection of important results in determining ρ(G) of various graphs, we will then provide proofs for determining the exact value of ρ(CP (grid(n; m))) for specific values of n and m. iii DEDICATION Dedicated to my parents for always giving me support, to my children Florence and Claire for inspiring me, and to my wife Elizabeth who made it all possible.
    [Show full text]
  • A Charming Class of Perfectly Orderable Graphs
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector Discrete Mathematics 102 (1992) 67-74 67 North-Holland Communication A charming class of perfectly orderable graphs Chinh T. HoAng Department of Mathematical Sciences, Lakehead University, Thunder Bay, Ont., Canada P7B 5El FrkdCric Maffray CNRS, Laboratoire de Structures D&r&es, IMAG, BP 53X, 38041 Grenoble C6de.q France Stephan Olariu Department of Computer Science, Old Dominion University, Norfolk, VA 23529-0162, USA Myriam Preissmann CNRS, Laboratoire ARTEMIS, IMAG, BP 53X, 38041 Grenoble Cbdex, France Communicated by V. Chvatal Received 14 November 1991 Abstract Hoang, C.T., F. Maffray, S. Olariu and M. Preissmann, A charming class of perfectly orderable graphs, Discrete Mathematics 102 (1992) 67-74. We investigate the following conjecture of VaSek Chvatal: any weakly triangulated graph containing no induced path on five vertices is perfectly orderable. In the process we define a new polynomially recognizable class of perfectly orderable graphs called charming. We show that every weakly triangulated graph not containing as an induced subgraph a path on five vertices or the complement of a path on six vertices is charming. A classical problem in graph theory is of colouring the vertices of a graph in such a way that no two adjacent vertices receive the same colour. For this purpose a natural way consists of ordering the vertices linearly and colouring them one by one along this ordering, assigning to each vertex v the smallest colour not assigned to the neighbours of v that precede it.
    [Show full text]