DOCSLIB.ORG

Algebraic Graph Theory Cambridge

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Algebraic Graph Theory Cambridge ALGEBRAIC GRAPH THEORY Second Edition NORMAN BIGGS London School of Economics CAMBRIDGE UNKVERSITY PRESS Contents Preface 1 Introduction PART ONE -- LINEAR ALGEBRA IN GRAPH THEORY 2 The spectrum of a graph 3 Regular graphs and line graphs 4 Cycles and cuts 5 Spanning trees and associated structures 6 The tree-number 7 Deterninant expansions 8 Vertex-partitions and the spectrum PART TWO - COLOURING PROBLEMS 9 The chromatic polynomial 10 Subgraph expansions 11 The multiplicative expansion 12 The induced subgraph expansion 13 The Tutte polynomial 14 Chromatic polynomials and spanning trees PART THREE - SYMMETRY AND REGULARITY 15 Automorphisms of graphs 16 vertex-transitive graphs 17 Symmetric graphs vi Contents 18 Symmetric graphs of degree three 19 The covering-graph construction 20 Distance-transitive graphs 21 Feasibility of intersection arrays 22 Imprimitivity 23 Minimal regular graphs with given girth References Index Index acyclic orientation 70 complete graph 8 adjacent 7 complete matching 50 adjacency algebra 9 complete multipartite graph 41 adjacency matrix 7 conductance 34 almost-complete 43 cone 66 alternating knot 105 confluence 72 angles 51 conforms 30 antipodal 177 conjugate Bell polynomials 72 antipodal r-fold covering 178 connected 10 augmentation 29 contracting 64 automorphic 178 Conway's presentations 145 automorphism 115 co-rank 25, 97 automorphism group 115 coset graph 128 cospectral graphs 12, 49 bicentroid 119 cover 50 bigrading 97 covering graph 149 bipartite 11 cube 43, 69, 140, 157, 161, 169 biplane 189 cubic graph 138 block 81 current 34 block system 173 cut 26 broken cycle 77 cut-orientation 26 Brooks's theorem 55 cut-subspace 26 buckminsterfullerene 127 cut-vertex 67 cage 181, 188, 189 cycle 25 Cayley graph 123 cycle graph 17, 65 centroid 119 , cycle-orientation 25 characteristic polynomial 8 cycle-subspace 26 chromatically unique 69 chromatic invariant 107 degree 4 chromatic number' 52 deletion-contraction 65, 72 chromatic polynomial 63 density 94 chromatic root 71 derived graph 178 circulant graph 16, 126 Desargues graph 148, 153 circulant matrix 16 diameter 10 closed walk 12 dihedral group 126 coboundary mapping 28 distance 10 cocktail-party graph 17, 68 distance matrices 13, 159 colour-class 52 distance-regular 13, 159 colour-partition 52 distance-transitive 118, 155 compatible 150 dodecahedron 69, 178 complete bipartite graph 21 double pyramid 68 Index double-transitivity 118 incidence mapping 24, 29 dual 29,43 incidence matrix 24 independent 98 edge 3 indicator function 74 edge space 23 induced subgraph 4 edge-transitive 115. 118, 120 interaction model 80 effective resistance 3G internal activity 99 eigenvalue 8 internally active 99 clectrical network 34 intersection array 157, 159 elrrnentary 44 intersection matrix 165 ends 4 intersection numbers 156 equipartition 58 Ising model 80 even subgraph 110 isoperimetric number 28, 58 excess 28, 189 isthmus 30 expansion 147 external activity 99 join 66 externally active 99 Jones polynomial 105 feasible array 168 K-chain 149 flow 29 Kelly's lemma 50 flow polynomial 110 Kirchhoff !s laws 34 forest 47 Kocay's lemma 50 Foster's census 147 Krein parameters 170 friendship theorern 171 labelled tree 104 generalized d-gon 187 ladder 69. 126 generalized line graph 21 Laplacian matrix 27 generalized polygon graph 181 Laplacian spectrum 29. 40 general graph 3 line graph 17, 120 girth 28, 76. 131. 180 logarithmic transform 82 g~aph4 loop 3 graphical regular representation medial graph 104 124. 128 minimal support 29 graph types 87 Mobius ladder 20: 42. 69. 110 Harniltonian cycle 50 modified rank polynomial 101 Hamming graph 169 modular flour 30 Hcawood graph 148. 154. 163 Moore graph 181 Hoffman-Singleton graph 189 Motzkin-Straus formula 59 homeomorphic 79> 108 negative end 24 homogeneous 120 nowhere-zero 30 homological covering 154 Hopf algebra 88 octahedron 43 hyperoctahedral graph 17 odd graphs 20: 58, 137. 161: 170 orbit 115 icosahedral group 127 orientation 24 icosahedron 69, 1.78 ilrlprimitiw 177 Paley graph 129 Index Pappus graph 148, 154 spectruni 8 partial geometry 162 sporadic groups 172 partition function 80 square lattice 96 path graph 11 stabilizer 122 perfect code 22, 171 stabilizer sequence 133, 137, 147 permutation character 172 standard bases 24 permutation matrix 116 star graph 49 Petersen graph 20, 95, 103, 133 star types 87 planar 29 strict graph 4 positive end 24 strongly regular graph 16, 20, 159, potential 36 171 Potts model 80 subdividing 79 power 36 subgraph 4 primitive 30, 173 successor 132 principal minors 8 support 29 projective plane 163 suspension 66 proper 90 symmetric 118, 126 pyramid 68 symmetric cycle 137 symmetric design 163 quasi-separable 67 symmetric group 118, 148 quasi-separation 67 t-arc 130 rank 25 tetrahedral group 127 rank matrix 73 thermodynamic limit 94 rank polynomial 73 theta graph 86 Rayleigh quotient 54 Thomson's principle 36 Rayleigh's monotonicity law 37 topological invariant 79 reconstructible 50, 91 totally unimodular 34 reconstruction conjecture 50 tree 47, 49, 65, 119 recursive family 70, 103 tree-number 38 regular graph 14 triangle graph 19, 169 regular action 122 tridiagonal 165 resonant model 80 t-transitive 131 rewriting rules 72 Turan's Theorem 59 root systems 22 Tutte polynomial 97, 100 r-ply transitive 162 umbra1 chromatic polynomial 72 semi-direct product 150 unimodal conjecture 108 separable 67 separation 67 vertex 3 series-parallel 109 vertex-colouring 52 sextet graph 145 vertex space 23 Shannon capacity 51 vertex-stabilizer 122, 127 sides 149 vertex-transitive 115, 120, 125 simple eigenvalues 116, 125 V-function 79 spanning elementary subgraph 44 voltage 34 spanning tree 31 spectral decomposition 13 walk 9 Index 205 walk-generating function 13 weakly homogeneous 120 walk-generating matrix 12 wheel 68 .
Load more

Recommended publications
  • Graphs with Flexible Labelings
    Graphs with Flexible Labelings Georg Grasegger∗ Jan Legersk´yy Josef Schichoy For a flexible labeling of a graph, it is possible to construct infinitely many non-equivalent realizations keeping the distances of connected points con- stant. We give a combinatorial characterization of graphs that have flexible labelings, possibly non-generic. The characterization is based on colorings of the edges with restrictions on the cycles. Furthermore, we give necessary criteria and sufficient ones for the existence of such colorings. 1 Introduction Given a graph together with a labeling of its edges by positive real numbers, we are interested in the set of all functions from the set of vertices to the real plane such that the distance between any two connected vertices is equal to the label of the edge connecting them. Apparently, any such \realization" gives rise to infinitely many equivalent ones, by the action of the group of Euclidean congruence transformations. If the set of equivalence classes is finite and non-empty, then we say that the labeled graph is rigid; if this set is infinite, then we say that the labeling is flexible. The main result in this paper is a combinatorial characterization of graphs that have a flexible labeling. The characterization of graphs such that a generically chosen assign- ment of the vertices to the real plane gives a flexible labeling is classical: by a theorem of Geiringer-Pollaczek [8] which was rediscovered by Laman [6], this is true if the graph contains no Laman subgraph with the same set of vertices. Here, a graph G = (VG;EG) is called a Laman graph if and only if jEGj = 2jVGj − 3 and jEH j ≤ 2jVH j − 3 for any ∗Johann Radon Institute for Computational and Applied Mathematics (RICAM), Austrian Academy of Sciences arXiv:1708.05298v2 [math.CO] 19 Nov 2018 yResearch Institute for Symbolic Computation (RISC), Johannes Kepler University Linz This project has received funding from the European Union's Horizon 2020 research and innovation programme under the Marie Sk lodowska-Curie grant agreement No 675789.
    [Show full text]
  • Tight Bounds for Online Edge Coloring
    Tight Bounds for Online Edge Coloring Ilan Reuven Cohen∗1, Binghui Peng†‡2, and David Wajc§¶k3 1Carnegie Mellon University and University of Pittsburgh 2Tsinghua University 3Carnegie Mellon University Abstract Vizing’s celebrated theorem asserts that any graph of maximum degree ∆ admits an edge coloring using at most ∆ + 1 colors. In contrast, Bar-Noy, Motwani and Naor showed over a quarter century ago that the trivial greedy algorithm, which uses 2∆ 1 colors, is optimal among online algorithms. Their lower bound has a caveat, however: it− only applies to low- degree graphs, with ∆ = O(log n), and they conjectured the existence of online algorithms using ∆(1 + o(1)) colors for ∆= ω(log n). Progress towards resolving this conjecture was only made under stochastic arrivals (Aggarwal et al., FOCS’03 and Bahmani et al., SODA’10). We resolve the above conjecture for adversarial vertex arrivals in bipartite graphs, for which we present a (1+ o(1))∆-edge-coloring algorithm for ∆= ω(log n) known a priori. Surprisingly, if ∆ is not known ahead of time, we show that no e Ω(1) ∆-edge-coloring algorithm exists. e−1 − We then provide an optimal, e + o(1) ∆-edge-coloring algorithm for unknown ∆= ω(log n). e−1 Key to our results, and of possible independent interest, is a novel fractional relaxation for edge coloring, for which we present optimal fractional online algorithms and a near-lossless online rounding scheme, yielding our optimal randomized algorithms. ∗Email address: [email protected]. †Email address: [email protected]. ‡Work done in part while the author was visiting Carnegie Mellon University.
    [Show full text]
  • Hamilton Cycle Heuristics in Hard Graphs (Under the Direction of Pro- Fessor Carla D
    ABSTRACT SHIELDS, IAN BEAUMONT Hamilton Cycle Heuristics in Hard Graphs (Under the direction of Pro- fessor Carla D. Savage) In this thesis, we use computer methods to investigate Hamilton cycles and paths in several families of graphs where general results are incomplete, including Kneser graphs, cubic Cayley graphs and the middle two levels graph. We describe a novel heuristic which has proven useful in finding Hamilton cycles in these families and compare its performance to that of other algorithms and heuristics. We describe methods for handling very large graphs on personal computers. We also explore issues in reducing the possible number of generating sets for cubic Cayley graphs generated by three involutions. Hamilton Cycle Heuristics in Hard Graphs by Ian Beaumont Shields A dissertation submitted to the Graduate Faculty of North Carolina State University in partial fulfillment of the requirements for the Degree of Doctor of Philosophy Computer Science Raleigh 2004 APPROVED BY: ii Dedication To my wife Pat, and my children, Catherine, Brendan and Michael, for their understanding during these years of study. To the memory of Hanna Neumann who introduced me to combinatorial group theory. iii Biography Ian Shields was born on March 10, 1949 in Melbourne, Australia. He grew up and attended school near the foot of the Dandenong ranges. After a short time in actuarial work he attended the Australian National University in Canberra, where he graduated in 1973 with first class honours in pure mathematics. Ian worked for IBM and other companies in Australia, Canada and the United States, before resuming part-time study for a Masters Degree in Computer Science at North Carolina State University which he received in May 1995.
    [Show full text]
  • Are Highly Connected 1-Planar Graphs Hamiltonian? Arxiv:1911.02153V1 [Cs.DM] 6 Nov 2019
    Are highly connected 1-planar graphs Hamiltonian? Therese Biedl Abstract It is well-known that every planar 4-connected graph has a Hamiltonian cycle. In this paper, we study the question whether every 1-planar 4-connected graph has a Hamiltonian cycle. We show that this is false in general, even for 5-connected graphs, but true if the graph has a 1-planar drawing where every region is a triangle. 1 Introduction Planar graphs are graphs that can be drawn without crossings. They have been one of the central areas of study in graph theory and graph algorithms, and there are numerous results both for how to solve problems more easily on planar graphs and how to draw planar graphs (see e.g. [1, 9, 10])). We are here interested in a theorem by Tutte [17] that states that every planar 4-connected graph has a Hamiltonian cycle (definitions are in the next section). This was an improvement over an earlier result by Whitney that proved the existence of a Hamiltonian cycle in a 4-connected triangulated planar graph. There have been many generalizations and improvements since; in particular we can additionally fix the endpoints and one edge that the Hamiltonian cycle must use [16, 12]. Also, 4-connected planar graphs remain Hamiltonian even after deleting 2 vertices [14]. Hamiltonian cycles in planar graphs can be computed in linear time; this is quite straightforward if the graph is triangulated [2] and a bit more involved for general 4-connected planar graphs [5]. There are many graphs that are near-planar, i.e., that are \close" to planar graphs.
    [Show full text]
  • Generalized Line Graphs: Cartesian Products and Complexity of Recognition ∗
    Generalized line graphs: Cartesian products and complexity of recognition ∗ Aparna Lakshmanan S. Csilla Bujt´as Department of Mathematics Department of Computer Science and Technology St. Xavier's College for Women University of Pannonia Aluva, India Veszpr´em,Hungary [email protected] [email protected] Zsolt Tuza Alfr´edR´enyi Institute of Mathematics Hungarian Academy of Sciences Budapest, Hungary [email protected] Submitted: Dec 21, 2014; Accepted: Aug 20, 2015; Published: Sep 11, 2015 Mathematics Subject Classifications: 05C75 (primary), 05C62, 68Q17 Abstract Putting the concept of line graph in a more general setting, for a positive integer k the k-line graph Lk(G) of a graph G has the Kk-subgraphs of G as its vertices, and two vertices of Lk(G) are adjacent if the corresponding copies of Kk in G share k − 1 vertices. Then, 2-line graph is just the line graph in usual sense, whilst 3-line graph is also known as triangle graph. The k-anti-Gallai graph 4k(G) of G is a specified subgraph of Lk(G) in which two vertices are adjacent if the corresponding two Kk-subgraphs are contained in a common Kk+1-subgraph in G. We give a unified characterization for nontrivial connected graphs G and F such that the Cartesian product G F is a k-line graph. In particular for k = 3, this answers the question of Bagga (2004), yielding the necessary and sufficient condition that G is the line graph of a triangle-free graph and F is a complete graph (or vice versa).
    [Show full text]
  • ABSTRACTS Multidesigns of the Λ-Fold Complete Graph Atif Abueida
    ABSTRACTS Multidesigns of the λ-fold complete graph Atif Abueida, University of Dayton By a graph-pair of order t, we mean two non-isomorphic graphs G and H on t non-isolated vertices ∼ for which G ∪ H = Kt for some integer t ≥ 4. we consider the existence of multidecompositions of λKm for the graph-pairs of order 4 or 5. For those graph-pairs, we will also look for maximum multipackings and minimum multicoverings of λKm. An Upper Bound of Integrity of n-cage Graph Mustafa Atici, Western Kentucky University Integrity, a measure of network to reliability, is defined as I(G) = minS⊂V {|S| + m(G − S)} , where G is a graph with vertex set V and m(G − S) denotes the order of the largest component of G − S. We prove an upper bound of the following form on the integrity of any r-cage graph with n vertices: n+2 n+2 I(G) ≤ + I(P 3n−2 ), if = 4t 4 4 4 n n 0 I(G) ≤ + I(C 3n )if = 4t 4 4 4 where t and t0 are integers. To prove this upper bound we first solve the following problem: Suppose G is a connected cubic graph with g ≥ 2(d − 3) and d ≥ 5, where d is diameter and g is n girth of the graph G. We can remove d 4 e vertices from G in such a way that the remaining graph 3n 3n is a tree or a G( 4 , 4 ) graph. On Rainbow Arithmetic Progressions Maria Axenovich∗, Iowa State University Dmitri Fon-Der-Flaass Consider natural numbers {1, ··· , n} colored in three colors.
    [Show full text]
  • Drawing Outerplanar Graphs Using Three Edge Lengths
    Drawing outerplanar graphs using three edge lengths Noga Alon ∗ Ohad N. Feldheim † August 27, 2013 Abstract It is shown that for any outerplanar graph G there is a one to one mapping of the vertices of G to the plane, so that the number of distinct distances between pairs of connected vertices is at most three. This settles a problem of Carmi, Dujmovi´c, Morin and Wood. The proof combines (elementary) geometric, combinatorial, algebraic and probabilistic arguments. Keywords: Outerplanar graphs, distance number of a graph, degenerate drawing of a graph. 1 Introduction A linear embedding of a graph G is a mapping of the vertices of G to points in the plane. The image of every edge uv of the graph is the open interval between the image of u and the image of v. The length of that interval is called the edge-length of uv in the embedding. A degenerate drawing of a graph G is a linear embedding in which the images of all vertices are distinct. A drawing of G is a degenerate drawing in which the image of every edge is disjoint from the image of every vertex. The distance-number of a graph is the minimum number of distinct edge-lengths in a drawing of G, the degenerate distance-number is its counterpart for degenerate drawings. An outerplanar graph is a graph that can be embedded in the plane without crossings in such a way that all the vertices lie in the boundary of the unbounded face of the embedding. In [1], Carmi, Dujmovi´c, Morin and Wood ask if the degenerate distance-number of outerplanar graphs is uniformly bounded.
    [Show full text]
  • The Graph Isomorphism Problem on Geometric Graphs Ryuhei Uehara
    The graph isomorphism problem on geometric graphs Ryuhei Uehara To cite this version: Ryuhei Uehara. The graph isomorphism problem on geometric graphs. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2014, Vol. 16 no. 2 (in progress) (2), pp.87–96. hal- 01185616 HAL Id: hal-01185616 https://hal.inria.fr/hal-01185616 Submitted on 20 Aug 2015 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Discrete Mathematics and Theoretical Computer Science DMTCS vol. 16:2, 2014, 87–96 The graph isomorphism problem on geometric graphs Ryuhei Uehara∗ School of Information Science, Japan Advanced Institute of Science and Technology (JAIST), Ishikawa, Japan. received 29th Nov. 2013, revised 7th July 2014, accepted 8th July 2014. The graph isomorphism (GI) problem asks whether two given graphs are isomorphic or not. The GI problem is quite basic and simple, however, it’s time complexity is a long standing open problem. The GI problem is clearly in NP, no polynomial time algorithm is known, and the GI problem is not NP-complete unless the polynomial hierarchy collapses. In this paper, we survey the computational complexity of the problem on some graph classes that have geometric characterizations.
    [Show full text]
  • CMSC 27130 Honors Discrete Mathematics
    CMSC 27130 Honors Discrete Mathematics Lectures by Alexander Razborov Notes by Justin Lubin The University of Chicago, Autumn 2017 1 Contents I Number Theory 4 1 The Euclidean Algorithm 4 2 Mathematical Induction 4 3 Strong Induction and the Well-Ordering Principle 6 3.1 Strong Induction . 6 3.2 The Well-Ordering Principle . 7 IV Graph Theory 10 21 Introduction to Graph Theory 10 21.1 Graphs . 10 21.2 The Handshaking Lemma . 11 21.3 Paths and Connectedness . 11 21.4 Graph Properties . 12 22 Exploring Graphs 13 22.1 Spectral Graph Theory . 13 22.2 Graph Relationships . 15 23 Some Graph Theorems 16 23.1 Extremal Graph Theory . 16 23.2 Bipartite Graphs . 17 24 More Graph Properties and Trees 18 24.1 Cliques, Coloring, and Independence . 18 24.2 Trees . 20 25 Planar Graphs 21 25.1 Planarity . 21 25.2 Euler's Formula . 22 25.3 Dual Graphs . 23 2 25.4 The Nonplanarity of K5 and K3;3 ........................ 23 Notation and Conventions For this document, I adhere to the following conventions: • The \natural numbers" are represented by N and are equal to f1; 2; 3;:::g. • N0 = f0; 1; 2; 3;:::; g. • The notation [n] represents the set f1; 2; : : : ; ng for any n 2 N. • A definition defines a new term. • A theorem is a main result. • A lemma is a result used to build up to a theorem. • A corollary is an immediate result of a theorem or lemma. • A remark is a side comment or claim (usually unproven) that is interesting but usually not critical for the class.
    [Show full text]
  • Topics in Trivalent Graphs
    Topics in Trivalent Graphs Marijke van Gans January sssssssssssssssssssss sssssssssss ss s sss ssssssssss ssssss ss. .......s. .. .s .s sssssss ssssssss .s .... .. ........s.......................... ssssssss ssss ................ .s.. ...s ......... ssss ssss ........ ......... sss sssss ..... ..... ssss ssss.s .... ..... sssss sssss... ....s..... sssss ssss ..... .ssss sss.s . ....sssss ssss.................s .. .... sss ss ... .. .....s.. sss sss .. .. .. ssss ssss .. .. ......s........ sss ssss..s ..s .. ss sss ........... ........ .. .ssss sss ....s ......... ......... s. ...s ........s. ssss ssss .......... .... .......... .... sss ss ........s.......... .. .. ss ssss ...... .. ss ss......s.... .. sss ss....s... ..ssss ss..s.. .. ..s... s........ s sss.s. .... ................. sss ss .. ... .........s.. ss sss . ... .....sss s .. .. .sss s . .. ss s .. .. s s s..................s. s s . .. s s .. .. sss ss . ... sss sss .. .. .s....ss ss . ... .........ssss ss.ss .. ... ..........s.. s ss....s . ...s.......... ..... ssss sss...... .....sss sss.....s. .. .sss ss.. .....s . ss ssss............. .. .. ss ss.s.... .......s s.. ..s ssss ss ............. ......... ..................s..... ss ssss s.... ...... s........ .. ..sss ss......... ... .. sss ss..s .. .. ...s ssss sss .. .. ............sss ss ... .. .sssss sssss ...s. .. ..s.....sss ss.s...s............. ..s...sss ssss .s .. ..s..ssss sss......s ..s.. sssss ss..sss .... ..... sssss ssss ..... ..... ssss ssss .s... ....s sss ssssssss s............ ............. ssss ss.s..s....s...s..s
    [Show full text]
  • Hamiltonian Cycles in Triangle Graphs
    Hamiltonian Cycles in Triangle Graphs U Dogrusoz and M S Krishnamo orthy Tom Sawyer Software Hearst Avenue Berkeley CA ugurtomsawyercom Department of Computer Science Rensselaer Polytechnic Institute Troy NY mo orthycsrpiedu Abstract Weprove that the Hamiltonian cycle problem is NPcomplete for a class of planar graphs named triangle graphs that are closely related to innertriangul ated graphs We present a linear time heuristic algorithm that nds a solution at most onethird longer than the optimum solution and use it to obtain a fast rendering algorithm on triangular meshes in computer graphics Keywords Planar graph innertriangulatedgraph triangle graph NPcomplete heuristic algorithm rendering triangular meshes Intro duction The Hamiltonian cycle problem HC is that of determining whether or not a given graph contains a cycle that passes through every vertex exactly once and has numerous applications in dierent areas HC is NPcomplete for various classes of graphs including cubic connected planar graphs and maximal planar graphs and therefore for innertriangulations but a p olynomial time algorithm was presented for connected planar graphs by Chiba and Nishizeki The problem of nding a Hamiltonian cycle in an innertriangulation has applications in computer vision in determining the shap e of an ob ject represented by a cluster of p oints Cimikowski identied a Hamil tonian sub class of innertriangulations namely simply nested innertriangulations and presented a lineartime algorithm for nding a Hamiltonian cycle in suc h graphs
    [Show full text]
  • Cycle Bases of Graphs and Spanning Trees with Many Leaves
    Cycle Bases of Graphs and Spanning Trees with Many Leaves Complexity Results on Planar and Regular Graphs Von der Fakultät für Mathematik, Naturwissenschaften und Informatik der Brandenburgischen Technischen Universität Cottbus - Senftenberg zur Erlangung des akademischen Grades Doktor der Naturwissenschaften (Dr. rer. nat.) genehmigte Dissertation vorgelegt von Diplom-Mathematiker Alexander Reich geboren am 29.10.1982 in Lübben Gutachter: Prof. Dr. Ekkehard G. Köhler Gutachter: Prof. Dr. Rolf H. Möhring Gutachter: Prof. Dr. Romeo Rizzi Tag der mündlichen Prüfung: 15. April 2014 Abstract A cycle basis of a graph is a basis of its cycle space, the vector space which is spanned by the cycles of the graph. Practical applications for cycle bases are for example the optimization of periodic timetables, electrical engineering, and chemistry. Often, cycle bases belong to the input of algorithms concerning these fields. In these cases, the running time of the algorithm can depend on the size of the given cycle basis. In this thesis, we study the complexity of finding minimum cycle bases of several types on different graph classes. As a main result, we show that the problem of minimizing strictly fundamental cycle bases on planar graphs is -complete. We also give a similarly structured proof for problem of finding a maximumN P leaf spanning tree on the very restricted class of cubic planar graphs. Additionally, we show that this problem is -complete on k-regular graphs for odd k greater than 3. Furthermore, we classify typesAPX of robust cycle bases and study their relationship to fundamental cycle bases. Zusammenfassung Eine Kreisbasis eines Graphen ist eine Basis des Zyklenraumes des Graphen, also des Vektorraumes, der von den Kreisen des Graphen aufgespannt wird.
    [Show full text]