Matthias Dehmer Editor
Structural Analysis of Complex Networks
Editor Ao. Prof. Dr. habil. Matthias Dehmer Institute for Bioinformatics and Translational Research The Health and Life Sciences University UMIT-Private Universit¨at f¨ur Gesundheitswissenschaften Eduard Walln¨ofer-Zentrum 1 A-6060 Hall in Tirol, Austria and Institute of Discrete Mathematics and Geometry Vienna University of Technology Wiedner Hauptstrasse 8-10 A-1040 Vienna, Austria
ISBN 978-0-8176-4788-9 e-ISBN 978-0-8176-4789-6 DOI 10.1007/978-0-8176-4789-6 Springer Dordrecht Heidelberg London New York Library of Congress Control Number: 2010938359 Mathematics Subject Classification: 05C05, 05C12, 05C75, 05C80, 05C85, 05D40, 68R10, 90B10, 92E10, 94C15 c Springer Science+Business Media, LLC 2011 All rights reserved. This work may not be translated or copied in whole or in part without the written permission of the publisher (Springer ScienceCBusiness Media, LLC, 233 Spring Street, New York, NY 10013, USA), except for brief excerpts in connection with reviews or scholarly analysis. Use in connection with any form of information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed is forbidden. The use in this publication of trade names, trademarks, service marks, and similar terms, even if they are not identified as such, is not to be taken as an expression of opinion as to whether or not they are subject to proprietary rights. Printed on acid-free paper www.birkhauser-science.com
Preface
Because of the increasing complexity and growth of real-world networks, their analysis by using classical graph-theoretic methods is oftentimes a difficult procedure. Thus, there is a strong need to combine graph-theoretic methods with mathematical techniques from other scientific disciplines, such as machine learning, statistics, and information theory, for analyzing complex networks more adequately. The book Structural Analysis of Complex Networks presents theoretical as well as practice-oriented results for structurally exploring complex networks. Hence, the book does not only focus on classical graph-theoretical methods, it also shows the usefulness and potential of structural graph theory as a tool for solving interdisciplinary problems. Special emphasis is given to methods and areas which can be roughly summarized as follows: Graph-theoretical applications in, e.g., structural biology, computational biology,
mathematical chemistry, and computational linguistics; Graph classes; General structural properties of networks; Graph colorings; Graph polynomials; Information measures for graphs, e.g., graph entropies; Metrical properties of graphs; Partitions and decompositions; Quantitative graph measures.
This book is intended for an interdisciplinary audience, covering topics from artificial intelligence, computer science, computational and systems biology, cognitive science, computational linguistics, discrete mathematics, machine learning, mathematical chemistry, and statistics, and it contains nineteen chapters that have been peer-reviewed according to the standards of international journals in applied mathematics. The chapters and some of their interrelations can be briefly described as follows. Emmert-Streib starts the volume by surveying basic structural properties of complex networks, important graph classes, and graph measures used when performing network analysis quantitatively. The latter relates to determining the structural similarity between graphs and their structural complexity using entropic measures. v
vi
Preface
Further concepts used to explore networks structurally are provided by the next chapters authored by Borowiecki, Goddard et al., and Ananchuen et al. In particular, these chapters present techniques of graph partitioning, distances in graphs, and domination in graphs, respectively. The chapter written by Fujii also discusses entropy measures, but for infinite directed graphs. However, these measures are obtained by using operator theory and, hence, are differently defined than the ones presented in the chapter by Emmert-Streib; those are derived based on Shannon’s entropy and can be interpreted as the structural information content of a graph. Then, the chapters authored by Matsumoto, Kov´arˇ , and Breˇsar et al. investigate multifaceted problems, like exploring infinite labeled graphs to study presentations of symbolic dynamical systems, special graph decompositions, and the examination of geodetic sets in graphs, which represents an important problem using metrical properties of graphs. Ellis-Monaghan et al. provide two chapters in this volume on graph polynomials: The first one emphasizes the Tutte polynomial and some closely related graph polynomials. The second chapter by Ellis-Monaghan et al. sheds light on interpretations of concrete polynomials and on interrelations between other graph polynomials and the Tutte polynomial. The problem of reconstructing graphs by examining specific properties of polynomials, here, the zeros of Krawtchouk polynomials, is tackled in the next chapter by Stoll. Quantitative methods to calculate the structural similarity or distance between two graphs have already been mentioned in Emmert-Streib’s chapter. In particular, classical measures based on determining isomorphic subgraphs have already been mentioned there. The chapter written by Lauri treats the graph similarity problem in a similar manner, namely based on the number of common vertex-deleted subgraphs, and examines aspects of the computational complexity for calculating the mentioned graph similarity measure. The idea of defining structural distances between graphs is tackled in the next chapter, written by Benad´e. More precisely, a chromatic metric is defined, and, remarkably, by applying this metric, the maximum distance between any two graphs is at most three. The last six chapters of this volume use graph-theoretic techniques to solve challenging problems in, e.g., applied mathematics, computer science, quantum chemistry, electrical engineering, computational linguistics, structural biology and RNA structure analysis, computational biology, and mathematical chemistry. The chapter authored by Cioab˘a gives a broad overview on results for relating important structural properties of a graph to its eigenvalues. Also, Cioab˘a surveys important applications of graph spectra in subfields of the just-mentioned disciplines. To demonstrate the great potential of novel graph classes within computational linguistics, Mehler introduces a graph class consisting of hierarchical graphs called Minimum Spanning Markovian Trees and shows its usefulness by outlining concrete applications within semiotic network analysis. The chapter contributed by Scripps et al. starts by reviewing techniques to mine general complex networks, but mainly focuses on link-based classification, which often appears as an important problem in Web mining. The next two chapters, authored by Washietl et al. and Mason et al., explore graph-based problems in structural and computational biology, respectively. In particular, Washietl et al. investigate RNA structures represented by
Preface
vii
graphs and review graph-theoretical methods for describing and comparing such structures. A problem that is currently of considerable interest in biological network analysis is addressed by Mason et al. and deals with surveying methods for predicting protein function based on complex interaction networks. An area in which graph-theoretical models and techniques have been intensely applied so far is mathematical chemistry. The volume concludes by presenting a chapter about a graph class that is meaningful in mathematical chemistry: Vukiˇcevi´c presents techniques for determining the existence and enumeration of what are called perfect matchings that correspond to Kekul´e structures, which are well known in mathematical chemistry. Many colleagues, whether consciously or unconsciously, provided input, help, and support before and during the formation of this book. In particular, I would like to thank Hamid Arabnia, Alireza Ashrafi, Alexandru T. Balaban, Subhash Basak, Igor Bass, Agnieszka Bergel, David Bialy, Danail Bonchev, Stefan Borgert, Mieczysław Borowiecki, Monique Borusiak, Ulrike Brandt, Mathieu Dutour, Michael Drmota, Abdol-Hossein Esfahanian, Maria Fonoberova, Bernhard Gittenberger, Arno Homburg, J¨urgen Kilian, Elena Konstantinova, Reinhard Kutzelnigg, Dmitrii Lozovanu, Alexander Mehler, Tom´as Madaras, Abbe Mowshowitz, Marina Popovscaia, Fred Sobik, Stefan Shetschew, Doru Stefanescu, Thomas Stoll, Kurt Varmuza, Ilona Wesarg, Bohdan Zelinka, Dongxiao Zhu, and all authors and co-authors of this book. I apologize to any who inadvertently have not been named. I am deeply grateful to Armin Graber from UMIT for his strong support and for providing such a stimulating working atmosphere. Many thanks to Isabella Fritz, Bernd Haas, Gerd Lor¨unser, Brigitte Senn-Kircher, and Klaus Weinberger for their help and fruitful discussions. Moreover, I thank Frank Emmert-Streib for the extremely fruitful collaboration and many stimulating discussions we had over several years. Frank also provided the figures used to design the front cover of this book. In addition, I would like to thank editors Tom Grasso, Rebecca Biega, and Regina Gorenshteyn from Birkh¨auser Publishing (Boston), who have always been available and helpful. Last but not least, I would like to thank my wife Jana and my family — Marion Dehmer-Sehn and Werner Dehmer — for their unfailing support and encouragement. Finally, I hope that this book will help to extend the enthusiasm and joy that I feel for this field to others, and that it will inspire people to apply graph theory to different scientific areas for the solution of challenging and interdisciplinary problems. Hall in Tirol, April 2010
Matthias Dehmer
Contents
Preface .. . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . .
v
Contributors . . . . .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . xi 1
A Brief Introduction to Complex Networks and Their Analysis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . Frank Emmert-Streib
1
2
Partitions of Graphs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . 27 Mieczysław Borowiecki
3
Distance in Graphs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . 49 Wayne Goddard and Ortrud R. Oellermann
4
Domination in Graphs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . 73 Nawarat Ananchuen, Watcharaphong Ananchuen, and Michael D. Plummer
5
Spectrum and Entropy for Infinite Directed Graphs . . . .. . . . . . . . . . . . . . . . .105 Jun Ichi Fujii
6
Application of Infinite Labeled Graphs to Symbolic Dynamical Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . .137 Kengo Matsumoto
7
Decompositions and Factorizations of Complete Graphs .. . . . . . . . . . . . . . .169 Petr Kov´aˇr
8
Geodetic Sets in Graphs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . .197 Boˇstjan Breˇsar, Matjaˇz Kovˇse, and Aleksandra Tepeh
ix
x
Contents
9
Graph Polynomials and Their Applications I: The Tutte Polynomial . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . .219 Joanna A. Ellis-Monaghan and Criel Merino
10 Graph Polynomials and Their Applications II: Interrelations and Interpretations .. . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . .257 Joanna A. Ellis-Monaghan and Criel Merino 11 Reconstruction Problems for Graphs, Krawtchouk Polynomials, and Diophantine Equations . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . .293 Thomas Stoll 12 Subgraphs as a Measure of Similarity . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . .319 Josef Lauri 13 A Chromatic Metric on Graphs .. . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . .335 Gerhard Benad´e 14 Some Applications of Eigenvalues of Graphs . . . . . . . . . . . . .. . . . . . . . . . . . . . . . .357 Sebastian M. Cioab˘a 15 Minimum Spanning Markovian Trees: Introducing Context-Sensitivity into the Generation of Spanning Trees .. . . . . . . . . . . . .381 Alexander Mehler 16 Link-Based Network Mining . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . .403 Jerry Scripps, Ronald Nussbaum, Pang-Ning Tan, and Abdol-Hossein Esfahanian 17 Graph Representations and Algorithms in Computational Biology of RNA Secondary Structure . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . .421 Stefan Washietl and Tanja Gesell 18 Inference of Protein Function from the Structure of Interaction Networks .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . .439 Oliver Mason, Mark Verwoerd, and Peter Clifford 19 Applications of Perfect Matchings in Chemistry . . . . . . . . .. . . . . . . . . . . . . . . . .463 Damir Vukiˇcevi´c Index . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . .483
Contributors
Nawarat Ananchuen Department of Mathematics, Faculty of Science, Silpakorn University, Nakorn Pathom 73000, Thailand,
[email protected] Watcharaphong Ananchuen School of Liberal Arts, Sukhothai Thammathirat Open University, Nonthaburi 11120, Thailand,
[email protected] Gerhard Benad´e School of Computer Science, Statistics and Mathematics, North-West University, Potchefstroom, South Africa,
[email protected] Mieczysław Borowiecki Faculty of Mathematics, Computer Science and Econometrics, University of Zielona G´ora, Podg´orna 50, 65-246 Zielona G´ora, Poland,
[email protected] Boˇstjan Breˇsar Faculty of Natural Sciences and Mathematics, University of Maribor, Koroˇska 160, 2000 Maribor, Slovenia,
[email protected] Sebastian M. Cioabˇa Department of Mathematical Sciences, University of Delaware, 501 Ewing Hall, Newark, DE 19716-2553, USA,
[email protected] Peter Clifford Hamilton Institute, NUI Maynooth, Maynooth, Ireland,
[email protected] Joanna A. Ellis-Monaghan Department of Mathematics, Saint Michael’s College, One Winooski Park, Colchester, VT 05439, USA and Department of Mathematics and Statistics, University of Vermont, 16 Colchester Avenue, Burlington, VT 05405, USA,
[email protected] Frank Emmert-Streib Computational Biology and Machine Learning, Center for Cancer Research and Cell Biology, School of Medicine, Dentistry and Biomedical Sciences, Queen’s University Belfast, 97 Lisburn Road, Belfast BT9 7BL, UK,
[email protected] Abdol-Hossein Esfahanian Computer Science and Engineering Department, 3115 Engineering Building, Michigan State University, East Lansing, MI 48824-1226, USA,
[email protected]
xi
xii
Contributors
Jun Ichi Fujii Department of Arts and Sciences (Information Science), Osaka Kyoiku University, Asahigaoka, Kashiwara, Osaka 582-8582, Japan,
[email protected] Tanja Gesell Center for Integrative Bioinformatics Vienna, Max F. Perutz Laboratories, Dr. Bohr-Gasse 9, 1030 Vienna, Austria and University of Vienna, Medical University of Vienna, and University of Veterinary Medicine, Vienna, Austria,
[email protected] Wayne Goddard School of Computing and Department of Mathematical Sciences, Clemson University, Clemson, SC 29634-1906, USA,
[email protected] Petr Kov´arˇ Department of Applied Mathematics, Technical University Ostrava, 17. listopadu, 708 33 Ostrava–Poruba, Czech Republic,
[email protected] Matjaˇz Kovˇse Faculty of Natural Sciences and Mathematics, University of Maribor, Koroˇska 160 2000 Maribor, Slovenia
[email protected] Josef Lauri Department of Mathematics, University of Malta, Tal-Qroqq, Malta,
[email protected] Oliver Mason Hamilton Institute, NUI Maynooth, Maynooth, Ireland,
[email protected] Kengo Matsumoto Department of Mathematics, Joetsu University of Education, Joetsu 943-8512, Japan,
[email protected] Alexander Mehler Goethe-University Frankfurt am Main, Senckenberganlage 31, 60325 Frankfurt am Main, Germany,
[email protected] Criel Merino Instituto de Matem´aticas, Universidad Nacional Aut´onoma de M´exico, Area de la Investigaci´on Cient´ıfica, Circuito Exterior, C.U., Coyoac´an, 04510 M´exico D.F., M´exico,
[email protected] Ronald Nussbaum Computer Science and Engineering Department, 3115 Engineering Building, Michigan State University, East Lansing, MI 48824-1226, USA,
[email protected] Ortrud R. Oellermann Department of Mathematics and Statistics, University of Winnipeg, Winnipeg, MB R3B 2E9, Canada
[email protected] Michael D. Plummer Department of Mathematics, Vanderbilt University, Nashville, TN 37240, USA,
[email protected] Jerry Scripps School of Computing and Information Systems, 1 Campus Drive, Grand Valley State University, Allendale, MI 49401, USA,
[email protected] Thomas Stoll Faculty of Mathematics, School of Computer Science, University of Waterloo, Waterloo, ON, Canada,
[email protected]
Contributors
Pang-Ning Tan Computer Science and Engineering Department, 3115 Engineering Building, Michigan State University, East Lansing, MI 48824-1226, USA,
[email protected] Aleksandra Tepeh University of Maribor, FEECS, Smetanova 17, 2000 Maribor, Slovenia,
[email protected] Mark Verwoerd Hamilton Institute, NUI Maynooth, Maynooth, Ireland,
[email protected] Damir Vukiˇcevi´c Faculty of Mathematics and Natural Sciences, University of Split, Nikole Tesle 12, HR-21000 Split, Croatia,
[email protected] Stefan Washietl EMBL-European Bioinformatics Institute, Wellcome Trust Genome Campus, Hinxton, Cambridge CB10 1SD, UK and Institute for Theoretical Chemistry, University of Vienna, W¨ahringerstraße 17, A-1090 Vienna, Austria,
[email protected]
xiii
Chapter 1
A Brief Introduction to Complex Networks and Their Analysis Frank Emmert-Streib
Abstract In this chapter we present a brief introduction to complex networks and their analysis. We review important network classes and properties thereof as well as general analysis methods. The focus of this chapter is on the structural analysis of networks, however, information-theoretic methods are also discussed. Keywords Complex networks Centrality measures Comparative network analysis Module detection Information-theoretic measures MSC2000: Primary 05C90; Secondary 65C60, 46N60, 94A17
1.1 Introduction Discrete objects representing graphs have been studied for a long time. Among the first who studied graphs are Euler [56] and Cayley [30]. Interestingly, the origin of the term graph dates back to K¨onig in the 1930s [81], less than 100 years ago. The interest in graphs and their analysis is manifold. From a theoretical point of view the categorization and the analysis of properties of graphs [20, 44, 54, 70] as well as the development of graph algorithms [37, 57] are important problems that have been studied extensively. From an applied point of view it has been realized that graphs can represent physical [70], biological [51, 78, 101], or sociological objects [68, 104], e.g., a crystal or protein structure or the acquaintance network among a group of people. Recently, networks have been also employed in data analysis and machine learning [3, 51, 99]. In the following we use the terms graph and network interchangeably although they do not mean precisely the same thing. Usually,
F. Emmert-Streib () Computational Biology and Machine Learning, Center for Cancer Research and Cell Biology, School of Medicine, Dentistry and Biomedical Sciences, Queen’s University Belfast, 97 Lisburn Road, Belfast BT9 7BL, UK e-mail:
[email protected]
M. Dehmer (ed.), Structural Analysis of Complex Networks, c Springer Science+Business Media, LLC 2011 DOI 10.1007/978-0-8176-4789-6 1,
1
2
F. Emmert-Streib
a graph refers first of all to a mathematical object regardless of its realization in, e.g., nature, whereas a network represents a “real-world” object rather than a pure mathematical one. Because we want to focus on applied aspects of graphs most of the time we prefer the expression network. In this chapter we provide a brief introduction to complex networks and their analysis. In Sect. 1.2 we review some important network classes. In Sect. 1.3 we present some methods for the structural analysis of networks that help, e.g., to characterize them as a whole or allow us to identify specific nodes in the network with certain properties. In Sect. 1.3.5 we present important methods to analyze networks comparatively. This means that means these measures always compare two graphs with each other and provide, hence, similarity or dissimilarity measures for this comparison. Such methods are especially useful for data analysis or machine learning because they allow a combination with, e.g., clustering methods to extract regularities from the obtained, e.g., similarity values for corpora of networks. Section 1.3.6 presents a method for the identification of community or module structure of networks as important, e.g., for the analysis of communication networks. In Sect. 1.4 we discuss information-theoretic measures and this chapter finishes in Sect. 1.5 with a short summary and conclusions.
1.2 Important Network Classes We begin this chapter by reviewing well-known network classes. In the following we mainly restrict ourselves to undirected unweighted networks, however, most of the presented networks can be generalized easily.
1.2.1 Simple Networks A simple network consists of regular connections among the nodes. One of the most prominent examples therefore is the two-dimensional lattice as shown in Fig. 1.1. Here each node is connected to its nearest neighbors. Despite its simplicity, such networks have been used extensively, e.g., in physics to study phenomena like ferromagnetism with the Ising model [32]. Other examples of this class are linear chains or nonrectangular lattices as used, e.g., in the context of protein structure prediction to model protein folding [74].
1.2.2 Random Networks Random networks have been extensively studied by Erd¨os and R´enyi [54, 55]. A random graph with N nodes is obtained by connecting every pair of nodes with
1
A Brief Introduction to Complex Networks and Their Analysis
3
Fig. 1.1 Left: Regular two-dimensional lattice. Right: Linear, regular chain
probability p. The expected number of edges for a (undirected) network constructed this way is E.N / D p
N.N 1/ : 2
(1.1)
1.2.3 Degree Distribution The degree distribution of a node i in a random network is binomial ! N 1 k P .ki D k/ D p .1 p/N 1k ; k
(1.2)
because the maximal degree of node i is N 1, the probability that the vertex has k links is p k .1 p/N 1k and there are Nk1 possibilities to choose k links from N 1 nodes. In the limit N ! 1 (1.2) becomes P .ki D k/ D
zk exp.z/ : kŠ
(1.3)
Here z D p.N 1/ is the expected number of links for a node. This means that the degree distribution of a node in a random network can be approximated by the Poisson distribution for large N . For this reason random networks are also called Poisson random networks [96]. Furthermore one can show that the degree distribution of a random network (instead of just a node) also approximately follows a Poisson distribution P .Xk D r/ D
zr exp.z/ ; rŠ
meaning that there are Xk D r nodes in the network having degree k [2].
(1.4)
4
F. Emmert-Streib
1.2.4 Clustering Coefficient In general the clustering coefficient of a node i is defined as the fraction Ei of existing connections among its ki nearest neighbors divided by the total number of possible connections, Ci D
2Ei : ki .ki 1/
(1.5)
This corresponds to the probability that two nearest neighbors of i are connected with each other. However, the probability in a random graph that two nodes are connected with each other is Ci D p. This can be approximated by Ci
z ; N
(1.6)
because the mean degree of a node is z D p.N 1/ pN .
1.2.5 Small-World Networks Small-world networks were introduced by Watts and Strogatz [115]. They can be obtained via the following algorithm. First, arrange all nodes on a ring and connect each node with its k=2 nearest neighbors. Second, start with an arbitrary node i and rewire its connection to its nearest neighbor on, e.g., the left side with probability prw to any other node j in the network. If node i and j are already connected reject this selection and change nothing. Then choose the next node in the ring in a, e.g., clockwise direction and repeat this procedure. Third, after all next neighbor connections have been checked repeat this procedure for the second and all higher next neighbors successively. This algorithm guarantees that each connection occurring in the network is chosen exactly once to test for a rewiring with probability prw . The rewiring probability prw controls the disorder of the resulting topology. For prw D 0 the regular topology is conserved, whereas prw D 1:0 leads to a random network. Intermediate values 0 < prw < 1 give a topological structure that is between regular and random.
1.2.6 Scale-Free Networks Neither random nor small-world networks have a property frequently observed in real-world networks, namely a scale-free behavior of the degrees P .k/ k :
(1.7)
1
A Brief Introduction to Complex Networks and Their Analysis
5
which means that there is no “top” or “bottom” 1: t D 0 2: Start with N0 unconnected nodes 3: repeat 4: Add one new node to the existing network consisting thus far of Nt nodes. 5: Connect the new node to e ( N0 ) nodes from the existing network. A node is chosen based on the degree distribution of the node, ki pi D P j
kj
;
6: t Dt C1 7: Nt D Nt1 C 1 8: until Nt D N
Algorithm 1.1: Generation of a scale-free network (preferential attachment)
To explain this feature Barabasi and Albert introduced a model [4] now known as the Barabasi–Albert (BA) or preferential attachment model [96] that results in socalled scale-free networks which have a degree distribution following a power law [4]. The major difference between the preferential attachment model and the other algorithms described above to generate random or small-world networks is that the preferential attachment model does not assume a fixed number of nodes N and then start to rewire them with fixed probability with other nodes but N grows and is connected with a certain probability (is not constant) to other nodes depending on their degree. In Algorithm 1.1 we provide a principle algorithm to generate a scale-free network.
1.2.7 Trees A graph G is a tree if it has no loops (cycles) in G. This means that a tree is an acyclic graph. Alternatively, upon removal of an edge a connected tree becomes unconnected. Trees were first studied by Cayley [30, 31] and are, in addition to their importance for graph theory, an important data structure in computer science which appears in many different algorithms. Figure 1.2 shows two trees. We want to emphasize that a tree does not represent a hierarchy, in the graph of a tree. This is in contrast to rooted trees. A rooted tree is obtained, e.g., from a tree by the identification of a so-called root node which forms the start of a hierarchy. In Fig. 1.3 we show two rooted trees obtained from the tree on the right-hand side of Fig. 1.2. The important difference is that rooted trees are ordered; they have a “top” corresponding to the root node and a “bottom” corresponding to the leaf nodes having no children. It is interesting to note that there is no restriction to the degree a node can have. Apparently, the minimal number is one because otherwise
6
F. Emmert-Streib
Fig. 1.2 Trees
Fig. 1.3 Rooted trees obtained from the tree on the right-hand side in Fig. 1.2. Left: Root node is the third node from the top. Right: Root node is the leftmost node at the top Fig. 1.4 Rooted binary trees
the tree would be unconnected, however, other than that it is arbitrary. This brings us to the next subclass of trees, rooted binary trees. A special case of a rooted tree is a rooted binary tree. A node in a binary tree has at most two children. Figure 1.4 shows two examples of rooted binary trees, frequently just called binary trees. In Fig. 1.4 one can see that a node has at most two children (maximal degree of a node is three). Intermediate nodes can have only one child. This holds also for the root nodes as the right figure shows. Finally, we want to mention that a disjoint union of trees is called a forest.
1.2.8 Generalized Trees The graph class of directed generalized trees was introduced in [39,90]. Generalized trees are an important extension to trees maintaining their characteristic of having a hierarchy but in addition allowing a richer connectivity among nodes. Before we provide a formal definition we give a motivation for their introduction visualized by Fig. 1.5. On the left side in Fig. 1.5, a (normal) tree is shown. The dotted horizontal lines should remind the reader that a tree is a hierarchical graph and the dotted lines explicitly represent the hierarchy levels. These lines are included for didactic reasons only and are not actually part of the tree. On the right-hand side of Fig. 1.5 a generalized tree is shown obtained from the tree on the left side by including two additional edges, labeled E2 and E3 . In general, edges that connect nodes on the
1
A Brief Introduction to Complex Networks and Their Analysis
7
E3
E2
Fig. 1.5 Left: Tree. Right: Generalized tree
same hierarchical level are of type E2 and edges that connect nodes on different hierarchical levels that are farther apart than one level are of type E3 (formally defined below). From this, we note that every generalized tree will result in a tree after deleting all edges of type E2 and E3 from the generalized tree. Vice versa, starting from a tree and including edges of type E2 and/or type E3 results in a generalized tree. A formal definition is given as follows [50]. Definition 1 (Generalized Tree). A generalized tree GTi is defined by a vertex set V , an edge set E, a level set L, and a multilevel function Li . The vertex and edge set define the connectivity and the level set and the multilevel function induce a hierarchy between the nodes of GTi . The index i 2 V indicates the root. The multilevel function is defined as follows. Definition 2 (Multilevel Function). The function Li W V n fi g ! L is called a multilevel function. The multilevel function Li assigns to all nodes except i an element l 2 L that corresponds to the level it will be assigned. From these definitions it is immediately clear that a generalized tree is similar to a graph but additionally equipped with a level set L and a multilevel function Li introducing a node grouping corresponding to the introduction of a hierarchy between nodes and sets thereof. Definition 3 (Edge Types). A generalized tree GTi has three edge types: Edges with jLi .m/ Li .n/j D 1 are called kernel edges (E1 ). Edges with jLi .m/ Li .n/j D 0 are called cross edges (E2 ). Edges with jLi .m/ Li .n/j > 1 are called up edges (E3 ).
We want to remark that for directed generalized trees edge type E3 will be split into two edge types: one for up and another for down links. Using Definition 1 a tree is characterized by jLi .m/ Li .n/j D 1 for all node pairs .m; n/. From the given definitions and the visualization in Fig. 1.5 it is apparent that a generalized tree is between a tree and a graph. It is hierarchical like a tree, but can contain cycles like a graph which is not hierarchical.
8
F. Emmert-Streib
1.3 Structural Network Analysis In this section, we summarize measures to characterize structural properties of networks.
1.3.1 Degree Distribution Degree distributions [16, 88] can be calculated by P .k/ WD
jık .v/j ; N
(1.8)
where jık .v/j denotes the number of vertices in the network G of degree k and N denotes the size of G (number of nodes). Equation (1.8) is just the proportion of vertices in G having degree k. The degree ki of node i is the number of links connected with node i . From this, it follows that (1.8) also has the meaning that a randomly chosen node in the network has, with probability P .k/, k links to other nodes. It was an interesting and important finding that many real world networks like the World Wide Web (WWW), the Internet, social networks, citation networks, or food webs [1, 16, 19, 22, 29, 42] are not Poisson distributed but follow a power law P .k/ k ;
> 1:
(1.9)
1.3.2 Clustering Coefficient The clustering coefficient Ci is a local measure defined for every node i . It is defined as the fraction of connections (Ei ) between nearest neighbors of i among each other divided by the maximum number of such connections Ci D
2Ei : ki .ki 1/
(1.10)
The clustering coefficient can be interpreted as the probability that two nearest neighbors of i are connected with each other.
1.3.3 Path-Based Measures Graph-theoretical quantities or properties are often used to characterize special types or classes of complex networks. For example, it turned out that average path lengths
1
A Brief Introduction to Complex Networks and Their Analysis
9
and diameters of certain biological networks are rather small compared to the size of a network [86, 88, 98]. Related to this is the so-called “small-world” property [115] that has been observed in a number of network types, e.g., social, metabolic, and protein interaction networks in molecular biology [86, 88, 98]. We give a brief overview of path-based network measures [17, 21, 23, 67, 71, 107].
Distance Matrix .d.vi ; vj //vi ;vj 2V . d.vi ; vj / denotes the shortest distance (path) between vi and vj measured in the number of edges or nodes that are between start node vi and end node vj .
Mean or Characteristic Distance 1 dN .G/ WD N 2
X
d.vi ; vj /:
(1.11)
vi ¤vj 2V
E is the total number of edges in the network. j -Sphere The set Sj .vi ; G/ WD fv 2 V j d.vi ; v/ D j; j 1g;
(1.12)
is called the j -sphere of vi regarding G. Starting from vi , the cardinality jSj .vi ; G/j denotes the number of vertices that have a shortest distance equal to j .
Eccentricity, Diameter, and Radius Let G D .V; E/ be a graph. Then, .v/ D max d.u; v/; u2V
(1.13)
is called the eccentricity of v 2 V . .G/ D max .v/;
(1.14)
r.G/ D min .v/;
(1.15)
v2V
and v2V
are called the diameter and radius of G, respectively.
10
F. Emmert-Streib
Degree, Degree Statistics, and Edge Density P For undirected graphs G D .V; E/, kv D i Av;vi equals the number of edges which are adjacent to v 2 V . kv is called the degree of node v. From this, one obtains straightforwardly the following degree measures for the whole network: k D k.G/ WD
X kv v2V
k .G/ WD
N
;
(1.16)
1 X .kv k/2 ; N 1
(1.17)
1 X jkv kj: N
(1.18)
v2V
and k .G/ WD
v2V
Equation (1.16) is the mean degree of the network, (1.17) is the variance of the degree, and (1.18) is the mean of absolute distances between kv and k. Finally, the edge density of G is defined as E ˇ.G/ WD N :
(1.19)
2
Further network statistics and advanced aspects can be found in, e.g., [21, 67, 71, 107].
1.3.4 Centrality Measures Identifying important vertices in networks is an interesting problem that has gained much attention especially in the context of communication networks. For example, the communication among a group of humans forms a communication network. Social scientists in the late 1940s developed graph-theoretical measures to detect important vertices in networks. An important class of such measures is based on the centrality concept [66, 69, 114] which intuitively tries to identify nodes that are central to the communication within the network among all nodes. There are two fundamentally different types of centrality measures [58, 59]. The first type of measures evaluates the centrality of each node in a network and is called point centrality measures where the word “point” refers to a node or vertex. The second type is called graph centrality measures because it assigns a centrality value to the whole network.
1
A Brief Introduction to Complex Networks and Their Analysis
11
Point Centrality In the following we provide some examples of point centrality measures. Degree Centrality For an undirected graph G D .V; E/, the degree centrality of a vertex v 2 V is simply defined as its degree; i.e., CD .v/ D kv :
(1.20)
For a directed network, the degree centrality can be analogously defined by using the definition of in-degree and out-degree. Betweenness Centrality The centrality index betweenness is based on shortest paths found in the network [5, 6, 18, 58, 66, 83, 88, 103, 104, 114] and is defined by CB .vk / D
X
vi vj .vk /
vi ;vj 2V;vi ¤vj
vi vj
:
(1.21)
Here vi vj denotes the number of shortest paths from vi to vj and vi vj .vk / the number of shortest paths from vi to vj that include node vk . That means vi vj .vk / vi vj
;
(1.22)
is the probability that node vk lies on a shortest path connecting vi with vj . Hence, CB .vk / evaluates the appearance of node vk on all shortest paths in a network. Closeness Centrality The centrality index closeness tries to measure how close a node is to other nodes in the network. This is done in terms of communication distance as measured by the number of edges between two nodes if connected via the shortest path. CC .vk / D PN
i D1
1 d.vk ; vi /
:
(1.23)
Here d.vk ; vi / is the number of edges on a shortest path between node vk and vi . In the case where there are multiple shortest paths connecting vk with vi , d.vk ; vi / is unchanged.
12
F. Emmert-Streib
Graph Centrality To evaluate the centrality of whole networks instead of single nodes in the network graph centrality measures have been suggested which form extensions to the three measures discussed above [59]. The basic idea is to use these individual measures to obtain an average characteristic for the whole network. It has been suggested to calculate Cx D
PN
m i D1 Cx .v / max Cx
Cx .vi /
:
(1.24)
Here x stands for any of the three point centrality measures, Cx .vm / D maxfCx .vi /g; i
(1.25)
for the maximal value of Cx .vi / that can be found in the network and Cxmax for the maximal value possible for a network with N nodes, Cxmax D max
G2G.N /
N X
Cx .vm / Cx .vi /:
(1.26)
i D1
Degree Centrality For the degree centrality of a network one obtains Cd D
PN
m i D1 Cd .v / Cd .vi / : 2 N 3N C 2
(1.27)
Intuitively, the denominator is obtained by remembering that the maximal degree of a node is N 1, hence, Cx .vm / Cx .vi / D N 2 because the minimal degree is one. This number multiplied by N 1 (one node needs to have degree one) gives the denominator in (1.27).
Betweenness Centrality For the betweenness centrality of a network [58] one obtains Cb D
PN
m i D1 Cd .v / Cd .vi / : 3 2 N 4N C 5N 2
(1.28)
1
A Brief Introduction to Complex Networks and Their Analysis
13
Closeness Centrality For the closeness centrality of a network one obtains X 2N 3 Cd .vm / Cd .vi /: N 3 4N 2 C 5N 2 N
Cc D
(1.29)
i D1
Extended Centrality Measures In addition to the classical centrality measures described above there are many extensions. Here we present some of these.
Eigenvector Centrality The eigenvector centrality, a point centrality measure, was introduced by Bonacich [15]. The key idea of eigenvector centrality is to express that an important vertex is connected to important neighbors. To define the eigenvector centrality measures one needs to find the eigenvector of the adjacency matrix A of graph G with the largest eigenvalue. Then eigenvector centrality is given by Ce D x m D
1 Ax m : m
(1.30)
Here m is the largest eigenvalue and x m the corresponding eigenvector solving the equation m x m D Ax m : (1.31) Hence Ce is the principle eigenvector of A. We want to emphasize that eigenvector centrality is a point centrality measure because each vertex in the network obtains a value corresponding to the component of Ce . In [83], advanced properties and further possibilities to compute eigenvector centrality measures are presented.
Joint Betweenness Centrality The centrality measures discussed above, including betweenness, form a family of measures [58] that have been introduced with the purpose of analyzing communication networks. It is interesting to note that all point centrality measures focus solely on one vertex in the network. In the context of gene networks, which also form communication networks, the identification of a function of genes is an outstanding problem. It has been suggested to identify the unknown function of a gene by associating it with the known function of another gene. Because all measures from
14
F. Emmert-Streib
the centrality family are point measures they cannot be used for such studies. For this reason it has been suggested that an extension involving more than one node be called joint betweenness (JB) [47]. JB is a natural extension of the betweenness centrality evaluating the joint occurrence of two nodes on shortest communication paths in the network. Formally, it is defined as Cjb .vm ; vn / D
X vi ;vj 2V;vi ¤vj
vi ;vj .vm ; vn / : vi ;vj
(1.32)
Here vi ;vj is the number of shortest paths connecting node vi with node vj and vi ;vj .vm ; vn / is the number of shortest paths connecting vi with vj that contain the nodes vm and vn . Similar to other measures of the centrality family, it is sometimes more useful to use a different normalization. In fact, for the analysis conducted in [47] the following modification has been used, Cjb .vm ; vn / D
X vi ;vj 2V;vi ¤vj
vi ;vj .vm ; vn / : max
(1.33)
Here max is defined as max D maxfvi ;vj g: vi ;vj
(1.34)
1.3.5 Comparative Network Analysis In this section measures structurally comparing whole networks are reviewed.
Measures Based on Isomorphic Relations Classical graph similarity or distance methods deal with finding appropriate measures which are based on isomorphic and subgraph relations [75–77, 108, 109, 117]. A prominent example of such a measure is the Zelinka-distance [117], where this graph distance is based on the principle that two graphs are more similar, the bigger the common induced isomorphic subgraph is. First, Zelinka introduced this measure for unlabeled graphs with the same number of vertices. Later, Sobik [108, 109] and Kaden [75–77] generalized this measure for arbitrary graphs allowing them to have even different order. It is known that the subgraph isomorphism problem is NP-complete [113]. This implies for large graphs that these methods can be computationally demanding. A key result for exact graph matching was found by Zelinka [117].
1
A Brief Introduction to Complex Networks and Their Analysis
15
Theorem 1. Let G, GQ be unlabeled graphs without loops and multiple edges. Further, let jV j D jVQ j D n: S UB m .G/ denotes the set of induced subgraphs of order m. G ? denotes the isomorphism classes of such graphs in which G lies and let SUBm .G/ WD fG ? j G 2 S UB m .G/g:
(1.35)
SUBm .G/ is just the set of isomorphism classes in which the induced subgraphs of G with order m lie. Then, Q WD n SIM.G; G/; Q dZ .G; G/
(1.36)
Q 6D ;g; Q WD maxfmjSUBm .G/ \ SUBm .G/ SIM.G; G/
(1.37)
is a graph metric, where
holds. Sobik [108,109] and Kaden [75–77] generalized this theorem by considering labeled graphs with a different number of vertices. Theorem 2. Let G WD .V; E; fV ; fE ; AV ; AE / be a finite, labeled, and directed graph. AV ; AE denote finite, nonempty vertex and edge alphabets and fV W V ! AV , fE W E ! AE the associated vertex and edge labeling functions. Now, let G and GQ be finite labeled graphs of arbitrary orders. Then, Q WD max fjGj; jGjg Q SIM.G; G/; Q dS .G; G/
(1.38)
is a graph metric. Another classical graph distance measure based on the maximum common subgraph of two graphs has been found by Bunke et al. [25, 26, 28]. Theorem 3. Let G and GQ be graphs and let GMCS be their maximum common subgraph. Then, the distance measure Q WD 1 dMCS .G; G/
jV jMCS max.jV j; jVQ j/
;
(1.39)
is a graph metric.
Measures Based on Graph Transformations In contrast to graph similarity measures from the exact graph matching paradigm, i.e., those based on isomorphic relations, a well-known class of graph similarity measures from inexact graph matching is based on graph transformations. The main idea behind this concept is not to match graphs exactly because one often wants to
16
F. Emmert-Streib
take structural errors of the underlying graphs into account. Therefore, this concept is often referred to as error-tolerant graph matching [25, 26, 28, 91]. For example, the so-called graph edit distance (GED) [24, 27, 28, 91] is a prominent example of such a graph similarity measure. The definition of GED is based on weighted transformation steps, e.g., deletions, substitutions, and insertions of vertices and edges, and, hence, the distance of two graphs is defined as the minimum cost of graph transformations that transform (map) one graph into another graph. The key result of error-tolerant graph matching, originally stated by Bunke [24], can be expressed as follows. Q be the costs for determining the optimal inexact match Theorem 4. Let d.G; G/ between G and GQ where an optimal inexact match is a sequence of graph transformations that transforms a graph G to GQ by producing minimal edit costs. Then, it Q is a graph metric. holds that d.G; G/ Regarding the computational complexity of GED, we want to remark that for unlabeled graphs there is no algorithm to compute GED efficiently [28, 91, 118]. For uniquely labeled graphs, it has been proven [43] that the computational complexity to compute GED is O.jV j2 /.
Measures Based on Graph Grammars Methods to determine the similarity or distance between graphs based on graph grammars also belong to the paradigm of inexact graph matching. A classical contribution in this field has been made by Gernert [63, 64]. We want to note that the application of grammar-based measures is complex because the underlying graph grammar is quite often difficult to obtain.
Methods Based on Machine Learning Techniques Machine learning techniques can be divided into two major categories: supervised and unsupervised learning methods [38,72]. A newly developed supervised learning method, based on support vector machines [38], to measure the structural similarity of graphs is based on using so-called graph kernels [62, 73]. A graph kernel is a function K W G G ! IR, for G 2 G, that maps the data implicitly into a high-dimensional feature space. For example, some graph kernels are based on the principle to determine the frequency of certain subgraph patterns of the given graph set and then to apply a proper kernel function to the obtained subgraphs. Following this principle Horv´ath et al. [73] proposed a graph kernel that is based on mapping graphs into cyclic graph patterns. Besides cycle-based graph kernels, so-called random-walk-based kernels [62,80] are also often used to define graph kernels [36]. Another method to detect the structural similarity of graphs is based on dynamic programming [7]. In the following we just give an outline of the main construction
1
A Brief Introduction to Complex Networks and Their Analysis
17
steps of this similarity measuring for directed generalized trees (the generalization to networks can be found in [49]). 1. Transform the generalized trees in linear structures, called property strings 2. Derive similarity scores from the alignments of the property strings in order to measure the structural similarity of generalized trees This means that we transform a graph similarity problem into a string similarity problem to develop an efficient graph similarity measure. More precisely, the main idea of our similarity measure is based on the derivation of property strings for each generalized tree and then to align the property strings by a dynamic programming technique [7]. We call these strings property strings because their components represent structural properties of the generalized trees. From the resulting alignment we obtain a value of the scoring function which is minimized during the alignment process. The similarity of two generalized trees is then given as the cumulation of local similarity functions which weight two alignment types: out-degree and in-degree alignments on a generalized tree level. Let HO 1 and HO 2 be generalized trees. Then the problem of determining the structural similarity between HO 1 and HO 2 is equivalent to finding the optimal alignment of the property strings. The key result is given in the following theorem by Dehmer [39]. Theorem 5. Let HO 1 ; HO 2 be generalized trees, 0 i ; WD max.h1 ; h2 /: d1 .HO 1 ; HO 2 / WD d2 .HO 1 ; HO 2 / WD d3 .HO l 1; HO 2 / WD
P
i fin .i / P ; i D0 i
(1.40)
fin .i / ; C1
(1.41)
fin i D0 .i / ; d2 .HO 1 ; HO 2 /
(1.42)
i D0
P
i D0
Q
is a family .di .HO 1 ; HO 2 //1i 3 of backward similarity measures, where f i n .i / is the weighted sum of the in- and out-degree alignments. Further it holds that .di .HO 1 ; HO 2 //1i 3 2 Œ0; 1. Here di .HO 1 ; HO 2 / are different similarity measures that allow us to emphasize different structural aspects of the networks. We just note that this method can be generalized to labeled generalized trees [39] and even networks [49].
1.3.6 Community or Module Detection A community or a module of a network corresponds to a subgraph. Examples of modules are social groups [65, 116], pathways in molecular biological processes [46], or domains in proteins [53]. In the following we present results based on
18
F. Emmert-Streib
Newman and Girvan [97] who introduced not only a measure (Q) to quantify modules in a network but also suggested an algorithm to find them. Let A be the adjacency matrix of network G and ( Aij D
1 if i is directly connected to j 0 otherwise:
(1.43)
We suppose that the set of vertices is partitioned in S communities and that vertex i belongs to community ck if ı.ck ; i / D 1, with ı.i; j / being the Kronecker delta which is one if i D j and zero otherwise. The degree of a node is given by ki D
X
Aij :
(1.44)
j
The modularity Q, introduced by Newman and Girvan [97], of a network is now defined by 1 X ki kj QD ı.ci ; cj / : Aij (1.45) 2E 2E i;j
Q evaluates the difference between the fraction of edges found within communities minus the fraction of edges found by random connections (see also (1.49)). The modularity (1.45) can be written in an alternative form by introducing eij D
1 X Amn ı.cm ; i /ı.cn ; j / 2E mn
(1.46)
ai D
1 X km ı.cm ; i /: 2E m
(1.47)
Equation (1.46) corresponds to the fraction of edges that connect community i with community j . For an undirected network G, eij D eji holds. Equation (1.47) is the fraction of edges that is connected to nodes in community i . Utilizing (1.46) and (1.47) and X ı.cm ; cn / D ı.cm ; i /ı.cn ; i /; (1.48) i
gives QD Because ai D also write
P j
X eii ai2 :
(1.49)
i
eij (eii counts the connections within community i ) [97] we can QD
X i
eii
X
emi ein D Tr e jje2 jj:
imn
Here the norm corresponds to the sum of the matrix elements.
(1.50)
1
A Brief Introduction to Complex Networks and Their Analysis
19
For a given network G the task of finding communities or modules corresponds to finding a partitioning of the set of vertices of the network that maximizes the modularity Q. Exhaustive enumeration is prohibitive for most networks because the number of partitions N nodes can be distributed among M nonempty commuM nities is given by the Stirling number of the second kind SN [97]. For example, for 20 46 N D 100 and M D 3 there are already S1;000 D 8:5 10 possibilities to partition the network. Because testing all partitions exhaustively is not possible we need to find the communities via an optimization algorithm. It is clear that there are various ways to define optimization algorithms for this task. In this chapter we present just one simple algorithm suggested by Newman and Girvan [97] that can be applied even for large networks consisting of tens of thousands of nodes. This algorithm performs a greedy optimization at each step and is shown in Algorithm 1.2. Starting from a configuration where each node forms a community the algorithm proceeds by merging at each step two communities that result in the largest change of Q. Because Q can also be negative this results not only in an increase of Qt C1 . The optimal partition is now obtained by finding the maximum of all Qt . This also gives the level at which the dendrogram should be cut. This cut will then give the optimal partitions of the vertices of the network. The advantage of the algorithm is that it is not necessary to calculate Qt C1 anew at each step. It is possible to calculate Q instead by Q D 2.emn am an /:
(1.51)
Equation (1.51) can be obtained by the identities
1: 2: 3: 4: 5: 6: 7: 8: 9: 10: 11: 12:
eii0 D emn C enn C emn C enm
(1.52)
ai0 D am C an :
(1.53)
t D0 Start with M D N communities fc1 ; : : : ; cN g (each node is a community) Calculate Q Qt D Q repeat Calculate Q.ci ; cj / for all communities Merge community cm with cn if Q.cm ; cn / D maxi;j fQ.ci ; cj /g QtC1 D Qt C Q t Dt C1 M DN t until M D 1 Q D maxt Qt
Algorithm 1.2: Agglomerative clustering of communities [97]
20
F. Emmert-Streib
We use the prime (0 ) as an abbreviation for the values of e at step t C 1 and i symbolizes the newly formed community merging communities m and n. The update of the new e0 matrix is completed by eik0 D emk C enk
(1.54)
eki0 D eik ;
(1.55)
for k 6D i . We want to emphasize that Q can be calculated by just evaluating (1.52) and (1.53). The new complete matrix e0 will only be calculated once after the decision to merge community m with n has been made. The overall time complexity of this algorithm is O.N 2 / [97] and, hence, applicable to large networks. Finding communities or modules in complex networks has attracted much attention because of the importance of the problem for many scientific fields. For this reason the algorithm presented above is just one approach to this problem. The interested reader is referred to [33, 45, 97, 98] for more algorithms.
1.4 Information-Theoretic Methods In many scientific areas, e.g., biology, chemistry, linguistics, and physics, it is known that the underlying system can be described or represented as an interaction network among its components [12, 89]. Such networks, e.g., protein–protein, signaling, reaction, or metabolic networks, have been intensely investigated, especially in computer science, computational biology, and computational chemistry [12, 35, 46, 61, 111]. Once a network is theoretically or experimentally inferred, existing methods from quantitative network analysis are basically applicable for investigating such networks structurally as described in the proceeding sections. A different approach to analyzing complex networks can be obtained by combining methods from information theory and statistics. Particularly, it turns out that information-theoretic methods, e.g., entropy-based methods, are powerful tools to investigate complex networks [9, 12, 34, 84, 85, 105, 110]. Here we give just a brief summary of information-theoretic and statistical methods to analyze or compare networks: Classical information measures, e.g., entropy, conditional entropy, and mutual
information applied to complex networks [8, 9, 11–14, 60, 79, 105, 110] Entropic measures for characterizing graph classes, e.g., perfect graphs [82, 106] Compression-based module identification [102] Information-theoretic measures to determine the structural information content
of a network [9, 40, 41, 92–95, 100, 112] Complexity measures for networks based on Kolmogorov complexity [10,11,87] Information-theoretic measures of robustness of complex (gene) networks
[48, 52]
1
A Brief Introduction to Complex Networks and Their Analysis
21
If we assume that N denotes the number of vertices of a graph G, n denotes the number of different (obtained) sets of vertices, jNi j is the number of elements in the i th set of vertices, and we set Pi D NNi , then Shannon’s entropy formula can be stated as [11] n X It .G/ D N log.N / Ni log.Ni /; (1.56) i D1
or Im .G/ D
n X
Pi log.Pi /:
(1.57)
i D1
Equation (1.56) represents the total information and (1.57) the mean information content of G. From (1.56) and (1.57) we see that there are no free parameters because the quantities Pi are completely determined by the chosen partitioning [41]. This can be a problem if such an entropy measure should be used to analyze networks obtained, e.g., from an experiment for which expert knowledge is available regarding possible outcomes. For this reason, Dehmer [40, 41] introduces a parametric entropy measure If V .G/ WD
N X
f V .vi /
PN
f V .vi /
log PN
! ;
(1.58)
f V .vi / WD ˛ c1 jS1 .vi ;G/jCc2 jS2 .vi ;G/jCCc.G/jS.G/ .vi ;G/j ; ck > 0; 1 k .G/; ˛ > 0:
(1.59)
i D1
j D1
f V .vj /
j D1
f V .vj /
where
Here, jSj .vi ; G/j denotes the cardinality of a j -sphere (see Sect. 1.3.3) of vi regarding an undirected and connected graph G. f V .vi / represents a so-called information functional that is based on metrical graph properties (see [107] for details). Equation (1.58) represents a family of parametric entropy measures. We generalized the classical entropy measure [41], i.e., (1.56) and (1.57), because the new measure allows us to weight structural characteristics of a graph by adapting the free parameters ˛ and ck correspondingly. As a corollary we note that it is now possible to analyze the spread of information within a network.
1.5 Conclusions We finish this chapter by pointing out that there are many more approaches for the analysis of complex networks. Depending on the point of view, especially in the context of machine learning problems, only some methods give meaningful results with respect to certain applications. For this reason it is of the utmost importance to
22
F. Emmert-Streib
demonstrate that a chosen approach is appropriate to solve a task by application to a test dataset for which the performance can be evaluated objectively. That means, it is important to bear in mind that the characteristics of the investigated networks have a profound impact on the obtained results. Due to the fact that it is often difficult or even impossible to imagine all possibilities of network characteristics to properly take them into account when deriving a method, such an application is not of mere practical interest but also provides valuable feedback for the design of methods because the analysis of the data relentlessly reveals shortcomings of the method itself. Hence, the design and application of such methods are connected imperatively. For this reason it is no surprise that fields like computational biology, web mining, computational linguistics, quantitative finance, or sociology have triggered a wealth of novel methods for the analysis of complex networks, some of them presented in this chapter, that possibly would otherwise not have been invented. We are excited to see the developments over the next years and expect an ever-increasing interest in complex networks and their analysis due to their omnipresence in the real world. Acknowledgments I would like to thank Matthias Dehmer for fruitful discussions.
References 1. Adamic L, Huberman B (2000) Power-law distribution of the world wide web. Science 287:2115 2. Albert R, Barabasi AL (2002) Statistical mechanics of complex networks. Rev Mod Phys 74:47 3. Bakir GH, Hofmann T, Sch¨olkopf B, Smola AJ, Taskar B, Vishwanathan SVN (eds) (2007) Predicting structured data. MIT Press, Cambridge, MA 4. Barabasi AL, Albert R (1999) Emergence of scaling in random networks. Science 206: 509–512 5. Bavelas A (1948) A mathematical model for group structure. Hum Organ 7:16–30 6. Bavelas A (1950) Communication patterns in task-oriented groups. J Acoust Soc Am 22: 725–730 7. Bellman R (1957) Dynamic programming. International Series. Princeton University Press, Princeton, NJ 8. Bonchev D (1979) Information indices for atoms and molecules. Match 7:65–113 9. Bonchev D (1983) Information theoretic indices for characterization of chemical structures. Research Studies Press, Chichester 10. Bonchev D (1995) Kolmogorov’s information, shannon’s entropy, and topological complexity of molecules. Bulg Chem Commun 28:567–582 11. Bonchev D (2003) Complexity in chemistry. Introduction and fundamentals. Taylor & Francis, London (Philadelphia, PA) 12. Bonchev D, Rouvray DH (2005) Complexity in chemistry, biology, and ecology. Mathematical and computational chemistry. Springer, Berlin 13. Bonchev D, Trinajsti´c N (1977) Information theory, distance matrix and molecular branching. J Chem Phys 67:4517–4533 14. Bonchev D, Balaban AT, Mekenyan OG (1980) Generalization of the graph center concept, and derived topological centric indexes. J Chem Inf Comput Sci 20(2):106–113 15. Bonacich P (1972) Factoring and weighting approaches to status scores and clique identification. J Math Sociol 2:113–120
1
A Brief Introduction to Complex Networks and Their Analysis
23
16. Bornholdt S, Schuster HG (2003) Handbook of graphs and networks: from the genome to the internet. Wiley, New York, NY 17. Bornholdt S, Schuster HG (eds) (2003) Handbook of graphs and networks: from the genome to the internet. Wiley, New York, NY 18. Brandes U (2001) A faster algorithm for betweenness centrality. J Math Sociol 25(2):163–177 19. Brandes U, Erlebach T (2005) Network analysis. Lecture notes in computer science. Springer, Berlin 20. Brandst¨adt A, Le VB, Sprinrand JP (1999) Graph classes. A survey. SIAM Monographs on Discrete Mathematics and Applications 21. Brinkmeier M, Schank T (2005) Network statistics. In Brandes U, Erlebach T (eds) Network analysis. Lecture notes in computer science. Springer, Berlin, pp 293–317 22. Broder A, Kumar R, Maghoul F, Raghavan P, Rajagopalan S, Stata R, Tomkins A, Wiener J (2000) Graph structure in the web: experiments and models. In: Proceedings of the 9th WWW conference, Amsterdam 23. Buckley F, Harary F (1990) Distance in graphs. Addison-Wesley, Reading, MA 24. Bunke H (1983) What is the distance between graphs? Bull EATCS 20:35–39 25. Bunke H (1997) On a relation between graph edit distance and maximum common subgraph. Pattern Recognit Lett 18(9):689–694 26. Bunke H (1998) A graph distance metric based on the maximum common subgraph. Pattern Recognit Lett 19(3):255–259 27. Bunke H, Allermann G (1983) A metric on graphs for structural pattern recognition. In: Schussler HW (ed) Proceedings of 2nd European signal processing conference EUSIPCO, pp 257–260 28. Bunke H, Neuhaus M (2007) Graph matching. Exact and error-tolerant methods and the automatic learning of edit costs. In: Cook D, Holder LB (eds) Mining graph data. Wiley, New York, NY, pp 17–32 29. Carri`ere SJ, Kazman R (1997) Webquery: searching and visualizing the web through connectivity. Computer Networks and ISDN Systems 29(8–13):1257–1267 30. Cayley A (1857) On the theory of analytic forms called trees. Philos Mag 13:19–30 31. Cayley A (1875) On the analytical forms called trees, with application to the theory of chemical combinatorics. Report of the British Association for the Advancement of Science, pp 257–305 32. Chowdhury D, Stauffer D (2000) Principles of equilibrium statistical mechanics. Wiley-VCH, Weinheim 33. Clauset A, Newman MEJ, Moore C (2004) Finding community structure in very large networks. Phys Rev E 70:066111 34. Claussen JC (2007) Characterization of networks by the offdiagonal complexity. Physica A 365–373:321–354 35. Claussen JC (2007) Offdiagonal complexity: a computationally quick network complexity measure – application to protein networks and cell division. In: Deutsch A, Bravo de la Parra R et al (eds) Mathematical modeling of biological systems, vol II. Birkh¨auser, Boston, MA, pp 303–311 36. Cook D, Holder LB (2007) Mining graph data. Wiley, New York, NY 37. Cormen T, Leiserson CE, Rivest RL, Leiserson C, Rivest R (2001) Introduction to algorithms. MIT Press, Cambridge, MA 38. Cristianini N, Shawe-Taylor J (2000) An introduction to support vector machines. Cambridge University Press, Cambridge 39. Dehmer M (2006) Strukturelle Analyse web-basierter Dokumente. Multimedia und Telekooperation. Deutscher Universit¨ats Verlag, Wiesbaden 40. Dehmer M (2008) A novel method for measuring the structural information content of networks. Cybern Syst 39:825–842 41. Dehmer M, Emmert-Streib F (2008) Structural information content of chemical networks. Zeitschrift f¨ur Naturforschung, Part A 63a:155–159 42. Deo N, Gupta P (2001) World wide web: a graph-theoretic perspective. Technical report, Department of Computer Science, University of Central Florida
24
F. Emmert-Streib
43. Dickinson PJ, Bunke H, Dadej A, Kraetzl M (2004) Matching graphs with unique node labels. Pattern Anal Appl 7:243–266 44. Diestel R (2000) Graph theory. Springer, Berlin 45. Duch J, Arenas A (2005) Community detection in complex networks using extremal optimization. Phys Rev E, 72:027104 46. Emmert-Streib F (2007) The chronic fatigue syndrome: a comparative pathway analysis. J Comput Biol 14(7):961–972 47. Emmert-Streib F, Chen L, Storey J (2007) Functional annotation of genes in Saccharomyces cerevisiae based on joint betweenness. arXiv:0709.3291 48. Emmert-Streib F, Dehmer M (2007) Global information processing in gene networks: fault tolerance. In: Proceedings of the bio-inspired models of network, information, and computing systems, Bionetics 2007, art. no. 4610138, pp 326–329 49. Emmert-Streib F, Dehmer M, Kilian J (2005) Classification of large graphs by a local tree decomposition. In: Arabnia HR, Scime A (eds) Proceedings of DMIN’05, international conference on data mining, Las Vegas, June 20–23, pp 200–207 50. Emmert-Streib F, Dehmer M (2007) Topolocial mappings between graphs, trees and generalized trees. Appl Math Comput 186(2):1326–1333 51. Emmert-Streib F, Dehmer M (eds) (2008) Analysis of microarray data: a network based approach. Wiley-VCH, Weinheim 52. Emmert-Streib F, Dehmer M (2005) Robustness in scale-free networks: comparing directed and undirected networks. Int J Mod Phys C 19(5):717–726 53. Emmert-Streib F, Mushegian A (2007) A topological algorithm for identification of structural domains of proteins. BMC Bioinformatics 8:237 54. Erd¨os P, R´enyi A (1959) On random graphs. Publicationes Mathematicae 6:290–297 55. Erd¨os P, R´enyi A (1960) On the evolution of random graphs. Publications of Mathematical Institute of the Hungarian Academy of Sciences 5:17–61 56. Euler L (1736) Solutio problematis ad geometriam situs pertinentis. Comentarii Academiae Scientiarum Imperialis Petropolitanae 8:128–140 57. Even S (1979) Algorithms. Computer Science Press, Potomac, MD 58. Freeman LC (1977) A set of measures of centrality based on betweenness. Sociometry 40: 35–41 59. Freeman LC (1979) Centrality in social networks: conceptual clarification. Soc Networks 1:215–239 60. Fujii JI, Yuki S (1997) Entropy and coding for graphs. Int J Math Stat Sci 6(1):63–77 61. Gagneur J, Krause R, Bouwmeester T, Casari G (2004) Modular decomposition of protein– protein interaction networks. Genome Biol 5:R57 62. G¨artner T, Flach PA, Wrobel S (2003) On graph kernels: hardness results and efficient alternatives. In: COLT, pp 129–143 63. Gernert D (1979) Measuring the similarity of complex structures by means of graph grammars. Bull EATCS 7:3–9 64. Gernert D (1981) Graph grammars which generate graphs with specified properties. Bull EATCS 13:13–20 65. Gleiser PM, Danon L (2003) Community structure in jazz. Advances in complex systems 6(4):565–574 66. Hage P, Harary F (1995) Eccentricity and centrality in networks. Soc Networks 17:57–63 67. Halin R (1989) Graphentheorie. Akademie Verlag, Berlin 68. Harary F (1959) Status and contrastatus. Sociometry 22:23–43 69. Harary F (1965) Structural models. An introduction to the theory of directed graphs. Wiley, NY 70. Harary F (1967) Graph theory and theoretical physics. Academic, New York, NY 71. Harary F (1969) Graph theory. Addison-Wesley, Reading, MA 72. Hastie T, Tibshirani R, Friedman JH (2001) The elements of statistical learning. Springer, Berlin
1
A Brief Introduction to Complex Networks and Their Analysis
25
73. Horv´ath T, G¨artner T, Wrobel S (2004) Cyclic pattern kernels for predictive graph mining. In: Proceedings of the 2004 ACM SIGKDD international conference on knowledge discovery and data mining, pp 158–167 74. Hsu H-P, Mehra V, Grassberger P (2003) Structure optimization in an off-lattice protein model. Phys Rev E 68(3):037703 75. Kaden F (1982) Graphmetriken und Distanzgraphen. ZKI-Informationen, Akademie der Wissenschaften DDR 2(82):1–63 76. Kaden F (1983) Halbgeordnete Graphmengen und Graphmetriken. In: Proceedings of the conference graphs, hypergraphs, and applications DDR, pp 92–95 77. Kaden F (1986) Graphmetriken und Isometrieprobleme zugeh¨origer Distanzgraphen. ZKI-Informationen, Akademie der Wissenschaften DDR, pp 1–100 78. Kauffman SA (1969) Metabolic stability and epigenesis in randomly constructed genetic nets. J Theor Biol 22:437–467 79. Kieffer J, Yang E (1997) Ergodic behavior of graph entropy. Electronic Research Announcements of the American Mathematical Society 3:11–16 80. Kondor RI, Lafferty J (2002) Diffusion kernels on graphs and other discrete input spaces. In: Machine learning: Proceedings of the 19th international conference, Morgan Kaufmann, San Mateo, CA 81. K¨onig D (1936) Theorie der endlichen und unendlichen Graphen. Chelsea, New York, NY 82. K¨orner J (1973) Coding of an information source having ambiguous alphabet and the entropy of graphs. Transactions of the 6th Prague conference on information theory, pp 411–425 83. Kosch¨utzki D, Lehmann KA, Peters L, Richter S, Tenfelde-Podehl D, Zlotkowski O (2005) Clustering. In: Brandes U, Erlebach T (eds) Centrality indices. Lecture notes in computer science. Springer, Berlin, pp 16–61 84. Kullback S (1959) Information theory and statistics. Wiley, New York, NY 85. Kullback S, Leibler RA (1951) On information and sufficiency. Ann Math Stat 22(1):79–86 86. Laubenbacher RC (2007) Modeling and simulation of biological networks. In: Proceedings of symposia in applied mathematics. American Mathematical Society, Providence, RI 87. Li M, Vit´anyi P (1997) An introduction to Kolmogorov complexity and its applications. Springer, Berlin 88. Mason O, Verwoerd M (2007) Graph theory and networks in biology. IET Syst Biol 1(2): 89–119 89. Mehler A (2006) In search of a bridge between network analysis in computational linguistics and computational biology – a conceptual note. In: Proceedings of the 2006 international conference on bioinformatics & computational biology (BIOCOMP’06), 2006, Las Vegas, Nevada, USA, pp 496–500 90. Mehler A, Dehmer M, Gleim R (2005) Towards logical hypertext structure. a graph-theoretic perspective. In: Proceedings of I2CS’04. Lecture notes. Springer, Berlin, pp 136–150 91. Messmer BT, Bunke H (1998) A new algorithm for error-tolerant subgraph isomorphism detection. IEEE Trans Pattern Anal Mach Intell 20(5):493–504 92. Mowshowitz A (1968) Entropy and the complexity of the graphs I: an index of the relative complexity of a graph. Bull Math Biophys 30:175–204 93. Mowshowitz A (1968) Entropy and the complexity of graphs II: the information content of digraphs and infinite graphs. Bull Math Biophys 30:225–240 94. Mowshowitz A (1968) Entropy and the complexity of graphs III: graphs with prescribed information content. Bull Math Biophys 30:387–414 95. Mowshowitz A (1968) Entropy and the complexity of graphs IV: entropy measures and graphical structure. Bull Math Biophys 30:533–546 96. Newman MEJ (2003) The structure and function of complex networks. SIAM Rev 45: 167–256 97. Newman MEJ, Girvan M (2004) Finding and evaluating community structures in networks. Phys Rev E 69:026113 98. Newman MEJ (2006) Modularity and community structure in networks. Proc Natl Acad Sci USA 103:8577–8582
26
F. Emmert-Streib
99. Pearl J (1998) Probabilistic reasoning in intelligent systems. Morgan Kaufmann, Los Altos, CA 100. Rashewsky N (1955) Life, information theory, and topology. Bull Math Biophys 17:229–235 101. Roberts F (1989) Applications of combinatorics and graph theory to the biological and social sciences series. IMA volumes in mathematics and its applications. Springer, Berlin 102. Rosvall M, Bergstrom CT (2007) An information-theoretic framework for resolving community structure in complex networks. In: Proc Natl Acad Sci USA 104(18):7327–31 103. Sabidussi G (1966) The centrality index of a graph. Psychometrika 31:581–603 104. Scott F (2001) Social network analysis. Sage, Beverly Hills, CA 105. Shannon CE, Weaver W (1997) The mathematical theory of communication. University of Illinois Press, Champaign, IL 106. Simonyi G (2001) Perfect graphs and graph entropy. An updated survey. In: Ramirez-Alfonsin J, Reed B (eds) Perfect graphs. Wiley, New York, NY, pp 293–328 107. Skorobogatov VA, Dobrynin AA (1988) Metrical analysis of graphs. MATCH 23:105–155 108. Sobik F (1982) Graphmetriken und Klassifikation strukturierter Objekte. ZKI-Informationen, Akademie der Wissenschaften DDR 2(82):63–122 109. Sobik F (1986) Modellierung von Vergleichsprozessen auf der Grundlage von ¨ Ahnlichkeitsmaßen f¨ur Graphen. ZKI-Informationen, Akademie der Wissenschaften DDR 4:104–144 110. Sol´e RV, Valverde S (2004) Information theory of complex networks: on evolution and architectural constraints. In: Lecture notes in physics, vol 650, pp 189–207 111. Temkin O, Zeigarnik AV, Bonchev D (1996) Chemical reaction networks. A graph-theoretical approach. CRC Press, West Palm Beach, FL 112. Trucco E (1956) A note on the information content of graphs. Bull Math Biol 18(2):129–135 113. Ullmann JR (1976) An algorithm for subgraph isomorphism. J ACM 23(1):31–42 114. Wasserman S, Faust K (1994) Social network analysis: methods and applications. Structural analysis in the social sciences. Cambridge University Press, Cambridge 115. Watts DJ, Strogatz SH (1998) Collective dynamics of ‘small-world’ networks. Nature 393: 440–442 116. Zachary W (1977) An information flow model for conflict and fission in small groups. J Anthropol Res 33:452–473 ˇ 117. Zelinka B (1975) On a certain distance between isomorphism classes of graphs. Casopis pro p˘ est. Mathematiky 100:371–373 118. Zhang K, Statman R, Shasha D (1992) On the editing distance between unordered labeled trees. Inform Process Lett 42(3):133–139
Chapter 2
Partitions of Graphs Mieczysław Borowiecki
Abstract Many difficult optimization problems on graphs become tractable when restricted to some classes of graphs, usually to hereditary classes. A large part of these problems can be expressed in the vertex partitioning formalism, i.e., by partitioning of the vertex set of a given graph into subsets V1 ; : : : ;Vk called colour classes, satisfying certain constraints either internally or externally, or both internally and externally. These requirements may be conveniently captured by the symmetric k-by-k matrix M . Concepts which are modeled by M -partitions fall naturally into the three types; each is represented in this work by some problem. Any minimal reducible bound for a hereditary property is in some sense the best possible partition. A number of such partitions are given. Clustering is a central optimization problem (among many others) with applications in various disciplines, e.g., computational biology, communications networks, image processing, pattern analysis [41, 53, 57, 60], and numerous other fields. Some new results on k-clustering of graphs are proved. Another type of M -partition is a matching cutset. The main known results on this subject are collected. The last part of this work is devoted to acyclic partitions of graphs where we consider important classes of graphs and their acyclic reducible bounds. For each partition type the complexity of considered problems is given. Also a number of open problems are presented. Keywords Colourings Partitions Hereditary properties k-clustering Domination Cut matching Complexity MSC2000: Primary 05C15, 05C70; Secondary 05C12, 05C69, 05C85, 05C90
M. Borowiecki () Faculty of Mathematics, Computer Science and Econometrics, University of Zielona G´ora, Podg´orna 50, 65-246 Zielona G´ora, Poland e-mail:
[email protected]
M. Dehmer (ed.), Structural Analysis of Complex Networks, c Springer Science+Business Media, LLC 2011 DOI 10.1007/978-0-8176-4789-6 2,
27
28
M. Borowiecki
2.1 Introduction and Notation We present some of the basic definitions, notation, and terminology used in this chapter. Other terminology will be introduced as it naturally occurs in the text and those concepts not defined can be found in [4, 30, 59]. We consider finite undirected graphs without loops or multiple edges. The vertex set and the edge set of graph G are denoted by V .G/ and E.G/, respectively, and I is used to denote the class of these graphs. Many difficult (NP-hard) optimization problems on graphs become tractable when restricted to some classes of graphs, usually to hereditary classes. A large part of these problems can be expressed in the vertex partitioning formalism, i.e., by partitioning of the vertices of a given graph into subsets V1 ; : : : ; Vk called colour classes, satisfying certain constraints either internally or externally, or both internally and externally. These requirements may be conveniently captured by the symmetric k-by-k matrix M in which the diagonal entries mii D P i encode the internal restrictions on the sets Vi and the off-diagonal entries mij D P ij .i ¤ j / encode the restriction on the edges between Vi and Vj . Formally, it can be defined as follows. Definition 2.1.1. Let M be a fixed symmetric k k matrix with entries mii D P i and mij D P ij B for i ¤ j , where B is the class of all bipartite graphs. An M -colouring (partition) of a graph G is a partition of vertices of G into k subsets V1 ; : : : ; Vk corresponding to the rows (and columns) of the matrix M such that the subgraph of G induced by Vi has the property P i for i D 1; : : : ; k. Vertices of the set Vi are said to be i -coloured. For every two distinct colours i and j , the subgraph induced by all the edges linking an i -coloured vertex and a j -coloured vertex has the property P ij , 1 i; j k. Notice that properties P ij always form some classes of bipartite graphs. A graph G is bipartite if it admits a vertex partition V .G/ D V1 [ V2 such that every edge of G joins two different Vi ’s. Graph-theoretical concepts which are modeled by M -partitions fall naturally into three types: (T1) mii D P i ; mij D P ij D B .i ¤ j /; i; j D 1; : : : ; kI i.e., no restrictions between colour classes. (T2) mii D I; mij D P ij B .i ¤ j /; i; j D 1; : : : ; kI i.e., no internal restrictions. (T3) mii D P i ; mij D P ij B .i ¤ j /; i; j D 1; : : : ; k.
2.1.1 Examples of M -Partitions A .P 1 ; : : : ; P k /-partition of G is defined as an M -partition of type (T1). In the case when all P i D O, where O is the class of edgeless graphs, we have a k-colouring of G. Thus a k-colouring of G is an M -partition of G, where the matrix M has O on the main diagonal and B everywhere else.
2
Partitions of Graphs
29
The smallest k for which there is a k-colouring of G is called the chromatic number of G and is denoted by .G/. Karp [40] has shown that the k-colouring problem (k 3) is NP-complete for graphs and up to this time no polynomial-time algorithm is known for this problem. However, the k-colouring problem becomes much easier when we restrict the inputs to special classes of graphs. An M -partition of type (T1) of G is called k-clustering, if mii D P D fG 2 I W diam.G/ kg: Let .V1 ; V2 / be an M -partition of G. Denote by M the property of graphs for which the edges between the set V1 and V2 induce a matching, i.e., any two of them have no common endvertex. An M -partition of G such that mii D I; m12 D m21 D M B is called a matching cutset of G. A path in G is an alternating sequence of distinct vertices and edges beginning and ending with vertices in which each edge joins the vertex before it to the one following it. The first and the least vertex of this sequence is called the endvertex of the path. The path with n vertices is denoted by Pn . A cycle in G is a path with at least three vertices together with an edge joining its endvertices. A cycle with n vertices is denoted by Cn . The length of a path (cycle) is the number of edges in it. A graph G is called acyclic if G does not contain a cycle. Let us denote by D1 the class of all acyclic graphs. An M -partition of a graph G such that mii D O and mij D D1 for i ¤ j , 1 i; j k is called an acyclic colouring of G. The minimum k such that G has an acyclic k-colouring is the acyclic chromatic number of G, denoted by a .G/. Similarly, for a class P of graphs, the acyclic chromatic number of P, denoted by a .P/, is defined as the maximum a .G/ over all graphs G 2 P, assuming that a .G/ is finite for all G 2 P.
2.1.2 Hereditary Properties Two graphs G and H are isomorphic if there is a bijection f W V .G/ ! V .H / such that uv 2 E.G/ if and only if f .u/f .v/ 2 E.H /. A property of graphs is any nonempty class of graphs from I which is closed under isomorphisms. We use the terms class of graphs and property of graphs interchangeably. Graph H is a subgraph of graph G if V .H / V .G/ and E.H / E.G/ and is denoted by H G. A subgraph H of G is induced if every pair of vertices in H which are adjacent in G are also adjacent in H . This fact is denoted by H G.
30
M. Borowiecki
Definition 2.1.2. A property P of graphs is said to be induced hereditary (hereditary, also called monotone) if whenever G 2 P and H G (H G), then also H 2 P and additive if it is closed under disjoint union, i.e., if every component of G has property P, then G 2 P. Obviously any hereditary property is induced hereditary, too. Following [11] we list some examples and notations of hereditary properties of graphs. O Ok Sk Ok Dk Tk
D fG 2 I W E.G/ D ;g; D fG 2 I W .G/ kg; D fG 2 I W the maximum degree .G/ kg; D fG 2 I W each component of G has order at most k C 1g; D fG 2 I W G is k-degenerate; i.e., the minimum degree ı.H / k for each H Gg; D fG 2 I W G contains no subgraph homeomorphic to KkC2 or Kb kC3 c;d kC3 e g; 2
2
Ik D fG 2 I W G does not contain KkC2 g: Observe that: O is the class of edgeless graphs, Ok is the class of k-colourable graphs, S k is the class of graphs with degree bounded by k, D1 is the class of acyclic graphs, T2 is the class of outerplanar graphs, T3 is the class of planar graphs. Additionally, let us denote by LF D D 1 \ S 2 , the class of linear forests. A hereditary property P can be uniquely determined by the set of minimal forbidden subgraphs which can be defined as follows. Definition 2.1.3. F .P/ D fG 2 I W G … P, but each proper subgraph H of G belongs to Pg. Let F be a family of graphs, Forb .F / is defined to be the property of all graphs having no subgraph isomorphic to any graph from F . Thus P D Forb .F .P//: In such a manner is defined, for example, the property I k D Forb .fKkC2 g/, also called the class of KkC2 -free graphs.
2
Partitions of Graphs
31
Similarly, the set of minimal forbidden subgraphs F .P/ for an induced hereditary property P is defined. Let us denote by L the set of all hereditary and by L induced hereditary properties of graphs, and let the corresponding sets of additive properties be denoted by La and La , respectively. The sets L, La , L and La partially ordered by the set inclusion, form complete distributive lattices with the set intersection as the meet operation [17]. Obviously .L; / is a proper sublattice of .L ; /. We now consider some examples of partitions of outerplanar and planar graphs. In [21] it has been proved that each outerplanar graph has an .LF ; LF /-partition. An algorithmic proof of that fact is given in [18]. Each outerplanar graph also has an .O; D 1 /-partition. A natural question arises: does a property P LF exist such that each outerplanar graph has a .P; LF /-partition? In other words: is the .LF ; LF /partition the best possible for the class of outerplanar graphs? An answer is given later on. It is well known [26] that every planar graph has vertex arboricity at most 3; i.e., it has a .D1 ; D 1 ; D1 /-partition. Stein [55] (see also [8, 37]) strengthened this result by proving that every planar graph can be vertex partitioned into two forests and one edgeless graph; i.e., an planar graph has an .O; D1 ; D 1 /-partition. Another strengthening was obtained by Poh [51] and independently by Goddard [36]. They proved that every planar graph has an .LF ; LF ; LF /-partition.
2.1.3 Reducibility To more precisely analyse different partitions and compare them, we need some new notation. A property R D P 1 ı P 2 ı ı P k is defined as the set of all graphs having a .P 1 ; P 2 ; : : : ; P k /-partition. If P 1 D D P k D P, then we write P 1 ı ı Pk D Pk. It is easy to see that P1 ı ı Pk is (induced) hereditary and additive whenever P 1 ; P 2 ; : : : ; P k are (induced) hereditary and additive, respectively. An (induced) hereditary property R is said to be reducible if there exist two (induced) hereditary properties P1 and P2 such that R D P1 ı P2 and irreducible, otherwise. Definition 2.1.4. (Mih´ok and Toft, see [39]) For a given irreducible property P 2 L, a reducible property R 2 L is called a minimal reducible bound for P if P R and for each reducible property R0 R; P 6 R0 . We consider reducibility and minimal reducible bounds only in the lattice La . The family of all minimal reducible bounds for P in this lattice is denoted by B.P/. Example 1. The class O 2 of bipartite graphs is the smallest reducible property in the lattice La .
32
M. Borowiecki
Obviously it is the unique minimal reducible bound for P if and only if P O 2 . In general, finding the set of minimal reducible bounds for a given irreducible property is a difficult problem. The existence of the set B.P/ for any property P is proved in [5].
2.1.4 Examples of Some Reducible Bounds From the previously mentioned results for outerplanar and planar graphs we can write: 1. 2. 3. 4. 5.
T 2 O ıD 1 , T 2 LF 2 , Four Colour Theorem implies: T 3 .O 2 \ T 3 /2 , [55]: T 3 O ıD 21 was improved by Thomassen [56]: T 3 D 1 ı.D2 \ T 3 /, [36, 51]: T 3 LF 3 .
2.1.5 Minimal Reducible Bounds for Outerplanar and Planar Graphs Theorem 2.1.5 ([47]). B.T 2 / D fOıD1 ; LF ıLF g: From this theorem it follows that for each reducible property R D P ıQ such that T 2 R LF 2 there is an outerplanar graph G which is not .P; Q/-partitionable. The same holds for O ı D 1 . In this sense, the bounds given above are best possible. For a class of planar graphs the problem of minimal reducible bounds is much harder. Until now any minimal reducible bound for T 3 is not known. In [12] a few minimal reducible bounds for some interesting subclasses of planar graphs are given. Theorem 2.1.6 ([12]). 1. B.T 3 \ D2 / D fOıD1 g, 2. B.T 3 \ D3 / 3 D1 ıD 1 , 3. B.T 3 \ O3 / 3 Oı.O2 \ T 3 /. We are not able to find other minimal reducible bounds for 3-colourable planar graphs. We can only show: Theorem 2.1.7 ([12]). Barnette’s Conjecture, if true, gives a minimal reducible bound D 21 for T 3 \ O3 . Theorem 2.1.7 gives an unexpected relation to a well-known conjecture of Barnette which says that whenever G is a 3-connected bipartite 3-regular planar graph, then G has a Hamiltonian cycle. This conjecture is true if and only if each 3-colourable planar graph has a vertex partition into two subsets such that each of them induces a forest.
2
Partitions of Graphs
33
2.1.6 Minimal Reducible Bounds for Some Other Classes of Graphs In [15] a subclass of planar graphs (slightly wider than the class of outerplanar graphs) called 1-nonouterplanar was considered. For this class of graphs, in contrast with the class of outerplanar graphs (see Theorem 2.1.5), there is an infinite number of minimal reducible bounds. Let us define a few properties: UCi D fG 2 I W each component of G contains at most one cycle of length i and no cycle of any other lengthg, UCik D fG 2 UCi W if G contains a cycle (of length i), then the minimum degree in G of the vertices of this cycle is at most k C 2g. S rk D fG 2 I W each component of G belongs to UC3k [ i kC2 UC2i C1 g: For convenience, let r1 D UC3 . For a plane graph G let Int(G) denote the set of vertices not belonging to the external face. If G is a connected planar graph, we define int(G) to be the minimum value of jInt(G)j over all plane embeddings of G. If G is a planar graph with r components H1 ; : : : ; Hr then we define int.G/ D maxfint.Hi / W 1 i rg: If int(G) k then G is said to be k-nonouterplanar and we denote this property by N OPk , i.e., N OPk D fG 2 T3 : int(G) kg. It easy to see that N OP0 D T2 and N OP1 D T3 . Theorem 2.1.8 ([15]). B.N OP1 / D fLF ı LF ; O1 ı D1 g [ fO ı rk W k D 0; 1; : : : ; 1g: The minimal reducible bound for the class of triangle free graphs is trivial and it follows from the theorem given by Neˇsetˇril and R˝odl. Theorem 2.1.9 ([50]). Let F .P/ be a finite set of 2-connected graphs. Then for every graph G of property P there is a graph H of property P such that for any partition .V1 ; V2 / of V .H / there is an i; i D 1 or i D 2, for which the subgraph H ŒVi contains G. From this theorem we immediately have the following. Corollary 2.1.10 ([48]). Let F .P/ be a finite set of 2-connected graphs. Then the property P has exactly one minimal reducible bound. O ıP. Corollary 2.1.10 implies that the class I k of KkC2 -free graphs has only one trivial minimal reducible bound O ıI k . For the class of graphs with a bounded order of components and the class of k-degenerate graphs we have the following sets of minimal reducible bounds.
34
M. Borowiecki
Theorem 2.1.11 ([48]). For any positive integer k, B.Ok / D fOp ıOq W p C q C 1 D kg; B.Dk / D fDp ıDq W p C q C 1 D kg: A k-tree is a graph defined inductively as follows. A clique of order k is a k-tree. If G is a k-tree of order n, n k, and K is a clique of G of order k, then the graph obtained from G by adding a new vertex and joining it by new edges to all vertices of K is a k-tree of order n C 1. Any subgraph of a k-tree is a partial k-tree. Let us denote the class of all partial k-trees by PTk . Obviously this class is hereditary. Similar relations as above hold for the class of partial k-trees. Theorem 2.1.12 ([52]). For any positive integer k, B.PTk / D fPTp ıPTq W p C q C 1 D kg: Partitions and minimal reducible bounds for minor hereditary properties were considered in [19].
2.1.7 Complexity of Some Selected Graph Partition Problems We begin with complexity of partition problems for the class of planar graphs. Theorem 2.1.13. The following partition problems are NP-complete: 1. 2. 3. 4.
[38]: .O; D1 /-partition for planar graphs G with .G/ 4, [38]: .D1 ; D 1 /-partition even for maximal planar graphs, [35]: .O; O; O/-partition for planar graphs G with .G/ 4, [38]: .O; O; D 1 /-partition for planar graphs in which each face has size 3 or 4.
Conjecture 2.1.14 ([38]). .O; O; D1 /-partition is NP-complete for maximal planar graphs. Below are presented partition problems for some interesting classes of graphs. General discussions on partitions with respect to hereditary or induced hereditary properties can be found in [2, 33]. Theorem 2.1.15. The following partition problems for graphs (in general) are NPcomplete: 1. 2. 3. 4.
[35]: .O; O2 /-partition, [35]: .O; D1 /-partition, [46]: .O; S 1 /-partition, [20]: .O; F orb .fC4 ; 2K2 ; C5 g//-partition,
2
Partitions of Graphs
35
5. [20]: .O; F orb .fP4 g//-partition, 6. [20]: .O; F orb .fP4 ; C4 g//-partition, 7. [20]: .O; I 1 /-partition.
2.2 k-Clustering Another type of (T1) partition of graphs with properties P i ; i D 1; : : : ; k, which are not hereditary is k-clustering. Clustering is a central optimization problem (among many others) with applications in various disciplines, e.g., computational biology, communications networks, image processing, pattern analysis [41, 53, 57, 60], and numerous other fields. From a general point of view the goal of clustering is to find the groups (clusters) that are both homogeneous and well separated; i.e., elements within the same cluster should be similar and elements in different clusters dissimilar. The process of generating the clusters is called clustering. In the graph-theoretic approach to clustering, one builds from the data a similarity graph in which vertices correspond to objects and edges connect two vertices with similarity values above some predefined threshold. Typical objectives include: minimizing the maximum diameter of a cluster (k-clustering), minimizing the average distance between pairs of clustered points (k-clustered sum), and many others.
2.2.1 Minimum k-Clustering Problem 2.2.1. k-CLUSTERING Given a graph G D .V; E/ and a positive integer l, determine whether there is a partition of V into at most l subsets such that each of these subsets induces a subgraph of G with diameter at most k. Problem 2.2.2. MINIMUM k-CLUSTERING Given a graph G D .V; E/, find the smallest integer l such that there is a partition of V into l subsets each inducing a subgraph of G with diameter at most k. The number of clusters in a minimum k-clustering of a graph G is denoted by clk .G/: Theorem 2.2.3 ([23]). Problem k-CLUSTERING is NP-complete for l 3. Linear time algorithms for k-clustering on trees and some classes of perfect graphs were given in [1, 32]. The 1-CLUSTERING problem is equivalent to the problem PARTITION INTO CLIQUES which is NP-complete for any fixed l 3. A graph G has 1-CLUSTERING into at most l clusters if and only if the complement of G has an l-colouring.
36
M. Borowiecki
The graph 2-CLUSTERING problem is related to the NP-complete problem DOMINATING SET. A subset D V is said to be a dominating set of the graph G D .V; E/ if for every vertex u 2 V D there exists a vertex v 2 D such that uv 2 E. The minimum cardinality of a dominating set of G is denoted by .G/: Problem 2.2.4. DOMINATING SET Given a graph G D .V; E/ and a positive integer k, decide whether G has a dominating set S with jS j k. Theorem 2.2.5 ([29]). For any graph G cl2 .G/ .G/: Proof. Let D D fw1 ; : : : ; wl g be a dominating set of G. 2-clustering fQ1 ; : : : ; Ql g of G with wi 2 Qi for all i D 1; : : : ; l can be generated by assigning remaining vertices v to Qi for which vwi 2 E. Thus a dominating set of cardinality .G/ induces a clustering of G into the smallest number of subsets for which each subgraph induced by Qi has a dominating vertex. t u
2.2.2 Strongly Chordal Graphs A class of chordal graphs, denoted by C, is defined by the set of minimal forbidden induced subgraphs as follows: F .C/ D fCn W n 4g: A graph G D .V; E/ is said to be strongly chordal if every induced subgraph contains a simple vertex, where a vertex v of a graph G is simple if the set fN Œu W u 2 N Œvg can be linearly ordered by inclusion; i.e., the closed neighbourhoods form a chain under inclusion; see Fig. 2.1. A class of strongly chordal graphs is denoted by SC. A Sun Sr is a chordal graph on 2r vertices, for some r 3, whose vertex set can be partitioned into two sets: U D fu1 ; : : : ; ur g and W D fw1 ; : : : ; wr g such that: (a) Sr ŒU is a complete graph (r-clique) and W is an independent set in Sr (b) for each i and j , wi is adjacent to uj if and only if i D j or i j C 1 .mod r/. Theorem 2.2.6 ([31]). A graph is strongly chordal if and only if it does not contain as an induced subgraph a cycle of length greater than three or Sun Sr , r 3. Theorem 2.2.7 ([29]). Let G be a strongly chordal graph. Then cl2 .G/ D .G/:
2
Partitions of Graphs
37 3
5
1
6
2
4
Fig. 2.1 A strongly chordal graph with a strong ordering (1, 2, 3, 4, 5, 6). The vertex 1 is simple: N Œ1 D f1; 2; 3g N Œ2 D f1; 2; 3; 4g N Œ3 D f1; 2; 3; 4; 5g
Consequently, there is a linear time algorithm to compute an optimal 2-clustering of a strongly chordal graph that is given with a strong elimination ordering. This algorithm applies a linear time algorithm to compute a minimum dominating set for strongly chordal graphs [31].
2.2.3 Hereditary Clique-Helly Graphs A set family F has the Helly property if every collection of pairwise-intersecting sets from F has a common element. In other words, if fS1 ; : : : ; Sm g F , then .8i; j Si \ Sj ¤ ;/ )
m \
! Sk ¤ ; :
kD1
A clique of a graph G is a maximal complete subgraph of G. We also use “clique” to mean “vertex set of a clique”. A graph G is clique-Helly if the cliques of G have the Helly property, and G is hereditary clique-Helly if every induced subgraph of G is clique-Helly. Let us denote the class of hereditary clique-Helly graphs by HCH: The set of minimal forbidden subgraphs of HCH is given by F .HCH/ D fH0 D S3 ; H1 ; H2 ; H3 g, where H1 is obtained from Sr by adding the edge w1 w2 , H2 from H1 by adding the edge w2 w3 , and H3 from H2 by adding the edge w1 w3 . Let us denote the class of hereditary clique-Helly chordal graphs by HCHC; i.e., let HCHC D HCH \ C:
38
M. Borowiecki w1
u1
w3
u2
w2
u3
Fig. 2.2 Haj´os graph: S3 and Sun: S5
Since each graph Hi , i D 1; 2; 3, from F .HCH/ contains C4 as an induced subgraph, then the minimal forbidden subgraphs of HCHC are the Haj´os graph S3 and cycles of length greater than 3. Consequently, it follows that SC HCHC C: Since S5 2 HCHC SC and S3 2 C HCHC, the above inclusions are proper. Theorem 2.2.8. There is a polynomial-time recognition algorithm for HCHC graphs.
2.2.4 Minimum k-Clustering in HCHC Theorem 2.2.9. Let G 2 HCHC. Then cl2 .G/ D .G/: Proof. By Theorem 2.2.5 we have cl2 .G/ .G/: We prove that for G 2 HCHC, cl2 .G/ .G/: Let G 2 HCHC and fQ1 ; : : : ; Ql g be 2-clusters of G with l D cl2 .G/. By heredity, Qi 2 HCHC and diam .Qi / 2 for i D 1; : : : ; l: Now, it is enough to prove that each Qi has a universal vertex. Consider two cases. Case 1. Qi does not contain the Sun Sr , r 4, i D 1; : : : ; l: Hence each cluster Qi is strongly chordal and Qi has a universal vertex xi , i D 1; : : : ; l. Thus the set fx1 ; : : : ; xl g is dominating in G; i.e., .G/ l D cl2 .G/: Case 2. For some i , 1 i l, Qi contains a Sun Sr , r 4. Let us denote Qi and Sr briefly by Q and S , respectively, and let V .S / D fu1 ; : : : ; ur ; w1 ; : : : ; wr g with GŒfu1 ; : : : ; ur g D Kr . Consider three vertices in W with consecutive labels: wt ; wt C1 ; wt C2 . It is easy to see that dS .wt ; wt C2 / D 3
2
Partitions of Graphs
39
and therefore in S there is an induced path wt ut C1 ut C2 wt C2 of length three. Since dQ .wt ; wt C2 / D 2, then there is x 2 V .Q/ V .S /, a common neighbour of both wt and wt C2 . Since Q is chordal, the vertex x has to be adjacent to ut C1 and ut C2 . If wt C1 x … E, then the set fwt ; ut C1 ; wt C1 ; ut C2 ; wt C2 ; xg induces the Haj´os graph, a contradiction. Thus wt C1 x 2 E. It holds for any vertices with consecutive labels in the independent set W , thus x is adjacent to all vertices of S . Hence for each pair of vertices wi and wi C2 there is a common neighbour y 2 V .Q/ V .S / with the same properties as above, possible x D y. Let X D fx1 ; : : : ; xt g be a set of vertices of V .Q/ V .S / each of which dominates V .S /. If xi xj … E, then any two vertices of W with consecutive labels, say w1 ; w2 together with xi ; xj , induce in Q a cycle C4 , which contradicts the chordality. It follows that the subgraph induced in Q by the set fx1 ; : : : ; xt g is a clique. Let Y D V .Q/ .V .S / [ X /. If jY j 1, then any vertex of X is a universal vertex of Q. Assume that jY j 2: Let y1 ; y2 2 Y and suppose that y1 ; y2 do not have a common neighbour in Y . Then either d.y1 ; y2 / 3 or y1 y2 2 E. In the first case, we have a contradiction; in the second, there is in Q an induced cycle C4 , which contradicts chordality of Q. Hence any two vertices of Y have a common neighbour in X . Since QŒX [ Y 2 HCHC, the Helly property implies that there is a vertex x 2 X such that xy 2 E for all y 2 Y . Thus the vertex x is a universal vertex of Q, which completes the proof. t u Problem 2.2.10. VERTEX COVER Given a graph G D .V; E/ and an integer k, 1 k jV j: Is there a vertex cover of cardinality k for G, i.e., a subset V 0 of V with jV 0 j k such that V 0 contains at least one vertex from every edge in E? Theorem 2.2.11. Problem DOMINATING SET is NP-complete for HCHC graphs. Proof. We transform the VERTEX COVER problem which remains NP-complete even when restricted to planar triangle free graphs [35] to DOMINATION SET in HCHC, in the following way: Let G D .V; E/ be a planar triangle-free graph. Construct the graph H D .U; F / with the vertex set U D V [ E and the edge set F D fvv0 W v; v0 2 V; v ¤ v0 g [ fve W v 2 V; e 2 E and v 2 eg: Claim 1. H 2 HCHC. Proof. It is easy to see that H is chordal. Now it is enough to prove that H does not contain the Sun S3 as an induced subgraph. On the contrary, suppose that S3 H . It implies that w1 ; w2 ; w3 and u1 ; u2 ; u3 of S3 correspond to some vertices, say e1 ; e2 ; e3 and v1 ; v2 ; v3 , respectively, in H . By the above and the construction of H it follows that the graph G contains a triangle induced by the set fv1 ; v2 ; v3 g, a contradiction. t u Claim 2. G has a vertex cover of cardinality d if and only if H has a dominating set of cardinality d .
40
M. Borowiecki
Fig. 2.3 Graph classes and domination set complexity
HCH
Perfect
Chordal
Balanced HCHC NP-c ?
BC
P
SC
Interval
Proof. Let C be a vertex cover of G with jC j D d . Since H ŒV is a clique, every vertex of V is dominated by each vertex of C . Every e 2 E is covered by some v in C , thus e is dominated by v in H . Therefore C is a dominating set of cardinality d in H . Suppose now that H has a dominating set D of cardinality d . If D V , then D is also a vertex cover of G. (Each vertex e 2 E in H is dominated by some element of D, thus each e 2 E.G/ has at least one vertex in D.) If D \ E ¤ ;, i.e., say e D vv0 2 E is in D we may replace e by v or v0 and get a new dominating set D 0 of the same cardinality. Applying this procedure to all e 2 D \ E we will finally get a dominating set D V with jD j D d . t u Hence the NP-completeness of the DOMINATING SET problem in HCHC follows from the VERTEX COVER problem for planar triangle-free graphs. t u
2.2.5 Balanced Graphs A hypergraph H is said to be balanced if every odd cycle has an edge containing three vertices of the cycle; see [4]. In other words, H is balanced if and only if its incidence matrix contains no square submatrix of an odd cycle. A graph G is called balanced if its clique hypergraph is balanced.
2
Partitions of Graphs
41
Theorem 2.2.12 ([28]). There is a polynomial-time recognition algorithm for balanced graphs. Let us denote the class of balanced chordal graphs by BC. Theorem 2.2.13 ([45]). A graph G 2 BC if and only if it is odd Sun-free chordal. From Theorem 2.2.9 we have Corollary 2.2.14. Let G 2 BC. Then cl2 .G/ D .G/: Open Problem 2.2.15. Problem DOMINATING SET remains open for the class BC.
2.3 Matching Cutset A set M of independent edges in a graph G is called a matching. A set F E.G/ is a cutset in G if G F has more components than G. If a cutset is a matching of G then it is called a matching cutset. The problem of recognizing graphs with a matching cutset is well studied in the literature. For a survey of what is known to date, see [20, 27, 44, 58]. Historically, the first theorem for matching cutset complexity was given by Chvat´al [25]. We list some important results concerning this problem. Some of them deal with well-known classes of graphs. Theorem 2.3.1 ([25]). It is NP-complete to recognize graphs with a matching cutset even if the input is restricted to graphs with D 4. The next two results yield conditions on vertex degrees of bipartite graphs sufficient to guarantee NP-completeness of matching cutsets. Theorem 2.3.2 ([49]). MATCHING CUTSET is NP-complete, even if the input is restricted to bipartite graphs of minimum degree 2. Theorem 2.3.3 ([44]). MATCHING CUTSET is NP-complete, even if the input is restricted to bipartite graphs with one colour class consisting only of vertices of degree 3 and the other colour class consisting only of vertices of degree 4. Below are presented a few graph classes for which the MATCHING CUTSET problem is polynomial. The line graph of G, denoted by L.G/, is the graph the vertex set of which is the edge set of G and two vertices of L.G/ are adjacent if and only if, as edges in G, they are adjacent. A graph H is called a line graph if there is a graph G such that H is isomorphic to L.G/.
42
M. Borowiecki
Theorem 2.3.4 ([49]). Let G D .V; E/ be a line graph. Then we can determine in O.jEj/ time whether G has a matching cutset. Theorem 2.3.5 ([49]). Let G D .V; E/ be a graph without induced cycles of length 4. Then we can determine in O.jV j3 jEj/ time whether G has a matching cutset. Theorem 2.3.6 ([16]). Let G be a graph with diam.G/ D 2. Then the MATCHING CUTSET problem for G can be solved in polynomial time. Open Problem 2.3.7. Find k which is a boundary that separates NP-complete instances of diameter k of the MATCHING CUTSET problem from polynomially solvable ones.
2.4 Acyclic Colourings Acyclic colourings have been studied extensively over the past 30 years. Several authors have been able to determine a .P/ for some classes P of graphs such as graphs of maximum degree 3, considered by Gr˝unbaum in [37] and of maximum degree 4, studied by Burstein in [24]. The acyclic chromatic number of planar graphs was determined by Borodin in 1979; see [8] for details. Planar graphs with “large” girth, outerplanar, and 1-planar graphs were also considered; see, for instance, [9, 10].
2.4.1 Selected Results Theorem 2.4.1 ([42]). It is an NP-complete problem to decide for a given graph G and k 3 if the acyclic chromatic number of G is at most k. In 2004 Skulrattanakulchai [54] proved that there is a linear time algorithm that acyclically colours any graph of maximum degree 3 in four colours. Theorem 2.4.2 ([34]). For any graph G of maximum degree 5, a .G/ 9 and there exists a linear time algorithm to acyclically colour G in at most nine colours. Authors suspect that the upper bound of nine colours in the case .G/ D 5 is not tight. Theorem 2.4.3 ([37]). a .S 3 / 4: Theorem 2.4.4 ([8]). a .T 3 / 5:
2
Partitions of Graphs
43
The bound a .S 3 / 4 proved by Gr˝unbaum in Theorem 2.4.3 is the best possible. Moreover, Kostochka and Mel’nikov [43] proved that there are bipartite 2-degenerate planar graphs which are not acyclically 4-colourable. Acyclic colourings turned out to be useful for obtaining results about other types of colourings, see [39].
2.4.2 Brooks-Type Results The well-known theorem of Brooks [22] relates the chromatic number of a graph to its maximum degree. Theorem 2.4.5. For any connected graph G, .G/ .G/ C 1 with equality if and only if either .G/ D 2 and G is an odd cycle or .G/ ¤ 2 and G is a complete graph. There are many generalisations of the Brooks theorem. These theorems are called Brooks-type results. For the acyclic chromatic number finding a sharp upper bound as a function of maximum degree seems to be an extremely hard problem. Theorem 2.4.6 ([3]). a .S / C4=3 : Theorem 2.4.7 ([34]). For a graph G of maximum degree 5 we have a .G/
. 1/ : 2
Open Problem 2.4.8. Find a sharp upper bound for a .G/ as a function of .G/:
2.4.3 Improper Acyclic Colouring Studies have begun in [7] of acyclic colourings of graphs with respect to hereditary properties of graphs. Namely, they have considered outerplanar, planar graphs, and graphs with bounded degree; see [6, 7]. They call such acyclic colouring improper. Formally, an improper acyclic colouring of graphs is an M -partition with mii D P i and mij D D1 for i ¤ j , 1 i; j k. We denote it briefly by ..P 1 ; : : : ; P k /; D1 /. The class of graphs having ..P 1 ; : : : ; P k /; D1 /-partition is denoted by P1 ˇ ˇ Pk.
44
M. Borowiecki
An additive hereditary property R is said to be acyclic reducible in La if there are nontrivial additive hereditary properties P 1 ; P 2 such that R D P 1 ˇ P 2 and acyclic irreducible in La , otherwise. It is easy to see that the smallest acyclic reducible property in La is the property O ˇ O D D1 . Obviously, D 1 is the unique minimal acyclic reducible bound for P if and only if P D 1 . A maximal outerplanar graph G with at least three vertices is called a 2-path of order n D 2p, if G consists of two paths P1 D .x1 ; x2 ; : : : ; xp /, P2 D .y1 ; y2 ; : : : ; yp / and additional edges: xi yi , i D 1; : : : ; p and xj yj C1 for j D 1; : : : ; p 1. For an odd n D 2p 1 a 2-path H is defined as H D G xp , where G is a 2-path of even order. A 2-path of order n is denoted by Pn2 . A maximal outerplanar graph G with at least three vertices is called a fan of order n, if G is obtained from a star K1;n1 by joining all vertices of degree one by a path. A fan of order n is denoted by Fn . Additionally we assume that the graph K1 and K2 is a trivial 2-path and a trivial fan. For each n 5 there is exactly one (up to isomorphism) maximal outerplanar graph which is a 2-path and a fan. Some acyclic reducible bounds for the class of outerplanar graphs can be found in [13]. Theorem 2.4.9 ([13]). T2 O ˇ Forb.S3 ; P62 /; T2 O ˇ Forb.S3 ; F6 /: We have an interesting proposition which characterises fans and 2-paths in the class of maximal outerplanar graphs. It was used in the proof of the next corollary and theorem and gives some light on an open problem formulated at the end of this section. Proposition 2.4.10 ([13]). Let G be a maximal outerplanar graph of order n 3. Then (a) G is a fan if and only if neither S3 G nor P62 G. (b) G is a 2-path if and only if neither S3 G nor F6 G. Let us recall that a block of a given graph G is defined to be a maximal connected subgraph of G without a cutvertex. A fan .2-path/ tree is a connected graph G every block of which is a fan (2-path). Let us define the property F T (PT ) as the class of all fan (2-path) trees and their subgraphs. Both classes are hereditary and form a proper subclass of all outerplanar graphs. From the definition of F T it follows that S3 and P62 do not belong to F T . Similarly, S3 and F6 do not belong to PT . It implies the following corollary.
2
Partitions of Graphs
45
Corollary 2.4.11. F T Forb.S3 ; P62 /; PT Forb.S3 ; F6 /: Because of the above corollary, the next theorem gives two acyclic reducible bounds for outerplanar graphs which are better than those in Theorem 2.4.9. Theorem 2.4.12. T 2 O ˇ FT ; T 2 O ˇ PT : Open Problem 2.4.13. Find at least one minimal acyclic reducible bound for the class of outerplanar graphs. Theorem 2.4.14 ([7]). S 3 S 1 ˇ S 1 ˇ S 1: Conjecture 2.4.15 ([7]). S 3 S 2 ˇ S 2: Theorem 2.4.16 ([14]). 1. Boiron, Sopena, and Vignal’s conjecture is true; i.e., S 3 S 2 ˇ S 2 holds. 2. There is a polynomial time algorithm to acyclically .S 2 ; S 2 /-colour each graph G 2 S 2. 3. It is NP-complete to determine whether a graph G 2 S 4 has an acyclic .S 2 ; S 2 /colouring. The first statement of Theorem 2.4.16 cannot be generalized for k D 4. It was observed by Hałuszczak [Hałuszczak M, 2007, private communication]. But this observation can be extended for all k 4. Theorem 2.4.17. S k 6 S k1 ˇ S k1 , for k 4: Proof. Let G D Ck C Dk2 , where by Dn the edgeless graph of order n is denoted; i.e., the graph G is obtained by joining each vertex of cycle of order k with each vertex of edgeless graph of order k 2. Obviously, the graph G 2 S k but G … S k1 ˇ S k1 . We left an easy proof of that fact to a reader. t u Some other type results on acyclic colouring of graphs are presented in [6].
References 1. Abbas N (1995) Graph clustering: complexity, sequential and parallel algorithms. Ph.D. thesis, University of Alberta, Edmonton, Canada 2. Alekseev VE, Farrugia A, Lozin VV (2004) New results on generalized graph coloring. Discrete Math Theor Comput Sci 6:215–222
46
M. Borowiecki
3. Alon N, McDiarmid C, Reed B (1991) Acyclic coloring of graphs. Random Struct Algorithm 2:277–288 4. Berge C (1987) Hypergraphs. Gauthier-Villars, Paris 5. Berger A (2001) Minimal forbidden subgraphs of reducible graph properties. Discuss Math Graph Theory 21:111–117 6. Boiron P, Sopena E, Vignal L (1999) Acyclic improper colorings of graphs. J Graph Theory 32:97–107 7. Boiron P, Sopena E, Vignal L (1999) Acyclic improper colourings of graphs with bounded degree. DIMACS Series Discrete Math Theor Comput Sci 49:1–9 8. Borodin OV (1979) On acyclic colorings of planar graphs. Discrete Math 25:211–236 9. Borodin OV, Kostochka AV, Raspaud A, Sopena E (2001) Acyclic colourings of 1-planar graphs. Discrete Appl Math 114:29–41 10. Borodin OV, Kostochka AV, Woodall DR (1999) Acyclic colorings of planar graphs with large girth. J Lond Math Soc 60:344–352 11. Borowiecki M, Broere I, Frick M, Mih´ok P, Semaniˇsin G (1997) A survey of hereditary properties of graphs. Discuss Math Graph Theory 17:5–50 12. Borowiecki M, Broere I, Mih´ok P (2000) Minimal reducible bounds for planar graphs. Discrete Math 212:19–27 13. Borowiecki M, Fiedorowicz A (2006) On partitions of hereditary properties of graphs. Discuss Math Graph Theor 26:377–387 14. Borowiecki M, Fiedorowicz A, Jesse-J´ozefczyk K, Sidorowicz E (2010) Acyclic colourings of graphs with bounded degree. Discrete Math Theor Comput Sci 12:59–74 15. Borowiecki M, Hałuszczak M, Skowro´nska M (2000) Minimal reducible bounds for 1-nonouterplanar graphs. Discrete Math 219:9–15 16. Borowiecki M, Jesse-J´ozefczyk K (2008) Matching cutsets in graphs of diameter 2. Theor Comput Sci 407:574–582 17. Borowiecki M, Mih´ok P (1991) Hereditary properties of graphs. In: Kulli VR (ed) Advances in graph theory. Vishwa International Publication, Gulbarga, pp 41–68 18. Borowiecki P (1993) P -bipartitions of graphs. Vishwa Int J Graph Theory 2:109–116 19. Borowiecki P, Ivanˇco J (1997) P -bipartitions of minor hereditary properties. Discuss Math Graph Theory 17:89–93 20. Brandst˝adt A, Le VB, Szymczak T (1998) The complexity of some problems related to GRAPH 3-COLORABILITY. Discrete Appl Math 89:59–73 21. Broere I, Mynhardt CM (1984) Generalized colorings of outerplanar and planar graphs. In: Proceedings of the fifth international conference on the theory and applications of graphs with special emphasis on algorithms and computer science. Wiley-Interscience, New York, pp 151–161 22. Brooks RL (1941) On colouring the nodes of a network. Proc Camb Philos Soc 37:194–197 23. Brucker P (1978) On the complexity of clustering problems. In: Henn R, Korte B, Oettli W (eds) Optimization and operations research. Lecture notes in economics and mathematical systems, vol 157. Springer, New York, pp 45–54 24. Burstein MI (1979) Every 4-valent graph has an acyclic 5-coloring. Soobˇscˇ . Akad Gruzin SSR 93:21–24 (in Russian) 25. Chv´atal V (1984) Recognizing decomposable graphs. J Graph Theory 8:51–53 26. Chartrand G, Kronk HV (1969) The point arboricity of planar graphs. J Lond Math Soc 44:612–616 27. Coreli DG, Fonlupt J (1993) Stable set bonding in perfect graphs and parity graphs. J Combin Theory B 59:1–14 28. Dahlhaus E, Manuel P, Miller M (1998) Maximum h-colourable subgraph problem in balanced graphs. Inform Process Lett 65:301–303 29. Deogun JS, Kratsch D, Steiner G (1997) An approximation algorithm for clustering graphs with dominating diametral path. Inform Process Lett 61:121–127 30. Diestel R (1997) Graph theory. Springer, Berlin 31. Faber M (1983) Characterizations of strongly chordal graphs. Discrete Math 43:173–189
2
Partitions of Graphs
47
32. Farley A, Hedetniemi S, Proskurowski A (1981) Partitioning trees: matching, domination and maximum diameter. Int J Comput Inform Sci 10:55–61 33. Farrugia A (2004) Vertex-partitioning into fixed additive induced-hereditary properties is NPhard. Electron J Combinator 11, #R46 34. Fertin G, Raspaud A (2008) Acyclic coloring of graphs of maximum degree five: nine colors are enough. Inform Process Lett 105:65–72 35. Garey MR, Johnson DS, Stockmeyer L (1976) Some simplified NP-complete graph problems. Theor Comput Sci 1:237–267 36. Goddard W (1991) Acyclic colorings of planar graphs. Discrete Math 91:91–94 37. Gr˝unbaum B (1973) Acyclic coloring of planar graphs. Israel J Math 14:390–412 38. Hakimi SL, Schmeichel E, Weinstein J (1990) Partitioning planar graphs into independent sets and forests. Congr Numer 78:109–118 39. Jensen TR, Toft B (1995) Graph coloring problems. Wiley-Interscience, New York 40. Karp RM (1972) Reducibility among combinatorial problems. In: Miller RE, Thatcher JW (eds) Complexity of computer computations. Plenum, New York, pp 85–104 41. Kershenbaum A (1993) Telecommunications network design algorithms. McGraw-Hill, New York 42. Kostochka AV (1978) Ph.D. thesis, Novosibirsk 43. Kostochka AV, Mel’nikov LS (1976) Note to the paper of Gr˝unbaum on acyclic colorings. Discrete Math 14:403–406 44. Lee VB, Randerath B (2003) On stable cutsets in line graphs. Theor Comput Sci 301:463–475 45. Lehel J, Tuza Zs (1986) Neighborhood perfect graphs. Discrete Math 61:93–101 46. Mahadev NVR, Peled VN (1995) Threshold graphs and related topics. Ann Discrete Math 56:170 47. Mih´ok P (1996) On the minimal reducible bound for outerplanar and planar graphs. Discrete Math 150:431–435 48. Mih´ok P (2001) Minimal reducible bounds for the class of k-degenerate graphs. Discrete Math 236:273–279 49. Moshi AM (1989) Matching cutsets in graphs. J Graph Theory 13:527–536 50. Neˇsetˇril J, R˝odl V (1976) Partitions of vertices. Comment Math Univ Carolinae 17:85–95 51. Poh KS (1990) On the linear vertex-arboricity of a planar graph. J Graph Theory 14:73–75 52. Semaniˇsin G (2004) Minimal reducible bounds for induced-hereditary properties. Discrete Math 286:163–170 53. Sharan R, Maron-Katz A, Shamir R (2003) CLICK and EXPANDER: a system for clustering and visualizing gene expression data. Bioinformatics 19:1787–1799 54. Skulrattanakulchai S (2004) Acyclic colorings of subcubic graphs. Inform Process Lett 92:161–167 55. Stein SK (1971) B-sets and planar graphs. Pac J Math 37:217–224 56. Thomassen C (1995) Decomposing a planar graph into degenerate graphs. J Combin Theory B 65:305–314 57. Tou JT, Gonzalez RC (1974) Pattern recognition principles. Addison Wesley, Reading, MA 58. Tucker A (1983) Coloring graphs with stable cutsets. J Combin Theory B 34:258–267 59. West DB (2001) Introduction to graph theory, 2nd edn. Prentice Hall, Upper Saddle River 60. Wu Z, Leahy R (1993) An optimal graph theoretic approach to data clustering: theory and its application to image segmentation. IEEE Trans Pattern Anal Mach Intell 15:1101–1113
Chapter 3
Distance in Graphs Wayne Goddard and Ortrud R. Oellermann
Abstract The distance between two vertices is the basis of the definition of several graph parameters including diameter, radius, average distance and metric dimension. These invariants are examined, especially how they relate to one another and to other graph invariants and their behaviour in certain graph classes. We also discuss characterizations of graph classes described in terms of distance or shortest paths. Finally, generalizations are considered. Keywords Graph Distance Diameter Radius Steiner distance MSC2000: Primary 05C12; Secondary 05C20, 05C38
3.1 Overview of Chapter The distance between two vertices in a graph is a simple but surprisingly useful notion. It has led to the definition of several graph parameters such as the diameter, the radius, the average distance and the metric dimension. In this chapter we examine these invariants; how they relate to one another and other graph invariants and their behaviour in certain graph classes. We also discuss characterizations of graph classes that have properties that are described in terms of distance or shortest paths. We later consider generalizations of shortest paths connecting pairs of vertices to shortest trees, called Steiner trees, that connect three or more vertices.
W. Goddard () School of Computing and Department of Mathematical Sciences, Clemson University, Clemson, SC 29634-1906, USA e-mail:
[email protected]
M. Dehmer (ed.), Structural Analysis of Complex Networks, c Springer Science+Business Media, LLC 2011 DOI 10.1007/978-0-8176-4789-6 3,
49
50
W. Goddard and O.R. Oellermann
3.2 Distance, Diameter and Radius A path in a graph is a sequence of distinct vertices, such that adjacent vertices in the sequence are adjacent in the graph. For an unweighted graph, the length of a path is the number of edges on the path. For an (edge) weighted graph, the length of a path is the sum of the weights of the edges on the path. We assume that all weights are nonnegative and that all graphs are connected. We start with undirected graphs. The distance between two vertices u and v, denoted d.u; v/, is the length of a shortest u v path, also called a u v geodesic. The distance function is a metric on the vertex set of a (weighted) graph G. In particular, it satisfies the triangle inequality: d.a; b/ d.a; c/ C d.c; b/ for all vertices a; b; c of G. This follows from the fact that, if you want to get from a to b, then one possibility is to go via vertex c.
3.2.1 Diameter and Radius Two of the most commonly observed parameters of a graph are its radius and diameter. The diameter of a connected graph G, denoted diam.G/, is the maximum distance between two vertices. The eccentricity of a vertex is the maximum distance from it to any other vertex. The radius, denoted rad.G/, is the minimum eccentricity among all vertices of G. Of course the diameter is the maximum eccentricity among all vertices. For a (weighted) undirected graph G: rad.G/ diam.G/ 2 rad.G/: The upper bound follows from the triangle inequality, where c is a vertex of minimum eccentricity. The radius and diameter are easily computed for simple graphs. Fact 1 1. Complete graphs: diam.Kn / D rad.Kn / D 1 (for n 2). 2. Complete bipartite graphs: diam.Km;n / D rad.Km;n / D 2 (if n or m is at least 2). 3. Path on n vertices: diam.Pn / D n 1; rad.Pn / D d.n 1/=2e. 4. Cycle on n vertices: diam.Cn / D rad.Cn / D bn=2c. Note that cycles and complete graphs are vertex-transitive, so the radius and diameter are automatically the same (every vertex has the same eccentricity). The centre C.G/ is the subgraph induced by the set of vertices of minimum eccentricity. Graphs G where rad.G/ D diam.G/ are called self-centred.
3
Distance in Graphs
51
A famous result, due originally to Jordan [44], is that: Fact 2 For trees T , the diameter equals either 2 rad.T / or 2 rad.T / 1. In the first case the center is a single vertex, and in the second the centre is a pair of adjacent vertices. The derivative T 0 of a tree T is the tree obtained by deleting the leaves of T . Suppose the kth derivative T .k/ of T has been defined for some k 1. Then the .k C 1/st derivative of T is defined by T .kC1/ D .T .k/ /0 . It can be shown that the centre of a tree is T .bdiam.T /=2c/ . For general graphs, Harary and Norman [40] showed the following. Fact 3 The centre of a graph forms a connected subgraph, and is contained inside a block of the graph. In general, there are no structural restrictions on the centre of a graph. Indeed, Hedetniemi (see [9]) showed that every graph is the centre of some graph.
3.2.2 Bounds for the Radius and Diameter We look next at upper bounds involving the minimum degree ı or maximum degree . Theorem 1. For a graph G of order n: 1. diam.G/ n .G/ C 1. 2. [71] rad.G/ .n .G//=2 C 1. 3. If ı.G/ n=2, then diam.G/ 2. And these bounds are sharp. One can also consider the problem of maximizing or minimizing these parameters given the number of vertices and edges. Both the radius and diameter are minimized by the star (and any supergraph thereof), so that case is not interesting. For a given number n of vertices and m n 1 of edges, the diameter and radius are maximized by the “path-complete” and the “cycle-complete” graphs, respectively. These are defined as follows. A cycle-complete graph is obtained by taking disjoint copies of a cycle of even length and a complete graph, and joining three consecutive vertices of the cycle to all vertices in the complete graph. The radius is half the length of the cycle. This graph was introduced by Vizing [71]. An example is given in Fig. 3.1. A path-complete graph is obtained by taking disjoint copies of a path and complete graph, and joining an end-vertex of the path to one or more vertices of the complete graph. It is not hard to show that there is a unique path-complete graph
52
W. Goddard and O.R. Oellermann
Fig. 3.1 A cycle-complete graph
Fig. 3.2 The path-complete graph PK 8;11
with n vertices and m edges; this is denoted as PK n;m . This graph was introduced by Harary [38]. An example is given in Fig. 3.2. Theorem 2. 1. [71] For a given number n of vertices and m n 1 of edges, the radius is maximized by the cycle-complete graphs. 2. [38] For a given number n of vertices and m n 1 of edges, the diameter is maximized by the path-complete graph PK n;m . It is not hard to show that if a graph G has large diameter, then its complement GN has small diameter: N 2. Fact 4 1. If diam.G/ > 3, then diam.G/ N 2. If diam.G/ D 3, then diam.G/ 3.
3.2.3 Changes in Diameter and Radius with Edge and Vertex Removal Removing an edge can never decrease the radius or the diameter of a graph. Indeed, removing a bridge disconnects the graph. So we consider cyclic edges. Fact 5 If e is a cyclic edge of graph G, then rad.G/ rad.G e/ 2 rad.G/ and diam.G/ diam.G e/ 2 diam.G/. Both upper bounds are attainable. Removing a cyclic edge can easily double the diameter; for example, it does so in the odd cycles. Plesn´ık [61] showed that if every
3
Distance in Graphs
53
Fig. 3.3 Large increase in the diameter/radius of G v
v
edge’s removal doubles the diameter, then the graph is a Moore graph, i.e., a graph of diameter d and girth 2d C 1 for some d 1. For example, Moore graphs include the complete graphs, the odd cycles, the Petersen graph and the Hoffman–Singleton graph (see [7]). Removing a cyclic edge can also double the radius. Such a graph can be constructed by taking two equal-sized cycles, and sticking them together along one edge e. There is a natural spanning tree with the same radius as the original graph, sometimes called a breadth-first search tree. This tree has diameter at most double its radius, and hence at most double the original radius. Buckley and Lewinter [8] determined which graphs have a diameter-preserving spanning tree. Removing a vertex can both increase and decrease these parameters. Removing a cut-vertex from a disconnected graph results in a disconnected graph, so we do not consider such vertices. Fact 6 If v is a non-cut-vertex of graph G, then rad.G v/ rad.G/ 1 and diam.G v/ diam.G/ 1. The above bound is attained, for example, by an even-order path where v is an end-vertex of the path. There is no upper bound on rad.G v/ or diam.G v/ if G is 2-connected. To see this, let G be obtained from m cycles Ci W vi1 vi2 : : : vi2d C1 vi1 for 1 i m by identifying the vertices vi1 for 1 i m into a vertex v and then adding the edges vi2d C1 v.i C1/2 for i D 1; 2; : : : ; m 1. Then diam.G/ D 2d and diam.G v/ D 2d m1. Since m can be made as large as we wish, there is no upper bound on diam.G v/ in terms of diam.G/. Figure 3.3 shows this construction with d D 2 and m D 4.
3.2.4 Matrices and Walks A walk is a sequence of not necessarily distinct vertices such that each vertex in the sequence except the first one is adjacent to the previous one. Suppose the vertices of a graph G are labeled v1 ; : : : ; vn . Then the adjacency matrix A of G is defined as the n n matrix whose .i; j /-th entry is 1 if there is an edge joining vertices vi and vj , and 0 otherwise. The Laplacian matrix is defined as A D where D is the
54
W. Goddard and O.R. Oellermann
diagonal matrix whose .i; i /-entry is the degree of the vertex vi . The eigenvalues of A are referred to as the eigenvalues of G, and the eigenvalues of L as the Laplacian eigenvalues of G. The following fact is well-known: Fact 7 The .i; j /-th entry of the power Ak gives the number of walks of length k from vi to vj . Bounds on the diameter of a graph in terms of the number of eigenvalues of these matrices follow from Fact 7 (see, for example, [17]): Theorem 3. Let G be a connected graph and b the number of distinct eigenvalues of G. Then diam.G/ b 1: The same result holds if b is the number of distinct Laplacian eigenvalues of G.
3.3 Other Measures of Centrality Apart from the centre of a graph, there are several other centrality measures. These have many applications. The centre is for emergency facility location: the response time must be minimized in the worst case. For biological graphs, the centre vertices might be the most important (see, for example, [42]). Another measure of centrality is the “median” of a graph. The status .v/ of a vertex v is the sum of the distances from v to all other vertices. The vertices having minimum status .v/ form the median of the graph, which is denoted by M.G/. For example, the median might be a good place to locate a mall: the average driving distance is minimized. There is no intrinsic connection between the centre and the median. Indeed, they can be arbitrarily far apart. Slater [67] considered whether there are other measures of centrality that “connect” the centre and the median of a graph. He defined for a graph G, integer k 2 and vertex u of G, rk .u/ D max
nX
o d.u; s/ j S V .G/; jS j D k :
s2S
Thus, rk .u/ is the sum of the k largest vertex distances to u. In particular, r1 .u/ is its eccentricity, and rn1 .u/ is its status. The k-centrum, C.GI k/, of G is the subgraph induced by those vertices u for which rk .u/ is a minimum. Thus, C.GI 2/ D C.G/ and C.GI n 1/ D M.G/. It is shown in [67] that the k-centrum of every tree consists of a single vertex or a pair of adjacent vertices. Further, every vertex on the shortest path from the centre to the median of a tree belongs to the k-centrum for some k between 1 and n. In the case of trees, another centrality measure is well known. Suppose T is a tree and v a vertex of T . Then a branch at v is a maximal subtree containing v as a leaf.
3
Distance in Graphs
55
The weight at a vertex v of T is the maximum number of edges in any branch at v. A vertex of T is a centroid vertex of T if it has minimum weight among all vertices of T and the subgraph induced by the centroid vertices is called the centroid of T . That is, a centroid vertex is one whose removal leaves the smallest maximum component order. However, Zelinka [77] observed that the centroid and the median coincide. Another centrality idea is a “central path”. This concept can be defined in one of two ways that parallel the centre and median, respectively. If H is a subgraph of a graph G and v is any vertex of G, then the distance from v to H is the minimum distance from v to a vertex of H . The eccentricity of H is the distance of a vertex v farthest from H , and the status of H is the sum of the distances of every vertex of G to H . A path P is a path centre of G if P has minimum eccentricity among all paths of G and has minimum length among all such paths. Similarly the path median of G is a path of minimum status in G. The path median of a network may indicate a good choice for a subway line, for example; in that case many individuals will use this line, so it is desirable that the average distance from the users’ homes to the line is minimized. On the other hand the problem of finding the path centre of a network has application to the problem of building a highway between two major cities in such a way that the furthest distance from the highway to any town in a collection of other “important” towns is minimized. The problem of finding the path centre of a tree was solved independently in [16, 68]. Further types of centres are discussed in the book [7]. See [32] for more of the early history of centrality.
3.4 Special Graph Classes 3.4.1 Chordal Graphs A chordal graph is one where every cycle of length greater than 3 has a chord. For example, trees and maximal outerplanar graphs are chordal. A simplicial vertex is one whose neighbourhood is complete. It was first shown by Dirac [21] and later by Lekkerkerker and Boland [49] that every chordal graph has a simplicial vertex (indeed at least two such vertices). Since induced subgraphs of chordal graphs are still chordal, chordal graphs have a simplicial elimination ordering; that is, an ordering v1 ; v2 ; : : : ; vn of the vertices such that the neighbourhood of vi is complete in the induced graph hfvi ; vi C1 ; : : : ; vn gi. Using induction one can show that every graph that has a simplicial elimination ordering is chordal. The centre of chordal graphs was investigated by Laskar and Shier [48]. For example, they showed that the centre of a chordal graph is connected, and provided the following generalization of Fact 2. Theorem 4. For a chordal graph G, diam.G/ 2 rad.G/ 1.
56
W. Goddard and O.R. Oellermann
3.4.2 Cartesian Products Distance behaves nicely in Cartesian products of graphs. The Cartesian product of two graphs F D .V1 ; E1 / and H D .V2 ; E2 /, written F H , has vertex set V1 V2 , and two vertices .u1 ; v1 / and .u2 ; v2 / are adjacent if either u1 D u2 and v1 v2 2 E2 or v1 D v2 and u1 u2 2 E1 . For example, the product K4 K2 is shown in Fig. 3.5. If G D F H , then the distance between two vertices .u1 ; v1 / and .u2 ; v2 / in G is the sum of the distances dF .u1 ; u2 / C dH .v1 ; v2 /. The n-cube Qn (n 1) is defined using Cartesian products of graphs as follows. Q1 Š K2 ; and for k 1, QkC1 Š Qk K2 , i.e., QkC1 is the Cartesian product of Qk and K2 . Mulder [56] showed that the n-cube possesses interesting structural properties that can be described using distance notions. To this end, let u; v be vertices in a graph G. Then the geodesic interval between u and v, denoted by Ig Œu; v, is the collection of all vertices that belong to some u v-geodesic (shortest path). A graph G is a median graph if for any three vertices u; v; w of G, jIg Œu; v \ Ig Œu; w \ Ig Œv; wj D 1. For example, the 3-cube, shown in Fig. 3.4, is a median graph. The next result was established in [56]. Theorem 5. A graph G is isomorphic to Qn if and only if G is a median graph with maximum degree n such that G contains two vertices at distance d i am.G/ apart at least one of which has degree n. Hamming graphs are Cartesian products of complete graphs. Suppose fa1 ; a2 ; : : : ; an g are positive integers and that Ai D f0; 1; : : : ; ai 1 g. Then the Hamming graph Ha1 ;:::;an is the graph with vertex set the Cartesian product A1 A2 An in which two vertices are joined by an edge if and only if the corresponding vectors differ in exactly one coordinate. So Ha1 ;a2 :::;an D Ka1 Ka2 Kan and the n-cube is the Hamming graph with a1 D a2 D D an D 2. The Hamming graph H4;2 is shown in Fig. 3.5. The distance between two vertices is equal to the Hamming distance between these vertices, namely, the number of coordinates in which the corresponding vectors differ. Hamming graphs are used in coding theory and have applications to other distance invariants as discussed in Sect. 3.8. Mulder [55] extended Theorem 5 to characterize Hamming graphs in terms of intervals and forbidden subgraphs.
Fig. 3.4 The 3-cube: a median graph
3
Distance in Graphs
57 11
Fig. 3.5 The Hamming graph H4;2 10
21
20
10
00
31
30
3.4.3 Distance Hereditary Graphs Howorka [41] defined a graph G to be distance hereditary if for each connected induced subgraph H of G and every pair u; v of vertices in H , dH .u; v/ D dG .u; v/. Howorka [41] provided several conditions that characterize distance hereditary graphs. Theorem 6. For a graph G the following are equivalent: 1. 2. 3. 4.
G is distance hereditary. Every induced path of G is a geodesic. Every subpath of a cycle C of more than half C ’s length is induced. Every cycle C of length at least 5 has a pair of chords e1 ; e2 of C such that C C fe1 ; e2 g is homeomorphic with K4 .
Distance hereditary graphs form a subclass of the perfect graphs (graphs where every induced subgraph has equal clique and chromatic numbers), and several NP-hard problems have efficient solutions for distance hereditary graphs. One such problem is discussed in Sect. 3.10. Another characterization of distance hereditary graphs that lends itself well to algorithmic applications was given independently by Bandelt and Mulder [2] and Hammer and Maffray [37]. A graph H is said to be obtained from a graph G by (1) adding a leaf v to some vertex v0 of G, if v is added to G and joined to v0 by an edge; and (2) by adding a twin v to some vertex v0 of G, if v is added to G and if v is joined to the vertices in the open or closed neighbourhood of v0 in G, i.e., v is joined to the vertices in NG .v0 / or NG .v0 / [ fv0 g, respectively. Theorem 7. A graph G is distance hereditary if and only if there is a sequence of graphs G1 ; G2 ; : : : ; Gn1 such that G1 Š K2 , G Š Gn1 and for 2 i n 1, Gi is obtained from Gi 1 by adding a vertex as a leaf or a twin to some vertex of Gi 1 . Another polynomial recognition algorithm for distance hereditary graphs that is useful for solving the “Steiner problem” (see Sect. 3.10) for these graphs is
58
W. Goddard and O.R. Oellermann
described in [20]. Bandelt and Mulder [2] gave a characterization of these graphs in terms of forbidden subgraphs.
3.4.4 Random Graphs The random graph Gpn is obtained by starting with n vertices, and then for every pair of distinct vertices, making them adjacent with probability p (each decision independent). Fact 8 For any fixed p, Gpn has diameter 2 with high probability (meaning the limit as n ! 1 is 1). There is another version of random graphs, called power-law or scale-free graphs, which models the Web better (see, for example, Bonato [6]).
3.5 Average Distance The average distance of a graph G D .V; E/ of order n, denoted by .G/, is the expected distance between a randomly chosen pair of distinct vertices; that is, 1 X .G/ D n d.u; v/: 2
u;vV
The study of the average distance began with the chemist Wiener [72], who noticed that the melting point of certain hydrocarbons is proportional to the sum of all distances between unordered pairs of vertices of the corresponding graph. This sum is now called the Wiener or Wiener index of the graph and is denoted by .G/. number (Note that .G/ D n2 .G/.) The average distance of a graph has been used for comparing the compactness of architectural plans [52]. Doyle and Graver [22] were the first to define .G/ as a graph parameter. Here are the values for some simple graphs. Fact 9 1. Complete graphs: .Kn / D 1 (for n 2). 2. Complete bipartite graph: .Ka;b / D .ab C 2a2 C 2b 2 /=..a C b/.a C b 1//. 3. Path on n vertices: .Pn / D .n C 1/=3. 4. Cycle on n vertices: .Cn / D .n C 1/=4 if n is odd, and n2 =.4.n 1// if n is even. The result on the path is a discrete version of the fact that a pair of randomly chosen points on a line of length 1 have expected distance 1=3.
3
Distance in Graphs
59
One might expect some relationship between the radius or diameter of the graph and its average distance. However, Plesn´ık [62] showed that, apart from the trivial inequality .G/ diam.G/, no such relationship exists.
3.5.1 Bounds on the Average Distance The following upper bound was established independently in [22, 24, 51]. Theorem 8. If G is a connected graph of order n, then 1 .G/
nC1 : 3
Equality holds if and only if G is a complete graph or a path. Plesn´ık [62] improved this bound for two-edge-connected graphs to approximately n=4. Mah´eo and Thuillier (see [30]) showed that .n/ n=.2/ C o.n/ if G is -connected. A straightforward lower bound in terms of the order n and number of edges m follows from the fact that there are exactly m pairs of vertices distance 1 apart and the remaining pairs are distance at least 2 apart; see [24]. Fact 10 If G is a connected graph of n vertices and m edges, then .G/ 2
2m : n.n 1/
Equality holds if and only if diam.G/ D 2. Finding the upper bound for .G/ in terms of n and m is much more difficult. ˘ es [69] found a sharp upper bound: Solt´ Theorem 9. The maximum average distance of a connected graph of order n and m edges, is achieved by the path-complete graph. There are a few other graphs achieving the maximum average distance; the extremal graphs were characterized in [35]. Plesn´ık [62] found a sharp lower bound for the average distance of a graph in terms of the order and diameter. However, the problem of finding the exact maximum average distance among all graphs of a given order and diameter remains unsolved. In Sect. 3.2.2 a bound on the diameter in terms of the distinct eigenvalues of the adjacency matrix and of the Laplacian was given. Rodriguez and Yebra [64] obtained a similar result for the average distance of G.
60
W. Goddard and O.R. Oellermann
Theorem 10. Let G be a connected graph of n vertices and m edges, and let b be the number of distinct eigenvalues of G. Then .G/ b
2.b 1/m : n.n 1/
The same result holds if b is the number of distinct Laplacian eigenvalues of G. The spectrum (set of eigenvalues) does not necessarily determine a graph, not even if the graph is a tree. McKay (see [54]) and Merris [53] showed, however, that the average distance of a tree is determined by its spectrum. Theorem 11. Let T be a tree of order n and let 0 D 1 2 n be the Laplacian eigenvalues of T . Then .T / D
n 2 X 1 : n1 i i D2
Mohar [54] determined both upper and lower bounds on the average distance of a graph in terms of some of its Laplacian eigenvalues.
3.5.2 The Average Distance and Other Graph Invariants Considerable interest in average distance was generated by conjectures made by the computer program GRAFFITI, developed by Fajtlowicz [27, 28]. One of these was that .G/ is at most the independence number ˇ.G/ of the graph. Chung [14] proved this conjecture. Theorem 12. For any connected graph G, .G/ ˇ.G/. This bound is attained if and only if G is a complete graph. The computer program GRAFFITI also conjectured in [28] that every ı-regular connected graph of order n has average distance at most n=ı. GRAFFITI later restated this conjecture for graphs with minimum degree ı. It took 10 years before Kouider and Winkler [46] proved the following. Theorem 13. Let G be a connected graph of order n and minimum degree ı. Then .G/
n C 2: ıC1
While this result is stronger than the GRAFFITI conjecture when n is much larger than ı, it does not imply it. The conjecture was finally proven by Beezer, Riegsecker and Smith [3].
3
Distance in Graphs
61
3.5.3 Edge Removal and the Average Distance In this section we look at the effect of edge removal on the average distance of a graph. Since the removal of a bridge disconnects the graph, we consider only cyclic edges e. We can measure the effect of e’s removal from G by considering either the difference .G e/ .G/ or the ratio .G e/=.G/. In both cases the best edge is one whose removal minimizes the quantity in question, and the worst edge is one that maximizes the quantity. These questions are of importance in network design: how badly would an edge failure affect the network, or how much would the network suffer if we omitted a particular link to save costs. If an edge e D ab is removed, the distance between a and b increases and no other distances decrease. Thus, the difference .G e/ .G/ for the best edge is at least 1= n2 . Finding attainable upper bounds is more difficult. Favaron et al. [30] found the maximum value for the difference. Theorem 14. Let G be a graph of order n and e a cyclic edge of G. Then .G e/ .G/
1 p 2 1 n C O.1/: 3
We now consider the ratio .G e/=.G/. If G is a cycle, then the removal of an edge increases the average distance by a factor of about 4=3. Winkler [73, 74] conjectured that for two-edge-connected graphs this is the maximum possible ratio for the best edge. This became known as the “four-thirds conjecture”, and was eventually proven by Bienstock and Gy¨ori [5]. Soon thereafter, Gy¨ori [36] extended it and proved: Theorem 15. The four-thirds conjecture holds for all connected graphs that are not trees. The ratio .G e/=.G/ can be arbitrarily large if a worst edge e is removed (see [17]). To see this, consider the graph G obtained from a cycle Cr W v0 v1 v2 : : : vr1 v0 , where r 6 is a fixed integer, by replacing vertices v0 and v3 by complete graphs of order b.nr/=2c and d.nr/=2e whose vertices are adjacent to vr1 ; v1 and v2 ; v4 , respectively. If n is large, then two randomly chosen vertices are almost certainly in the union of the two complete graphs and the probability that they are in the same (different) complete graph(s) and thus have distance 1 (3) tends to 1 1 1 .G e/ D .r 3/=2 C 2 . Hence .G/ D 2 3 C 2 1 C o.1/. By a similar argument p o.1/, where e is the edge v v . Choosing r D b2 nc gives .G e/=.G/ D 1 2 p O. n/. Favaron et al. [30] showed that this achieves the order of magnitude of the maximum possible value. Theorem 16. Let G be a connected graph of order n and e a cyclic edge of G. Then p .G e/ n p C O.1/: .G/ 2 3
62
W. Goddard and O.R. Oellermann
The minimum average distance spanning tree (or MAD tree) of a connected graph is a spanning tree having minimum average distance. Such a tree is also referred to as a minimum routing cost tree. It is surprising that the removal of a single best edge can increase the average distance by a factor of 4=3, but the removal of m n C 1 best edges (where m is the number of edges in the graph) increases the average distance by a factor less than 2. This fact was established by Entringer et al. in [25] (and a related result is discussed in [76]). Theorem 17. Let G be a connected graph of order n. Then there exists a vertex v and spanning tree Tv that is distance preserving from v, such that .Tv / 2
n1 .G/: n
Johnson et al. [43] showed that the problem of finding a MAD tree in a graph is NP-hard.
3.5.4 Vertex Removal and Average Distance We now turn our attention to the effect of vertex removal on the average distance. Unlike edge removal, vertex removal can both decrease or increase the average distance. For convenience, we express our results in terms of the Wiener index of the graph. Swart [70] showed that the maximum possible decrease occurs when an endvertex is removed from a path. Theorem 18. Let G be a graph of order n 2 and let v be a non-cut vertex of G. Then n.n 1/ .G/ .G v/ ; 2 with equality if and only if G is a path and v is an end-vertex of G. ˘ es [69] showed that the path-complete graphs are extremal for the ratio: Solt´ Theorem 19. Let G be a graph of order n and m n 1 edges, and let v be a non-cut-vertex of G. Then .G v/ .PKn1;m1 / : .G/ .PKn;m / ˘ es [69] also gave sharp upper bounds for .G v/ .G/ in terms of the Solt´ order and number of edges of G. In some instances the removal of any vertex increases the average distance. For example, the cycle Cn leaves Pn1 after the removal of any vertex. Thus the average distance increases by a factor of nearly 4=3. Winkler [73, 74] conjectured that this is the worst increase. This vertex version of the “four-thirds conjecture” was proven asymptotically by Bienstock and Gy¨ori [5].
3
Distance in Graphs
63
Theorem 20. Every connected graph has a vertex whose removal increases the average distance by a factor of at most 43 C O.n5 /. Alth¨ofer [1] proved the four-thirds conjecture for four-connected graphs, and improved on it for graphs of higher connectivity.
3.6 Directed Graphs Directed graphs behave somewhat differently to undirected graphs. In general we assume that the digraph D is strongly connected; that is, there is a directed path from each vertex to each other vertex. Note, however, that the radius of D might well exist even though the digraph is not strongly connected and the diameter does not exist. Further, it is possible that diam.D/ 2 rad.D/. An oriented graph is one obtained by assigning directions to each edge of an undirected graph. That is, it is a digraph without two-cycles. F¨uredi et al. [33] provided a lower bound on the number of arcs in an oriented graph of diameter 2. Theorem 21. If an oriented graph has diameter 2, then m .1 o.1// n log n, where n is the order and m the number of arcs. Chv´atal and Thomassen [15] studied the problem of taking an undirected graph and finding an orientation of minimum diameter. Earlier, Robbins [63] had shown that an undirected graph has a strong orientation if and only if it is bridgeless. Chv´atal and Thomassen showed that a bridgeless graph of diameter d has an orientation of diameter at most 2d 2 C d . They also showed that determining whether a graph has an orientation of diameter 2 is NP-complete.
3.6.1 The Average Distance of Digraphs The average distance of digraphs has not received as much attention as the average distance of graphs. Ng and Teh [57] gave a lower bound for the average distance of a strong digraph D in terms of its order n and number of arcs m similar to the one given for undirected graphs; they showed that .D/ 2 m=.n.n 1// with equality if and only if diam.D/ D 2. For n 3 this bound is sharp if m 2n 2, the smallest number of arcs for which there exists a digraph of order n and diameter 2. Plesn´ık [62] proved the following upper bound on the average distance of a strong digraph. Theorem 22. Let D be a strong digraph of order n. Then .D/ n=2. Equality holds if and only if D is a directed cycle.
64
W. Goddard and O.R. Oellermann
It is natural to ask whether there are upper bounds on the average distance of a digraph in terms of the order and minimum degree that are analogous to the ones for graphs, but it turns out that in general these bounds do not carry over for general digraphs. In [19] the problem of finding an orientation of a two-edge-connected graph that minimizes the average distance is studied.
3.6.2 Tournaments A tournament is an oriented complete graph. Landau [47] showed that every tournament has radius at most 2. It is easy to construct a tournament on n vertices with diameter n 1. For n ¤ 4, it is also easy to construct a tournament with diameter 2. Plesn´ık [62] gave bounds for average distance in strongly connected tournaments. Theorem 23. Let Tn be a strongly connected tournament of order n 3. Then nC4 3 .Tn / : 2 6 Equality holds if and only if Tn has diameter 2 (this is possible only if n ¤ 4) or if Tn is the unique tournament of diameter n 1, respectively.
3.7 Convexity Interval notions in graphs have led to the study of abstract convexity in graphs and structural characterizations of several interesting graph classes. Suppose V is a collection of points and M a collection of subsets of V . Then M is a convexity if it contains both ; and V and it is closed under intersections. The elements of M are called convex sets. If T 2 M, then a point v of T is an extreme point of T if T n fvg 2 M. If S V , then the smallest convex set containing S is called the convex hull of S . A convex geometry is a convexity with the additional property that every convex set is the convex hull of its extreme points. The most well-known graph convexity is defined in terms of geodesic intervals, which were introduced in Sect. 3.4.2. Suppose G D .V; E/ is a connected graph. Then a set S V is g-convex if Ig Œu; v S for all pairs u; v 2 S . Let Mg .G/ be the collection of all g-convex sets of G. Then Mg .G/ is a convexity. It is not difficult to see that a vertex v of a g-convex set S is an extreme vertex of S if and only if v is simplicial in hS i, i.e., the neighbourhood of v in S induces a complete graph. Farber and Jamison [29] characterized the class of graph for which the g-convex sets form a convex geometry.
3
Distance in Graphs
65 y
Fig. 3.6 The 3-fan
u
v
w
x
...
House
Hole
Domino
A-graph
Fig. 3.7 Forbidden graphs
Theorem 24. Let G be a connected graph. Then Mg .G/ is a convex geometry if and only if G is chordal without an induced 3-fan (see Fig. 3.6). Every shortest path is necessarily induced, but not conversely. This leads to another type of graph interval. The monophonic interval between a pair u; v of vertices in a graph G, denoted by Im Œu; v, is the collection of all vertices that lie on an induced u v path in G. A set S of vertices in a graph is m-convex if Im Œu; v S for all pairs u; v 2 S . It is not difficult to see that the collection Mm .G/ of all m-convex sets is a convexity, and that the extreme points of an m-convex set S are precisely the simplicial vertices of hS i. Farber and Jamison [29] characterized those graphs for which the m-convex sets form a convex geometry. Theorem 25. Let G be a connected graph. Then Mm .G/ is a convex geometry if and only if G is chordal. Dragan et al. [23] defined another type of graph interval. If u; v is a pair of vertices in a connected graph G, then the m3 -interval, denoted by Im3 Œu; v, between u and v is the collection of all vertices that lie on some induced u v path of length at least 3. A set S of vertices in G is m3 -convex if Im3 Œu; v S for all pairs u; v of vertices in S . For a graph G, let Mm3 .G/ be the collection of all m3 -convex sets. This collection of sets is certainly a convexity. Further, it can be shown that a vertex v is an extreme point of an m3 -convex set S if and only if v is semisimplicial, i.e., not the centre of an induced P4 . The class of graphs for which the m3 -convex sets form a convex geometry was characterized in [23]. Theorem 26. Let G be a connected graph. Then Mm3 .G/ is a convex geometry if and only if G is (house, hole, domino, A)-free (see Fig. 3.7).
66
W. Goddard and O.R. Oellermann
3.8 Metric Dimension Distances in graphs have interesting applications. One such application is to uniquely locate the position of a vertex in a network using distances. A vertex v resolves a pair u; w of vertices in a connected graph G if d.u; v/ ¤ d.w; v/. A set of vertices S is a resolving set of G, if every pair of vertices in G is resolved by some vertex of S . A resolving set of minimum cardinality is called a metric basis of G and its cardinality the metric dimension, d i m.G/, of G. The metric dimension of a graph was introduced by Slater [66] and independently by Harary and Melter [39]. Slater referred to the metric dimension as the location number, and motivated its study by its application to the placement of a minimum number of sonar/loran detecting devices in a network so that the position of every vertex in the network could be uniquely described in terms of its distances to the detecting devices. A problem in pharmaceutical chemistry once again led to an independent discovery of the notion of a resolving set of a graph [12]. In [34] it was noted that the metric dimension of a graph is NP-hard. The formula for the metric dimension of trees has been discovered independently by several authors (see [12, 39, 66]). The metric dimension of a nontrivial path is 1 since a leaf resolves the path. Suppose now that T is a tree that contains vertices of degree at least 3. A vertex v of degree at least 3 is an exterior vertex if there is some leaf u in T such that the v u path of T contains no vertices of degree exceeding 2 except for v. Let ex.T / denote the number of exterior vertices of T and `.T / the number of leaves of T . It turns out that a metric basis for a tree can be found by selecting, for each exterior vertex, all but one of its exterior leaves. That is, the metric dimension of T is given in the following. Theorem 27. For a tree T , dim.T / D `.T / ex.T /. Apart from trees, very few exact results for the metric dimension of graphs are known unless the graphs are highly structured (usually vertex transitive). It was claimed in [45] that the metric dimension of the Cartesian product of k paths is k; but indeed it was only verified that k is an upper bound in this case. In [65] a connection between the metric dimension of the n-cube and the solution to a coin weighing problem was noted. This observation and results by Lindstr¨om [50] and Erd¨os and R´enyi [26] show that limn!1 dim.Qn / log n=n D 2, thereby disproving the claim about n-cubes made in [45]. Motivated by the connection between coin weighing problems/strategies for the Mastermind game and resolving sets in Cartesian products of certain classes of graphs, the metric dimension of Cartesian products of graphs was investigated in [10]. This paper introduces “doubly resolving sets” as a useful tool for obtaining upper bounds on the metric dimension of graphs, particularly in Cartesian products of graphs.
3
Distance in Graphs
67
3.9 Algorithms and Complexity 3.9.1 Shortest Paths To compute the distance between two vertices in an unweighted graph, one can use a breadth-first search. To compute the distance between two vertices in a weighted graph, one can use Dijkstra’s algorithm (which is in some sense a generalization of breadth-first search). Note that the algorithm actually finds the distance from a given start vertex to all other vertices. ShortestPath (G:graph, a:vertex) for all vertices v do currDis(v) WD infinity currDis(a) WD 0 remainder WD [all vertices] while remainder nonempty do f let w be vertex in remainder with minimum value of currDis remainder –D [w] for all vertices v in remainder do currDis (v) WD min (currDis(v), currDis(w)+length(w,v)) g
The running time of the above implementation of Dijkstra’s algorithm is O.n2 /. By using suitable data structures this can be brought down for sparse graphs to O.m C n log n/, where m is the number of edges.
3.9.2 All Pairs Shortest Paths Suppose we wanted instead to calculate the shortest path between every pair of vertices, for example, in order to compute the average distance. One idea would be to run Dijkstra with every vertex as a start vertex. This takes O.n3 / time. There are two dynamic programming algorithms with similar running times. One is due to Bellman and Ford and the other to Floyd and Warshall. A variant of the former is used in routing protocols in networks. We describe here the Floyd–Warshall algorithm [31]. Suppose the vertices are ordered 1 up to n. Then define dm .u; v/ as the length of the shortest path between u and v that uses only the vertices numbered 1 up to m as intermediates.
The desired value is dn .u; v/ for all u and v. There is a formula for dm in terms of dm1 . For, the shortest u to v path that uses only vertices labeled up to m, either uses vertex m or it doesn’t. Thus: dm .u; v/ D min
dm1 .u; v/ dm1 .u; m/ C dm1 .m; v/
The resultant program iterates m from m D 0 to m D n 1.
68
W. Goddard and O.R. Oellermann
3.10 Steiner Distances Up to this point we have considered distance invariants that hinge on shortest paths between pairs of vertices. In this section we give a brief overview of related invariants that arise by considering the “cheapest” subgraph that connects a given set of vertices.
3.10.1 Extending Distance Measures Suppose G is a (weighted) graph and S a set of vertices in G. Then the Steiner distance for S , denoted by dG .S /, is the smallest weight of a connected subgraph of G containing S . Such a subgraph is necessarily a tree, called a Steiner tree for S . The problem of finding a Steiner tree for a given set S of vertices is called the Steiner problem. In its two extremes, namely if jS j D 2 or jS j D n, the Steiner problem is solved efficiently by well-known algorithms, for example, Dijkstra’s algorithm and Kruskal’s minimum spanning tree algorithm, respectively. In general, however, this problem is NP-hard (see [34]), even for unweighted bipartite graphs. Winter’s survey [75] provides a good overview of different heuristics that have been developed for the problem as well as exact solutions for various graph classes. The radius, diameter and average distance have a natural extension. For a given vertex v in a connected (weighted) graph G and integer k (2 k n), the k-eccentricity of v, denoted by ek .v/, is the maximum Steiner distance among all k-sets of vertices in G that contain v. The k-radius, radk .G/, of G is the minimum k-eccentricity of the vertices of G, and the k-diameter, diamk .G/, of G is the maximum k-eccentricity. The average Steiner k-distance, k .G/ of G, is the average Steiner distance among all k-sets of vertices of G. The k-distance of a vertex v, denoted by ek .v/, is the sum of the Steiner distances of k-sets of vertices containing v. The subgraph induced by vertices of minimum k-eccentricity is called the k-centre of G and is denoted by Ck .G/; the subgraph induced by the vertices of minimum k-distance is called the k-median and is denoted by Mk .G/. The k-diameter is clearly an upper bound for the k-radius. No upper bound for the k-diameter as a function of k and the k-radius of an (unweighted) graph is known. For trees, the following generalization of Fact 2 was established in [13]. Theorem 28. For a tree T of order n and integer k n, diamk .T /
n n1 rad k .T /.
It was shown in [60], that the k-centre of a tree T can be found by successively pruning leaves. If T has at most k 1 leaves, then T is its own k-centre. If T has at least k leaves, then the k-centre is the i th derivative of T where i is the smallest integer such that T .i / has at most k 1 leaves. This also shows that the k-centre of a tree is contained in the .k C 1/-centre of a tree. (This containment does not hold in general graphs). Moreover, it follows that k-centres of trees are connected. The k-median of trees was shown in [4] to be connected. In the same paper it was shown that a tree H of order p is the k-median of a tree if and only if p D 1; 2
3
Distance in Graphs
69
or k or if H has at most k p C 1 leaves. An algorithm for finding the k-median of a tree T was also described. If a tree has order at least 2k 1, then its k-median consists of a single vertex or a pair of adjacent vertices. The k-centre and k-median of a tree may be arbitrarily far apart (see [59]). Centrality structures that connect the k-centre and k-median of a tree are introduced and studied in [59]. The average Steiner k-distance of a graph was first defined in [18]. In the same paper it was shown that k .G/ l .G/ C kC1l .G/ for 2 l k 1, and that the range of average Steiner k-distance of a graph is given by: Theorem 29. If G is a connected graph of order n and 2 k n, then k 1 k .G/
k1 .n C 1/; kC1
with equality on the left if and only if G is .n C 1 k/-connected or k D n, and equality on the right if and only if G is a path or n D k. An efficient procedure that finds the average Steiner k-distance of a tree is described in [18]. This algorithm counts the number of k-sets such that a given edge belongs to a Steiner tree for the k-set. Moreover, it is shown that for a tree T , k .T / kl .T /= l for 2 l k 1 with equality if and only if T is a star, and the lower bound given in Theorem 29 is improved to k.1 1=n/ for trees.
3.10.2 Steiner Intervals and Graph Convexity The Steiner interval of a set X of vertices in a connected graph G, denoted by I.X /, is the collection of all vertices that belong to some Steiner tree for X . A set S of vertices is k-Steiner convex, denoted by gk -convex, if I.X / S for all subsets X of S with jX j D k. Thus a g2 -convex set is a g-convex set. We call the extreme vertices of a gk -convex set a k-Steiner simplicial vertex and abbreviate this by kS S . The 3S S vertices are characterized in [11] as the vertices that are not the centre of an induced claw, paw or P4 ; see Fig. 3.8. Thus the 3S S vertices are semisimplicial. Several graph convexities related to the g3 -convexity are introduced in [58] and those graphs for which these graph
Claw
Fig. 3.8 Characterizing 3SS vertices
Paw
P4
70 Fig. 3.9 The replicated twin C4 ’s
W. Goddard and O.R. Oellermann x w u
y
v
z
convexities form convex geometries are characterized in the same paper. We state here a characterization of those graphs for which the g3 -convex sets form a convex geometry. A replicated-twin C4 is any one of the four graphs shown in Fig. 3.9 where any subset of the dotted edges belongs to the graph. The collection of replicated-twin C4 ’s is denoted by RC4 . Theorem 30. Let G be a connected graph and Mg3 .G/ the collection of all g3 -convex sets of G. Then Mg3 .G/ is a convex geometry if and only if d i am.G/ 2 and if G is (house, hole, 3-fan, RC4 )-free. Acknowledgments We would like to thank Peter Dankelmann for sharing his thoughts on average distance with us.
References 1. Alth¨ofer I (1990) Average distances in undirected graphs and the removal of vertices. J Combin Theory B 48(1):140–142 2. Bandelt H-J, Mulder HM (1986) Distance–hereditary graphs. J Combin Theory B 41:182–208 3. Beezer RA, Riegsecker JE, Smith BA (2001) Using minimum degree to bound average distance. Discrete Math 226:365–371 4. Beineke LW, Oellermann OR, Pippert RE (1996) On the Steiner median of a tree. Discrete Appl Math 68:249–258 5. Bienstock D, Gy¨ori E (1988) Average distance in graphs with removed elements. J Graph Theory 12(3):375–390 6. Bonato A (2005) A survey of models of the web graph. In: Combinatorial and algorithmic aspects of networking, vol 3405, Lecture notes in computer science. Springer, Berlin, pp 159–172 7. Buckley F, Harary F (1990) Distance in graphs. Addison-Wesley Publishing Company Advanced Book Program, Redwood City, CA 8. Buckley F, Lewinter M (1988) A note on graphs with diameter-preserving spanning trees. J Graph Theory 12(4):525–528 9. Buckley F, Miller Z, Slater PJ (1981) On graphs containing a given graph as center. J Graph Theory 5:427–432 10. C´aceres J, Hernando C, Mora M, Pelayo IM, Puertas ML, Seara C, Wood DR (2007) On the metric dimension of the cartesian product of graphs. SIAM J Discrete Math 21(2):423–441 11. C´aceres J, Oellermann OR (2009) On 3-Steiner simplicial orderings. Discrete Math 309: 5828–5833 12. Chartrand G, Eroh L, Johnson MA, Oellermann OR (2000) Resolvability in graphs and the metric dimension of a graph. Discrete Appl Math 105:99–113 ˇ 13. Chartrand G, Oellermann OR, Tian S, Zou HB (1989) Steiner distance in graphs. Casopis Pro Pˇestov´an´ı Matematiky 114(4):399–410
3
Distance in Graphs
71
14. Chung FRK (1988) The average distance and the independence number of a graph. J Graph Theory 12:229–235 15. Chv´atal V, Thomassen C (1978) Distances in orientations of graphs. J Combin Theory B 24:61–75 16. Cockayne EJ, Hedetniemi SM, Hedetniemi ST (1981) Linear algorithms for finding the Jordan center and path center of a tree. Transport Sci 15:98–114 17. Dankelmann P Average distance in graphs – a survey, (submitted) 18. Dankelmann P, Oellermann OR, Swart HC (1996) The average Steiner distance of a graph. J Graph Theory 22(1):15–22 19. Dankelmann P, Oellermann OR, Wu J-L (2004) Minimum average distance of strong orientations of graphs. Discrete Appl Math 143:204–212 20. D’Atri A, Moscarini M (1988) Steiner trees and connected domination. SIAM J Discrete Math 17:521–538 21. Dirac GA (1961) On rigid circuit graphs. Abh Math Sem Univ Hamburg 25:71–76 22. Doyle JK, Graver JE (1977) Mean distance in a graph. Discrete Math 7(2):147–154 23. Dragan FF, Nicolai F, Brandst¨adt A (1999) Convexity and HHD-free graphs. SIAM J Discrete Math 12:119–135 24. Entringer RC, Jackson DE, Snyder DA (1976) Distance in graphs. Czech Math J 26:283–296 25. Entringer RC, Kleitman DJ, Sz´ekely LA (1996) A note on spanning trees with minimum average distance. Bull Inst Combinator Appl 17:71–78 26. Erd¨os P, R´enyi A (1963) On two problems of information theory. Magyar Tud Akad Mat Kutat´o Int K¨ozl 8:229–243 27. Fajtlowicz S (1986) On two conjectures of GRAFFITI. Congr Numer 55:51–56 28. Fajtlowicz S (1987) On conjectures of GRAFFITI II. Congr Numer 60:187–197 29. Farber M, Jamison RE (1986) Convexity in graphs and hypergraphs. SIAM J Algebra Discrete Methods 7:433–444 30. Favaron O, Kouider M, Mah´eo M (1989) Edge-vulnerability and mean distance. Networks 19(5):493–504 31. Floyd RW (1962) Algorithm 97: shortest path. Commun ACM 5:345 32. Freeman LC (1978/1979) Centrality in social networks: conceptual clarification. Soc Networks 1:215–239 33. F¨uredi Z, Horak P, Pareek CM, Zhu X (1998) Minimal oriented graphs of diameter 2. Graph Combinator 14:345–350 34. Garey MR, Johnson DS (1979) Computers and intractibility: a guide to the theory of NP-completeness. W.H. Freeman and Company, New York 35. Goddard W, Swart CS, Swart HC (2005) On the graphs with maximum distance or k-diameter. Math Slovaca 55(2):131–139 36. Gy¨ori E (1988) On Winkler’s four thirds conjecture on mean distance in graphs. Congr Numer 61:259–262 37. Hammer PL, Maffray F (1990) Completely separable graphs. J Discrete Appl Math 27:85–99 38. Harary F (1962) The maximum connectivity of a graph. Proc Natl Acad Sci USA 48: 1142–1146 39. Harary F, Melter RA (1976) On the metric dimension of a graph. Ars Combinatoria 2:191–195 40. Harary F, Norman RZ (1953) The dissimilarity characteristic of Husimi trees. Ann Math (2) 58:134–141 41. Howorka E (1977) A characterization of distance-hereditary graphs. Quart J Math Oxford 28:417–420 42. Jeong H, Mason SP, Barab´asi A-L, Oltvai ZN (2001) Lethality and centrality in protein networks. Nature 411:41–42 43. Johnson DS, Lenstra JK, Rinnooy-Kan AHG (1978) The complexity of the network design problem. Networks 8:279–285 44. Jordan C (1869) Sur les assembalges des lignes. J Reine Angew Math 70:185–190 45. Khuller S, Raghavachari B, Rosenfeld A (1996) Landmarks in graphs. Discrete Appl Math 70(3):217–229
72
W. Goddard and O.R. Oellermann
46. Kouider M, Winkler P (1997) Mean distance and minimum degree. J Graph Theory 25:95–99 47. Landau HG (1953) On dominance relations and the structure of animal societies. III. The condition for a score structure. Bull Math Biophys 15:143–148 48. Laskar R, Shier D (1983) On powers and centers of chordal graphs. Discrete Appl Math 6(2):139–147 49. Lekkerkerker CG, Boland J (1962) Representation of a finite graph by a set of intervals on the real line. Fund Math 51:45–64 50. Lindstr¨om B (1964) On a combinatory detection problem. I. Magyar Tud Akad Mat Kutat´o Int K¨ozl 9:195–207 51. Lov´asz L (1979) Combinatorial problems and exercises. Akad´emiai Kiad´o, Budapset 52. March L, Steadman P (1974) The geometry of environment: an introduction to spatial organization in design. MIT Press, Cambridge, MA 53. Merris R (1989) An edge version of the matrix-tree theorem and the Wiener index. Linear Multilinear Algebra 25(4):291–296 54. Mohar B (1991) Eigenvalues, diameter, and mean distance in graphs. Graph Combinator 7(1):53–64 55. Mulder HM (1980) The interval function of a graph. Mathematical Centre Tracts, Amsterdam 56. Mulder HM (1980) n-cubes and median graphs. J Graph Theory 4:107–110 57. Ng CP, Teh HH (1966/1967) On finite graphs of diameter 2. Nanta Math 1:72–75 58. Nielsen M, Oellermann OR (2009) Steiner trees and convex geometries. SIAM J Discrete Math 23:680–693 59. Oellermann OR (1995) From Steiner centers to Steiner medians. J Graph Theory 20(2): 113–122 60. Oellermann OR, Tian S (1990) Steiner centers in graphs. J Graph Theory 14(5):585–597 61. Plesn´ık J (1975) Note on diametrically critical graphs. In: Recent advances in graph theory (Proceedings of the 2nd Czechoslovak symposium, Prague, 1974). Academia, Prague, pp 455–465 62. Plesn´ık J (1984) On the sum of all distance in a graph or digraph. J Graph Theory 8:1–24 63. Robbins HE (1939) Questions, discussions, and notes: a theorem on graphs, with an application to a problem of traffic control. Am Math Mon 46(5):281–283 64. Rodriguez JA, Yebra JLA (1999) Bounding the diameter and the mean distance of a graph from its eigenvalues: Laplacian versus adjacency matrix methods. Discrete Math 196(1–3):267–275 65. Seb¨o A, Tannier E (2004) On metric generators of graphs. Math Oper Res 29(2):383–393 66. Slater PJ (1975) Leaves of trees. Congr Numer 14:549–559 67. Slater PJ (1978) Centers to centroids in graphs. J Graph Theory 2:209–222 68. Slater PJ (1981) Centrality of paths and vertices in a graph: cores and pits. In: The theory and applications of graphs. Wiley, New York, pp 529–542 ˘ es L (1991) Transmission in graphs: a bound and vertex removing. Math Slovaca 41(1): 69. Solt´ 11–16 70. Swart CS (1996) Distance measures in graphs and subgraphs. Master’s thesis, University of Natal, Durban 71. Vizing VG (1967) On the number of edges in a graph with a given radius. Dokl Akad Nauk SSSR 173:1245–1246 72. Wiener H (1947) Structural determination of paraffin boiling points. J Am Chem Soc 69(1): 17–20 73. Winkler P (1986) Mean distance and the four thirds conjecture. Congr Numer 54:53–61 74. Winkler P (1989) Graph theory in memory of G.A. Dirac. In: Proceedings of meeting in Sandbjerg, Denmark, 1985, Ann Discrete Math, North-Holland, Amsterdam 75. Winter P (1987) Steiner problem in networks: a survey. Networks 17:129–167 76. Wong R (1980) Worst-case analysis of network design problem heuristics. SIAM J Algebra Discrete Methods 1:51–63 77. Zelinka B (1968) Medians and peripherians of trees. Arch Math (Brno) 4:87–95
Chapter 4
Domination in Graphs Nawarat Ananchuen, Watcharaphong Ananchuen, and Michael D. Plummer
Abstract A set of vertices S in a graph G dominates G if every vertex in G is either in S or adjacent to a vertex in S . The size of any smallest dominating set is called the domination number of G. Two variants on this concept that have attracted recent interest are total domination and connected domination. A set of vertices S is a total dominating set if every vertex in the graph is adjacent to a vertex of S and S is a connected dominating set if it is dominating and, in addition, induces a connected subgraph. The size of any smallest total dominating set in G is called the total domination number of G and the size of a smallest connected dominating set is the connected domination number of G. These simple, yet wide-ranging, graphtheoretic concepts have a multitude of real-world applications. There are already in print several surveys of results on domination; therefore, in this chapter we adopt a slightly different approach. We begin by surveying results on bounding the three domination numbers. We then focus on criticality concepts for domination. The two types of criticality most widely studied to date are graphs for which the domination number decreases upon the addition of any missing edge and the graphs for which the domination number decreases upon the deletion of any vertex. Recently, there has been increased activity in the study of these critical concepts and we survey these new results, focusing especially upon matching in critical graphs. Keywords Domination Total domination Connected domination Edge critical Vertex critical Matching MSC2000: Primary 05C69; Secondary 05C70, 05C35
N. Ananchuen () Department of Mathematics, Faculty of Science, Silpakorn University, Nakorn Pathom 73000, Thailand e-mail:
[email protected]
M. Dehmer (ed.), Structural Analysis of Complex Networks, c Springer Science+Business Media, LLC 2011 DOI 10.1007/978-0-8176-4789-6 4,
73
74
N. Ananchuen et al.
4.1 Introduction The study of domination and related topics is one of the fast-developing areas in graph theory. To date, at least 2000 published research papers on domination have appeared in various journals. Excellent comprehensive collections of results together with open problems in this area were published in 1998 in two books [71,72]. The aim of this chapter is to provide a fundamental understanding of three types of domination and to present some recent results, most of which concern graphs edge- (or vertex-) critical with respect to each. We cannot, however, include all such results due to space limitations, but instead provide a guide to the relevant references. For the most part, our terminology follows that of Bondy and Murty [22]. Thus G is a graph with the vertex set V .G/, edge set E.G/; .G/ vertices, ".G/ edges, (vertex) connectivity .G/, and independence number ˛.G/. We denote the complement of a graph G by G. A graph G is said to be even (odd) if .G/ is even (odd). For S V .G/; GŒS denotes the subgraph induced by S . For v 2 V .G/; NG .v/ denotes the set of all vertices adjacent to vertex v and is called the neighborhood of v. The closed neighborhood of S v; NG Œv is defined by NG Œv D NG S.v/ [ fvg. If S V .G/, then NG .S / denotes x2S NG .x/ and NG ŒS denotes x2S NG Œx. The degree of v 2 V .G/ denoted by dG .v/ is defined to be jNG .v/j. Let ı.G/ and .G/ denote the minimum degree and maximum degree of G, respectively. As usual, Kn ; Cn , and Pn denote a complete graph, a cycle, and a path of order n, respectively, and Km;n denotes a complete bipartite graph with bipartite sets of size m and n. We denote the number of components (odd components) of a graph G by !.G/ (!o .G/). A vertex v 2 V .G/ is called an endvertex (or leaf or pendant vertex) if dG .v/ D 1. If fug D NG .v/, then u is a support vertex of v and the edge uv is called a pendant edge. For vertices u and v of G; d.u; v/ denotes the distance from u to v. The eccentricity of a vertex v denoted by e.v/ is maxfd.u; v/ju 2 V .G/g. The radius of G denoted by rad.G/ and the diameter of G denoted by diam.G/ are minfe.v/jv 2 V .G/g and maxfe.v/jv 2 V .G/g, respectively. If S and T are subsets of V .G/, we say that S dominates T if T NG ŒS . In particular, if S dominates V .G/ then S is said to be a dominating set for G; that is, S V .G/ is a dominating set for G if every vertex of G not in S is adjacent to one in S . The cardinality of any smallest dominating set in G is denoted by .G/. We call a dominating set with cardinality .G/, a .G/-set. It is easy to see that for n 1; .Kn / D .K1;n/˙D1 and if m; n 2, then .Km;n / D 2. Further, for n 3; .Pn / D .Cn / D n3 . The concept of domination, in both the theoretical and applied sense, has received the attention of many researchers. It has been used to study the optimal location of facilities such as radar stations (see [17]), hardware or software resources (see [61, 62]), and communication networks (see [97]). Typical problems are concerned with the minimum cardinality of a subset of a set of facilities, such as radar stations and communication centers, which collectively monitor all the facilities or perhaps can transmit messages to every facility in the network. In graph-theoretic
4
Domination in Graphs
75
terms, the minimum cardinality of such a set of monitoring facilities is called the domination number. In the real world, it might be additionally required that such a set of monitors be able to communicate among themselves in case of a security breach or perhaps each of these monitors must be reached by at least one other monitor. In these two special cases, the minimum cardinality of a monitor set is called the connected domination number and the total domination number, respectively. This chapter is divided into six sections. Section 4.2 contains some fundamental results concerning upper bounds for the classical domination number. Two of the more intensely studied variants of classical domination – connected domination and total domination – are the focus of Sect. 4.3. The concept of criticality has proved very useful in the past when applied to such important graph parameters as connectivity, chromatic number, and independence number. Only very recently has this idea been applied to domination. For the first time, a number of results concerning criticality of various types of domination are assembled in Sects. 4.4 and 4.5. Finally, we conclude the chapter with Sect. 4.6 in which we suggest some directions for future study.
4.2 Bounds on the Domination Number Clearly, V .G/ is a dominating set for G. Thus .G/ .G/. It is easy to see that .G/ D .G/ if G is complete. If the graph under consideration has no isolated vertices, then a bound on its domination number can be improved considerably. Many researchers have been concerned with establishing upper bounds on the domination number since determining the domination number of a graph is an NP-complete problem (see [31, 65] or [71], page 34). Various bounds on the domination number are given in terms of other graph parameters, for example, in terms of order and minimum degree (see [16, 29, 30, 40, 78, 104, 111, 117]), diameter (see [48, 67, 71, 103]), size and the minimum degree (see [79, 119]), and others (see [90, 102, 116]). The reader is directed to [42, 44, 71, 77, 96] for more on these bounds. We now state some fundamental results on bounding the domination number. The first result was given by Ore in 1962. Theorem 1 ([111]). Let G be a graph with ı.G/ 1. Then .G/ 12 .G/. Payan and Xuong [114] characterized the graphs that achieve the bound in Theorem 1, as we show in Theorem 2. Before stating this theorem we need a new definition. The corona of a graph H denoted by H ı K1 is the graph obtained from H by adding a pendant edge to each vertex of H . Theorem 2 ([114]). Let G be a graph with ı.G/ 1. Then .G/ D 12 .G/ if and only if each component of G is isomorphic to C4 or to H ı K1 for some connected graph H . The bound in Theorem 1 may be improved if the minimum degree of a graph is increased as shown in the following theorems.
76
N. Ananchuen et al.
Fig. 4.1 Graphs G with ı.G/ 2 and .G/ > 25 .G/
Theorem 3 ([104]). Suppose G is a connected graph with ı.G/ 2. Then G is either one of seven graphs in Fig. 4.1 or .G/ 25 .G/. When certain cycle lengths are forbidden, the bound in Theorem 3 was improved by Frendrup et al. [60] and Harant and Rautenbach [70]. Theorem 4 ([70]). If G is a graph with ı.G/ 2 and G does not contain cycles of length 4; 5; 7; 10, or 13, then .G/ 38 .G/. As a corollary of Theorem 4, an upper bound on the domination number for bipartite graphs follows. Corollary 1 ([70]). If G is a bipartite graph with ı.G/ 2 and G does not contain cycles of length 4 or 10, then .G/ 38 .G/. Theorem 5 ([117]). If G is a graph with ı.G/ 3, then .G/ 38 .G/. Beside lestablishing Theorem 5, Reed [117] conjectured that if G is 3-regular, m .G/ .G/ . This conjecture is true for Hamiltonian 3-regular graphs (see 3 [46]), but it was recently shown to be false in general by Kostochka and Stodolsky [92]. They constructed a connected 3-regular graph G of order 60 having .G/ D 21. Further, they found a sequence of connected 3-regular graphs fGk g1 kD1 8 1 1 k/ with .Gk / D 46k and .Gk / 16k such that limk!1 .G D C .Gk / 23 3 69 . However, as they pointed out, their examples contain cutedges. But even more recently, the two authors, and, independently, Kelmans (unpublished private communication), have obtained 2-connected examples. However, it is unknown at this point if Reed’s conjecture holds for 3-connected 3-regular graphs. In a related work, Kawarabayashi et al. [90] proved that a 2-edge-connected 3-regular graph G of girth at least 3k satisfies .G/ 3kC2 9kC3 .G/. Kostochka and Stodolsky [93] have also proved the following result. Theorem 6 ([93]). If G is a connected 3-regular graph with .G/ > 8, then 4 .G/ 11 .G/. The next two results provide bounds on the domination number of graphs with minimum degree 4 and 5. Theorem 7 ([98]). If G is 4-regular, then .G/
4 .G/. 11
4
Domination in Graphs
77
Theorem 8 ([140]). If G is a graph with ı.G/ 5, then .G/
5 14 .G/.
In 1998, Clark et al. [40] established an upper bound on the domination number based on the degree sequence of a graph. Their result stated in Theorem 9 has proved to be a useful tool in establishing Theorem 10 by Hellwig and Volkmann [78]. Theorem 9 ([40]). Suppose G is a graph with ı.G/ 1. Then Qı.G/C1 .G/ 1 kD1 kC k 1 .G/. ı.G/
Theorem 10 ([78]). Suppose G is a connected graph: 6 (i) If ı.G/ D 6, then .G/ 17 .G/. ˘ 1 (ii) If ı.G/ 7, then .G/ 3 .G/ .
The upper bound on the domination number can be very small if the graphs under consideration are planar or are of small diameter. Theorem 11 ([71], page 55). Let G be a graph with diam.G/ D 2. Then .G/ ı.G/. The bound in Theorem 11 follows immediately from the fact that, in a graph G of diameter 2, a neighborhood of a vertex v 2 V .G/ dominates G for any v. This bound was improved by Hellwig and Volkmann [78] as follows. Theorem 12 ([78]). Let G be a graph with diam.G/ D 2. Then (i) .G/ .G/. (ii) If G contains an induced complete graph Kı.G/ with all its vertices of degree ı.G/, then .G/ 3. Hellwig and Volkmann [78] also established an upper bound on the domination number of graphs having diameter 2 in terms of their order. Further, they presented several sufficient conditions for .G/ ı.G/ 1 to hold in graphs G having diameter 2. They also posed the problem of characterizing graphs G having diameter 2 with .G/ D ı.G/. MacGillivray and Seyffarth [103] established an upper bound for planar graphs having small diameter. Theorem 13 ([103]). Suppose G is a planar graph. Then (i) If diam.G/ D 2; .G/ 3. (ii) If diam.G/ D 3; .G/ 10. MacGillivray and Seyffarth [103] also showed that the bound in Theorem 13(i) is best possible since the planar graph G in Fig. 4.2 is of diameter 2 and .G/ D 3. They pointed out that the bound in Theorem 13(ii) might not be best possible. However, they have no example of a planar graph having diameter 3 and domination number greater than 6. They also gave examples of planar graphs of diameter 4 with arbitrarily large domination numbers. In 2002, Goddard and Henning [67] improved Theorem 13 as follows.
78 Fig. 4.2 The planar graph G with diam.G/ D 2 and .G/ D 3
N. Ananchuen et al.
G:
Theorem 14 ([67]). Suppose G is a planar graph: (i) If diam.G/ D 2, then either .G/ 2 or G is isomorphic to the graph in Fig. 4.2. (ii) If diam.G/ D 3 and rad.G/ D 2, then .G/ 6. (iii) If diam.G/ D 3 and G is sufficiently large, then .G/ 7. The bounds in Theorem 14(ii) and (iii) were slightly improved by Dorfling et al. [48]. Theorem 15 ([48]). Suppose G is a planar graph with diam.G/ D 3. Then (i) .G/ 9. (ii) If rad.G/ D 2, then .G/ 5. (iii) If G is sufficiently large, then .G/ 6.
4.3 Two Other Types of Domination The concept of domination can be extended to yield new concepts by combining it with other graph parameters. For example, suppose that the dominating set S has an additional property such as being connected (it is then called a connected dominating set), being independent (it is then called an independent dominating set), having no isolated vertex (it is then called a total dominating set), or being a clique (it is then called a dominating clique), etc. Hence, there are lots of variations on domination. In this section we concentrate on two of the more widely studied variants of domination: total domination and connected domination. The reader is directed to [71, 72] and also [42, 77, 96] which deal with other types of domination. A dominating set S of a graph G is said to be a total dominating set if GŒS has no isolated vertex; that is, a subset S of V .G/ is a total dominating set for G if every vertex in V .G/ is adjacent to a vertex of S . The total domination number of a graph G, denoted by t .G/, is the minimum size of any total dominating set of G. We call a total dominating set with cardinality t .G/ a t .G/-set. Note that since only graphs with no isolated vertex can contain a total dominating set, henceforth when referring to total domination, we assume all graphs under consideration have no isolates. Clearly, a graph with no isolated vertex contains at least one total dominating set, namely the set of all its vertices. It follows by definition that for any graph G with no isolated vertex, .G/ t .G/ and t .G/ 2: It is easy to see that for n 2; t .Kn / D 2 and for m; n 1; t .Km;n / D 2. Zwierzchowski [144] computed the total domination numbers of a path Pn and a cycle Cn .
4
Domination in Graphs
79
Lemma 1 ([144]). For integer n 3,
8n for n 0.mod4/; ˆ 2; ˆ < nC1 ; for n 1.mod4/; 2 t .Pn / D t .Cn / D nC2 ˆ ; for n 2.mod4/; ˆ 2 : nC1 ; for n 3.mod4/: 2
Total domination was first studied by Cockayne et al. [43] in 1980. Since then this topic has received much attention. An excellent survey of this topic may be found in the two books by Haynes et al. [71,72]. A more recent survey is due to Henning [82]. As is the case with domination number, determining the total domination number of a graph is also NP-complete (see [82]), so bounds on total domination number have been a natural subject for investigation. We begin with a property of minimum dominating sets in graphs established by Bollob´as and Cockayne [20] which leads to a relationship between domination and total domination numbers in a graph with no isolated vertex. Theorem 16 ([20] or see [82]). Every graph G with no isolated vertex has a minimum dominating set D in which each vertex v 2 D has the property that there exists a vertex v0 2 V .G/ D that is adjacent to v, but to no other vertex of D. Theorem 17 ([82]). For every graph G with no isolated vertex, .G/ t .G/ 2.G/. The next result concerns an upper bound on the total domination number in terms of the order of the graph. Theorem 18 ([43]). If G is a connected graph with .G/ 3, then t .G/ 2 .G/. 3 The 2-corona of a graph H , denoted by H ı P2 , is the graph obtained from H by adding a path of length 2 to each vertex of H . Brigham et al. [23] characterized graphs achieving the bound in Theorem 18 as follows. Theorem 19 ([23]). Let G be a connected graph with .G/ 3. Then t .G/ D 2 .G/ if and only if G is C3 ; C6 or H ı P2 for some connected graph H . 3 Henning [82] established an upper bound on the total domination number in terms of minimum degree and order. Theorem 20 ([82]). If G is a graph with ı.G/ 1, then .G/. t .G/ 1Cln.ı.G// ı.G/ When the minimum degree is increased, the bound on the total domination number in Theorems 18 and 20 can be improved. Theorem 21 ([80]). If G is a connected graph with ı.G/ 2 and G … fC3 ; C5 ; C6 ; C10 g, then t .G/ 47 .G/.
80
N. Ananchuen et al.
The bound in Theorem 21 was improved by Lam and Wei [94] by imposing an extra condition on the graph. Theorem 22 ([94]). Suppose G is a graph with ı.G/ 2. Then t .G/ 12 .G/ if either dG .u/ C dG .v/ 5 for every two adjacent vertices u and v of G or every component of the subgraph of G induced by its set of vertices having degree 2 has size at most one. Recently, Henning and Yeo [87] improved the bound in Theorem 21 for a connected graph G with ı.G/ 2 and .G/ 3 to 12 ..G/ C p/ where p is defined in terms of the sum of the number of paths having certain specified properties. For more details, the reader is directed to [87]. The next two results give upper bounds on the total domination number when the minimum degree is at least 3 or 4, respectively. Note that Theorem 23 can also be regarded as a corollary of Theorem 22. Theorem 23 ([15, 94, 127]). If G is a graph with ı.G/ 3, then t .G/ 12 .G/. Theorem 24 ([127]). If G is a graph with ı.G/ 4, then t .G/ 37 .G/. If the graph under consideration is planar, the next result is an immediate consequence of Theorem 14(i). Theorem 25 ([67]). If G is a planar graph with diam.G/ D 2, then t .G/ 3. Theorem 26 ([48]). Suppose G is a planar graph with diam.G/ D 3. Then (i) t .G/ 10. (ii) If rad.G/ D 2, then t .G/ 5. (iii) If G is sufficiently large, then t .G/ 7. Upper bounds on the total domination number have also been established in terms of the size of the graph ([81,121]), the girth ([47,74,86]), and the size of a maximum matching ([83, 85]). Bounds in the presence of forbidden subgraphs such as K1;3 ([53–55, 85]) have been studied as well. We now turn our attention to connected domination. A dominating set S for G is a connected dominating set if GŒS is connected. The minimum cardinality of a connected dominating set is called the connected domination number of G and is denoted by c .G/. We call a connected dominating set with cardinality c .G/, a c .G/-set. Note that since a graph must be connected to have a connected dominating set, henceforth when referring to connected domination, we assume all graphs under consideration are connected. It follows directly from the definitions that for a connected graph G; .G/ c .G/ and if .G/ D 1, then c .G/ D .G/. Further, a connected dominating set of size at least 2 is a total dominating set for G. Hence, .G/ t .G/ c .G/ for a connected graph G with .G/ < .G/ 1. It then follows that for a connected graph G and for k 2 f2; 3g; t .G/ D k if and only if c .G/ D k. Connected domination seems to have been studied first by Sampathkumar and Walikar [118] who attribute the terminology to Hedetniemi (see [71, 72, 77]). The
4
Domination in Graphs
81
algorithmic aspects of connected domination were first discussed by Garey and Johnson in [65] where they claimed that determining the connected domination number of a graph is NP-complete, even when the graph is planar and regular of degree 4. For a summary of the algorithmic status of connected domination for various special graph classes, see [45, 50, 108, 138]. For relations between connected domination and other graph parameters (see [19, 56, 76, 100, 110, 120]). We begin with the connected domination number for some special graph classes. Theorem 27 ([118]). (i) c .Kn / D 1.
1; if either m D 1 or n D 1, 2; if m; n 2. (iii) c .Pn / D c .Cn / D n 2 for n 3. (iv) For any tree T with .T / 3; c .T / D .T / p.T /, where p.T / denotes the number of endvertices in T . (ii) c .Km;n / D
Sampathkumar and Walikar [118] pointed out that the connected domination number of a graph is bounded above by the connected domination number of any spanning subgraph. They then used this fact together with Theorem 27(iv) to establish an upper bound on the connected domination number of graphs. Theorem 28 ([118]). For a connected graph G with .G/ .G/ 2:
3; c .G/
The same two authors [118] also provided a bound for the connected domination number in terms of the maximum degree, the order, and the size of the graph. j k .G/ Theorem 29 ([118]). For a connected graph G; .G/C1 c .G/ 2".G/ .G/: Note that a graph G containing a vertex of degree .G/ 1 satisfies the lower bound and a path Pn of order n satisfies the upper bound. Hence, both these bounds are sharp. In 1984, Hedetniemi and Laskar [76] observed a relationship between the connected domination number and the number of endvertices in a spanning tree. They then gave an upper bound on the connected domination number in terms of the maximum degree of the graph. Theorem 30 ([76]). Let G be a connected graph. Then (i) c .G/ C p.T / D .G/ where p.T / is the maximum number of endvertices in any spanning tree of G. (ii) c .G/ .G/ .G/. Kleitman and West [91] provided a result concerning the minimum number of leaves that a spanning tree in a connected graph with specified minimum degree can have. Combining their result together with Theorem 30(i), an upper bound on the connected domination number of graphs can be obtained.
82
N. Ananchuen et al.
Theorem 31 ([91]). Let G be a connected graph with ı.G/ k. Then G contains j k .G/ a spanning tree with at least .G/ 3 kC1 C 2 leaves. Corollary 2j ([71], k page 163). If G is a connected graph with ı.G/ k, then .G/ c .G/ 3 kC1 2. Bounds on the connected domination number have been obtained by Duchet and Meyneil [49] (in terms of the domination number) and by Favaron and Kratsch [56] (in terms of the total domination number). Theorem 32 ([49]). For a connected graph G; c .G/ 3.G/ 2. Theorem 33 ([56]). For a connected graph G; c .G/ 2t .G/ 2. Before closing this section, we must mention the famous conjecture on domination due to Vizing [135] which remains unsettled. Conjecture 1. For any graphs G and H , if G H denotes the Cartesian product of G and H , then .G/.H / .G H /: The best bound known in this sense is due to Clark and Suen [41]. Theorem 34 ([41]). For any graphs G and H , .G/.H / 2.G H /. Vizing’s conjecture may also be made for total and for connected domination. For total domination, Ho [88] has established the same bound as that of Clark and Suen. Theorem 35 ([88]). For any graphs G and H , t .G/t .H / 2t .G H /: As far as the authors know, no analogous bound has been established for the connected domination version of Vizing’s conjecture.
4.4 Results on Criticality In studying a graph parameter P , it is often useful to study a more restricted class of graphs, the so-called critical graphs. That is, a graph with parameter P , but in which an alteration of a certain type (such as edge addition, edge deletion, or vertex deletion) results in a graph no longer having property P . In this section, we study graphs edge-critical and vertex-critical with respect to graph parameter P where P 2 f; t ; c g. Edge-critical graphs are graphs in which P decreases upon the addition of any missing edge while vertex-critical graphs are graphs in which P decreases when any vertex is removed. More precisely, we say that a graph G is k-P -edge-critical if P .G/ D k and P .G C e/ < k for every edge e 2 E.G/ and G is k-P -vertex-critical if P .G/ D k but for each vertex v of G, P .G v/ < k. If we do not specify a value k, we simply say that a graph is P -edge-critical or P -vertex-critical. Of the two concepts of edge-criticality and
4
Domination in Graphs
83
vertex-criticality, edge-criticality has received more attention as we show in the coming subsections. Although the class of k-P -edge-critical graphs and the class of k-P -vertex-critical graphs are not the same, note that every k-P -vertex-critical graph can be extended to one that is both vertex- and edge-critical by successively adding edges that do not decrease P (see [24]). For each P 2 f; c g, it is well known that 1-P -edge-critical graphs are precisely the complete graphs Kn for all positive integers n, whereas the only 1-P -vertex-critical graph is K1 . Remark 1. Suppose G is a k-P -edge-critical graph where P 2 f; c ; t g and u and v are nonadjacent vertices of G. Then at least one of u and v is in a P .G/-set for G C uv. Further, if P D , then exactly one of u and v is in a .G/-set for G C uv.
4.4.1 k--Edge-Critical Graphs k--edge-critical graphs were first studied by Sumner and Blitch [126] in 1983. Most of their results were concerned with the cases 2 k 3. They gave a characterization of 2- -edge-critical graphs and 3- -edge-critical disconnected graphs as we show in Theorem 36. Since then the concept of connected k- -edge-critical graphs for k 3 has received considerable attention. Most of the known results are confined to the case k D 3. These graphs have been studied with respect to graph parameters such as toughness and matching, [2, 3, 5, 6, 8, 10, 36] Hamiltonicity [32, 34, 37, 38, 51, 58, 107, 109, 128, 139, 141–143], and more [35, 57, 59, 73, 89, 112, 113, 122, 125, 132, 143]. We do not intend to list all of these results, but give a brief survey on connected 3- -edge-critical graphs. For k 4, connected k- edge-critical graphs are far from completely understood. In fact, even for k D 3, no characterization of such graphs is known. The following lemma follows immediately from the definition of k- -edgecriticality. Lemma 2. Suppose G is k- -edge-critical and u and v are nonadjacent vertices of G. Then (i) .G C uv/ D k 1. (ii) There is a subset S of V .G/ fu; vg of size k 2 such that either S [ fug dominates G v or S [ fvg dominates G u. Further, if S [ fvg dominates G u, then S \ NG .u/ D ;. The following characterizations of 2- -edge-critical graphs and disconnected 3--edge-critical graphs were established by Sumner and Blitch [126]. Theorem 36 ([125, 126]). (i) A graph G is 2- -edge-critical if and only if G D are positive integers.
Sn
i D1 K1;ri
where ri and n
84
N. Ananchuen et al.
(ii) A graph G is a 3- -edge-critical disconnected graph if and only if G is a disjoint union of a 2--edge-critical graph and a complete graph K1 or a disjoint union of a complete graph with a perfect matching removed and a complete graph Kn where n 1. Before stating the next result, we need some new notation. If u; v, and w are vertices of G and fu; vg dominates G w, then we write Œu; v ! w. This so-called arrow notation made its first appearance in [126]. Note that if G is 3- -edge-critical and u and v are nonadjacent vertices of G, then .G C uv/ D 2 and so there is a vertex z 2 V .G/ fu; vg such that Œu; z ! v or Œv; z ! u. Sumner and Blitch [126] proved the next theorem for the case n 4. The cases n D 2 and 3 were added by Flandrin et al. [59]. This result is the most useful tool in studying 3--edge-critical graphs yet available. Theorem 37 ([59, 126]). Let G be a connected 3- -edge-critical graph and let S be an independent set of n 2 vertices in V .G/: (i) Then the vertices of S can be ordered as a1 ; a2 ; : : : ; an in such a way that there exists a sequence of distinct vertices x1 ; x2 ; : : : ; xn1 so that Œai ; xi ! ai C1 for i D 1; 2; : : : ; n 1. (ii) If, in addition, n 4, then the xi ’s can be chosen so that x1 ; x2 ; : : : ; xn1 span a path and S \ fx1 ; x2 ; : : : ; xn1 g D ;. The next result concerns the diameter and number of components of 3- -edgecritical graphs. Theorem 38 ([126]). Suppose G is a connected 3- -edge-critical graph. Then (i) 2 diam.G/ 3. (ii) If S is a vertex cutset in G, then !.G S / jS j C 1. Ananchuen and Plummer [2, 6, 8] sharpened Theorem 38(ii) as follows. Theorem 39 ([2, 6, 8]). Let G be a connected 3- -edge-critical graph and let S be a vertex cutset in G. Then (i) If jS j 6; !.G S / jS j 2. (ii) If jS j 4; !.G S / jS j 1. (iii) If 4 jS j 5 and each component of G S has at least three vertices, then !.G S / jS j 2. (iv) If jS j D 3, then !.G S / 3 and if G S has exactly three components, then each component is complete and at least one of them is a singleton. (v) If jS j D 2, then !.G S / 3 and if G S has exactly three components, then G must be the graph shown in Fig. 4.3 with n 2. (vi) If jS j D 1, then !.G S / D 2 and exactly one of the components of G S is a singleton. Furthermore, G has at most three cutvertices. If it has two, then G is a graph of the type shown in Fig. 4.3 with n 2, and if it has three, it is the graph shown in Fig. 4.3 with n D 1.
4
Domination in Graphs
85
Fig. 4.3 A 3--edge-critical graph with a cutvertex 2K1
K2 +
Kn
+
K1
n≥1
Theorem 38(ii) together with Theorem 39 might be considered a result on toughness. Both are useful for establishing results on matchings in Sect. 4.5. The toughness of a graph G denoted by .G/ is min fjS j=!.G S / : S is a vertex cutset of Gg. A graph G is said to be t-tough if .G/ t: Remark 2. By Theorem 38(ii), if G is a connected 3--edge-critical graph, then G is 1/2-tough. Further, if ı.G/ 2, then G is 2-connected, by Theorem 39, and thus .G/ 1 (see also [36]). In fact, Blitch [18] proved that if G is a connected 3-edge-critical graph containing v as a cutvertex, then v is adjacent to an endvertex of G. Hence, if ı.G/ D 1, then .G/ < 1. Chen et al. [36] gave a characterization of connected 3- -edge-critical graphs with toughness 1. We now turn our attention to Hamiltonicity. In 1990, Wojcicka [139] proved that every connected 3- -edge-critical graph of order at least 7 has a Hamiltonian path. (A shorter proof was given in 2002 by Zhang and Tian [143].) Wojcicka then posed the following conjecture. Conjecture 2. Every connected 3- -edge-critical graph having minimum degree at least 2 has a Hamiltonian cycle. Moreover, she conjectured that, in general, for k 3, .k 1/-connected k--edge-critical graphs are Hamiltonian. Yuansheng et al. [142] showed that this conjecture is not true for k D 4 by constructing a class of 3-connected 4-edge-critical non-Hamiltonian graphs. Conjecture 2 was settled via the following two results and is now referred to as “Wojcicka’s theorem” by Mynhardt [109]. Theorem 40 ([58]). If G is a connected 3- -edge-critical graph with ı.G/ 2, then ˛.G/ ı.G/ C 2. Theorem 41 ([58, 128]). Suppose G is a connected 3- -edge-critical graph with ı.G/ 2: (i) If ˛.G/ ı.G/ C 1, then G is Hamiltonian. (ii) If ˛.G/ D ı.G/ C 2, then G is Hamiltonian. Part (i) of the above theorem was proved by Favaron et al. [58] and Tian et al. [128] established part (ii). The next corollary is a consequence of Wojcicka’s theorem and Remark 2, together with the observation that if a graph G is Hamiltonian, then .G/ 1. Corollary 3. Suppose G is a connected 3- -edge-critical graph. Then G is Hamiltonian if and only if .G/ 1.
86
N. Ananchuen et al.
Recently, Chen and Tian [34] obtained an even simpler proof of Wojcicka’s theorem by using Hanson’s [68] and Bondy–Chv´atal’s [21] closure operations. A result closely related to Wojcicka’s theorem was proved by Xue and Chen [141]. They established that if G is a connected 3--edge-critical with ı.G/ D 1, then G A is Hamiltonian where A D fv 2 V .G/jdG .v/ D 1g. A graph G is Hamiltonian-connected if every two distinct vertices are joined by a Hamiltonian path. Chen et al. [37] posed a conjecture similar to that of Wojcicka. Conjecture 3. A connected 3- -edge-critical graph is Hamiltonian-connected if and only if .G/ > 1. This conjecture was proved in a series of four papers [32, 37, 38, 51] by Chen, Cheng, Ng, Tian, Wei, and Zhang.
4.4.2 k-t -Edge-Critical Graphs The concept of a k-t -edge-critical graph was first introduced by van der Merwe et al. [130] in 1998. Since t .G/ 2 for any graph G with no isolates, the first nontrivial case for k-t -edge-critical graphs is k D 2. But it is easy to show that the only 2-t -edge-critical graphs are the complete graphs Kn with n 2. Most of the nontrivial results on k-t -edge-critical graphs are concerned with the case k D 3 and were established by van der Merwe et al. [130, 131, 133, 134], Hanson and Wang [69], and more recently by Simmons [123]. In [130] van der Merwe et al. showed that the addition of an edge to a graph may decrease the total domination number of the resulting graph by at most two. Theorem 42 ([130]). For any edge e 2 E.G/, t .G/ 2 t .G C e/ t .G/. It then follows that if G is a k-t -edge-critical graph, then for an edge e 2 E.G/; t .G C e/ D k 1 or k 2. Observe that if G is k-t -edge-critical, then for any pair of nonadjacent vertices u and v of G, at least one of u and v must be in a minimum total dominating set for G C uv. Further, if t .G C uv/ D k 2, then u and v share a minimum total dominating set for G C uv. A k-t -edge-critical graph G with t .G Ce/ D k 2 for every edge e 2 E.G/ is called supercritical (cf. [130]). These graphs were characterized by van der Merwe et al. [131]. Theorem 43 ([131]). A graph G is supercritical if and only if G is the union of two or more nontrivial complete graphs. We now turn our attention to 3-t -edge-critical graphs. Theorem 44 ([130]). Suppose G is a 3-t -edge-critical graph. Then (i) 2 diam.G/ 3. (ii) Every vertex of G is adjacent to at most one endvertex. (iii) G has at most one cutvertex.
4
Domination in Graphs
87
Note that Theorem 44(ii) also holds for k-t -edge-critical graphs for k 3. Further, it follows by Theorem 44(iii) that no tree is 3-t -edge-critical. The next two results provide information on 3-t -edge-critical graphs containing a cutvertex. Theorem 45 ([130]). Suppose G is a 3-t -edge-critical containing x as a cutvertex. Then (i) (ii) (iii) (iv)
x 2 t .G/-set for every t .G/-set of G. diam.G/ D 3. G x has exactly two components. x is adjacent to an endvertex.
Theorem 46 ([130]). Let G be a graph with a pendent edge uv (where v is a cutvertex and u an endvertex) and let A D N.v/ fug and B D V .G/ N Œv: Then G is 3-t -edge-critical if and only if: (i) GŒA is complete and jAj 2. (ii) GŒB is complete and jBj 2. (iii) Every vertex in A is adjacent to jBj 1 vertices in B and every vertex in B is adjacent to at least one vertex in A. The next corollary follows immediately. Corollary 4 ([130]). If G is a 3-t -edge-critical with an endvertex u, then (i) .G/ D 2. (ii) G u is Hamiltonian. van der Merwe et al. [130] proved that for any graph G, there is a 3-t -edgecritical graph H such that G is an induced subgraph of H . Consequently, it is not possible to characterize 3-t -edge-critical graphs in terms of forbidden subgraphs. Simmons [123] defined the closure of a 3-t -edge-critical graph G, denoted by D t .G/, to be the graph obtained from G by adding the edge uv to G for each pair of nonadjacent vertices u and v if fu; vg dominates G. It was then shown that: Theorem 47 ([123]). For any 2-connected 3-t -edge-critical graph G; G is Hamiltonian if and only if D t .G/ is Hamiltonian. Simmons [123] also established several results for D t .G/ and showed that these results also hold for G when G is 3-t -edge-critical. Theorem 48 ([123]). Let G be a 3-t -edge-critical graph and I an independent set in G with jI j D m 3. Then the vertices in I can be ordered as a1 ; a2 ; : : : ; am in such a way that there exists a path x1 ; x2 ; : : : ; xm1 in G I where fxi ; ai g is a minimum total dominating set for G ai C1 for i D 1; 2; : : : ; m 1: Theorem 49 ([123]). Let G be a 2-connected 3-t -edge-critical graph. If the independence number ˛.G/ 3, then ˛.G/ ı.G/C2: Moreover, if ˛.G/ D ı.G/C2, then every maximum independent set contains all the vertices of degree ı.G/.
88
N. Ananchuen et al.
Theorem 50 ([123]). Let G be a connected 3-t -edge-critical graph. If S is a vertex cutset of G, then G S has at most jS j C 1 components. Note that Theorems 48 and 50 are analogous to Theorems 37 and 38(ii), respectively.
4.4.3 k-c -Edge-Critical Graphs k-c -edge-critical graphs were first introduced by Chen et al. [33] in 2004. They gave a characterization of 2-c -edge-critical graphs and provided conditions for some particular classes of graphs to be critical. They also established some results concerning the case k D 3, most of which have previous analogues for ordinary domination critical graphs. Ananchuen [1] studied k-c -edge-critical graphs with cutvertices and gave a characterization for such graphs when k D 3. Ananchuen et al. [11] studied matching properties in 3-c -edge-critical graphs as we show in Sect. 4.5. The first result in this section shows that the addition of an edge to a graph may decrease the connected domination number of the resulting graph by at most two. Thus this result is analogous to Theorem 42 for total domination number. Theorem 51 ([33]). Let G be a connected graph. For any edge e 2 E.G/; c .G/ 2 c .G C e/ c .G/: It then follows that if G is k-c -edge-critical, then for each e 2 E.G/; c .G C e/ D k 1 or k 2. The next result provides a characterization of 2-c -edge-critical graphs. Theorem 52 ([33]). A connected graph G is 2-c -edge-critical if and only if G D Sn i D1 K1;ri for ri 1 and n 2. By Theorem 36(i), it is easy to see that G is a connected 2- -edge-critical graph if and only if G is a 2-c -edge-critical graph. Chen et al. [33] proved that for an integer n 3, no path or tree of order n is c -edge-critical. Further, neither K1;k , for a positive integer k 2, nor Kr;s , for maxfr; sg 3, where r and s are positive integers, is c -edge-critical. However, Cn , a cycle of order n, is c -edge-critical for every integer n 4. For k D 3, Chen et al. [33] established a bound on the diameter and the number of components of k-c -edge-critical graphs analogous to Theorem 38. (Just replace with c .) Ananchuen [1] studied k-c -edge-critical graphs with cutvertices and established the following. Theorem 53 ([1]). For k 3, let G be a k-c -edge-critical graph with a cutvertex x. Then (i) x 2 S for every c .G/-set S of G. (ii) G x contains exactly two components.
4
Domination in Graphs
89
(iii) If C is a component of G x, then c .C / k 1 and GŒNC .x/ is complete. Further, if c .C / D k 1, then C is .k 1/-c -edge-critical. Theorem 54 ([1]). For k 3, let G be a k-c -edge-critical graph with a cutvertex x. Suppose C1 and C2 are the components of G x. Let A D GŒV .C1 / [ fxg and B D GŒV .C2 / [ fxg. Then (i) k 1 c .A/ C c .B/ k. (ii) c .A/ C c .B/ D k if and only if exactly one of C1 and C2 is a singleton. For 3-c -edge-critical graphs, Ananchuen [1] improved the result of Chen et al. [33] on a number of components. Theorem 55 ([1]). Let G be a 3-c -edge-critical graph and S a vertex cutset of G with jS j 2. Then !.G S / jS j. One might expect a result analogous to Theorem 39 for 3-c -edge-critical graphs. But this is not the case. In [1] it was shown that the bound in Theorem 55 is best possible.
4.4.4 k--Vertex-Critical Graphs Recall that a graph G is k- -vertex-critical if .G/ D k and .G v/ < k for each vertex v 2 V .G/. It is not difficult to see, for example, that C3kC1 is .k C 1/ -vertex-critical. Clearly, a disconnected graph G is -vertex-critical if and only if each component of G is -vertex-critical. So in the rest of this section, we concern ourselves with connected graphs only. The concept of k- -vertex-criticality was first introduced by Brigham et al. [24,25]. Clearly, the only 1- -vertex-critical graph is K1 . Brigham et al. [25] pointed out that the 2--vertex-critical graphs are precisely those obtained from the complete graphs K2n by deleting a perfect matching. For k > 2, an understanding of the structure of k--vertex-critical graphs is far from complete. However, some structural properties have been established in terms of an upper bound on the order [24, 25] and the diameter [63, 64]. In what follows, Dv denotes any minimum dominating set for G v. The first result provides basic properties that have proved very useful in studying k--vertexcritical graphs. Lemma 3 ([24, 25]). Let G be a k--vertex-critical graph. Then (i) (ii) (iii) (iv)
For each v 2 V .G/; jDv j D k 1 and NG Œv \ Dv D ;. For every pair of distinct vertices u and v, Du ¤ Dv . If dG .v/ 1, NG Œv is not complete. There exists no pair of vertices u and v of G such that NG Œu NG Œv.
90
N. Ananchuen et al.
The next result establishes an upper bound on the order of a k- -vertex-critical graph. Theorem 56 ([24, 25]). Let G be a k- -vertex-critical graph. Then (i) .G/ ..G/ C 1/.k 1/ C 1. (ii) .G/ 13 .2".G/ C 3k .G//. Brigham et al. [24] conjectured that if G is a k--vertex-critical graph with .G/ D ..G/ C 1/.k 1/ C 1, then G is regular. This conjecture was settled in the affirmative by Fulman et al. [64]. In the same paper [24], Brigham et al. also posed a conjecture on an upper bound of the diameter of k--vertex-critical connected graphs which they proved for k 5 and which Fulman et al. [64] later proved for k 2. Theorem 57 ([64]). The diameter of a k- -vertex-critical connected graph is at most 2.k 1/. Fulman et al. [64] showed that the bound in Theorem 57 is best possible. They also characterized 3- -vertex-critical graphs with diameter 4 and 4- -vertex-critical graphs with diameter 6 described in Theorem 58. Recall that a block of a graph is a maximal connected subgraph of G with no cutvertices of itself. An end block of G is a block containing exactly one cutvertex of G. Theorem 58 ([64]). (i) A graph G with diameter 4 is 3- -vertex-critical if and only if G has two blocks, each of which is 2- -vertex-critical. (ii) A graph G with diameter 6 is 4- -vertex-critical if and only if it has three blocks, two of which are end blocks and all of which are 2- -vertex-critical. Before proceeding, we need a new definition. Let G and H be disjoint graphs. H G, the coalescence of H and G, is the graph obtained by identifying one vertex of H with one vertex of G. (Note that the identified vertices become a cutvertex of H G.) Brigham et al. [24, 25] showed that: Theorem 59 ([24, 25]). Let H and G be graphs ¤ K1 . Then (i) .H / C .G/ 1 .H G/ .H / C .G/. (ii) If both H and G are -vertex-critical or if H G is -vertex-critical, then .H G/ D .H / C .G/ 1. (iii) H G is -vertex-critical if and only if both H and G are -vertex-critical. They then used the above result and induction to establish the following. Theorem 60 ([24,25]). A graph G is -vertex-critical if and only if each block of G is -vertex-critical. Further,Pif G is -vertex-critical and contains G1 ; G2 ; : : : ; Gn as its blocks, then .G/ D niD1 .Gi / .n 1/.
4
Domination in Graphs
91
Brigham et al. [24, 25] also used the idea of coalescence to show that any graph G with .G/ D k 3 can be embedded in a k- -vertex-critical graph. They first showed that for a given graph G with .G/ 3, there exists a 3--vertex-critical graph H containing G as an induced subgraph. The graph H can be constructed as follows. Let V .G/ D fv1 ; v2 ; : : : ; vp g. Note that p 3 since .G/ 3. Now let V .H / D fv1 ; v2 ; : : : ; vp ; w1 ; w2 ; : : : ; wp ; x1 ; x2 ; : : : ; xp g and E.H / D E.G/ [ fwi xj ; wi vj ; xi vj j1 i; j p and j ¤ i g. It is not difficult to show that H is 3--vertex-critical. Clearly, if .G/ D k D 3, then H is the required graph in which G can be embedded. If .G/ D k 3, then they showed that H C3.k3/C1 is the desired graph in which G can be embedded. Note that .H C3.k3/C1 / D .H / C .C3.k3/C1 / 1 D 3 C .k 2/ 1 D k. Hence we have the following theorem. Theorem 61 ([24, 25]). Let G be any graph with .G/ D k 3. Then (i) There exists a 3- -vertex-critical graph H containing G as an induced subgraph. (ii) G can be embedded in a k- -vertex-critical graph. Note that for any graph G, .G [ 2K1 / 3, thus Theorem 61(i) also holds for any graph G with .G/ < 3. It follows immediately by Theorem 61 that it is not possible to characterize k- vertex-critical graphs in terms of forbidden subgraphs. A graph is claw-free if it does not contain the graph K1;3 as an induced subgraph. Ananchuen and Plummer [7] studied the connectivity of claw-free 3--vertexcritical graphs in terms of minimum degree. They showed that: Theorem 62 ([7]). Let G be a connected claw-free 3- -vertex-critical graph. Then (i) G is 2-connected. (ii) If G is of even order or if ı.G/ 3, then G is 3-connected. (iii) If ı.G/ 5, then G is 4-connected. We conclude this section by reminding the reader that the concept of vertex criticality may also be applied to other variations of domination such as distance domination (see [72] Chap. 12, and [84, 129]), as well as independent domination [14]. (See also [26–28, 39, 75, 115].)
4.4.5 k-P-Vertex-Critical Graphs Where P 2 ft ; c g Observe that a graph containing an isolated vertex cannot be totally dominated with any vertex set. Similarly, a disconnected graph cannot be dominated by any connected dominating set. Hence, it makes sense to add an extra assumption for a vertex to be deleted when we want to study vertex deletion with respect to total domination and connected domination.
92
N. Ananchuen et al.
A graph G with no isolated vertex is k-t -vertex-critical if t .G/ D k and for each v 2 V .G/ that is not adjacent to any vertex of degree one, t .G v/ < k. A graph G with .G/ 2 is k-c -vertex-critical if c .G/ D k but c .G v/ < k for every vertex v 2 V .G/. Note that if we assume that the connectivity of G is at least 2, then G is 3-c -vertex-critical if and only if G is 3-t -vertex-critical. Hence, for graphs with connectivity at least 2, results dealing with 3-c -vertex-critical graphs may be interpreted as results pertaining to 3-t -vertex-critical graphs and vice versa since for any graph G; c .G/ D 3 if and only if t .G/ D 3. k-t -vertex-critical graphs were first studied by Goddard et al. [66] in 2004 and later on by Mojdeh and Rad [105, 106]. It is easy to see that G is t -vertex-critical if and only if each component of G is t -vertex-critical. So we restrict our attention to connected graphs only. The following basic result is similar to Lemma 3. Lemma 4 ([66]). Suppose G is a k-t -vertex-critical graph. Let S.G/ D fu 2 V .G/ju is a support vertex in Gg. Then (i) For each v 2 V .G/ S.G/, if Dv is a minimum total dominating set for G v, then jDv j D k 1 and Dv \ NG Œv D ;. (ii) For each v 2 V .G/ S.G/, there is no vertex u of G with uv … E.G/ and NG .u/ NG .v/. Theorem 63 ([66]). Let G be a connected graph of order at least 3 with at least one endvertex. Then, G is k-t -vertex-critical if and only if G D H ı K1 for some connected graph H of order k with ı.H / 2. It follows immediately by Theorem 63 that no tree is t -vertex-critical. A graph H is vertex diameter k-critical if diam.H /Dk and diam.H v/ > k. Hanson and Wang [69] observed that for a graph G; t .G/ D 2 if and only if diam.G/ > 2. By combining this result together with a concept of vertex diameter k-criticality, Goddard et al. [66] obtained the following characterization. Theorem 64 ([66]). A connected graph G is 3-t -vertex-critical if and only if G is vertex diameter 2-critical or G is K3 ı K1 . Goddard et al. [66] also gave an upper bound for the diameter of k-t -vertexcritical graphs which is sharp for small k. Theorem 65 ([66]). Let G be a k-t -vertex-critical graph. Then (i) diam.G/ 2k 3. (ii) For k 8, the diameter of G is at most the value given by Table 4.1. Table 4.1 Upper bounds on the diameter of k-t -vertex-critical graphs with 3 k 8
k
3
4
5
6
7
8
diam.G/
3
4
6
7
9
11
4
Domination in Graphs
93
Finally, they posed several open problems, for example, the characterization of a k-t -vertex-critical graph G of order .G/.k 1/ C 1 and k C .G/, respectively. These two problems were addressed by Mojdeh and Rad [105, 106] and more recently by Wang et al. [136]. We now turn our attention to k-c -vertex-critical graphs. It is easy to see that the only 1-c -vertex-critical graph is K1 and the 2-c -vertex-critical graphs are obtained from the even complete graphs K2n , with n 2, by deleting a perfect matching. For k 3, the structure of k-c -vertex-critical graphs is much more complicated. k-c -vertex-critical graphs were studied in [12, 13], where most of the results are concerned with 3-c -vertex-critical graphs. Some basic properties of 3-c -vertexcritical graphs especially with respect to connectivity are established which were used to study matching properties in 3-c -vertex-critical graphs as we show in the next section. The following result is analogous to Lemma 3(i, ii, iv). Lemma 5 ([12]). Suppose G is k-c -vertex-critical. Let Dv be a minimum connected dominating set for G v. Then (i) (ii) (iii) (iv)
If v 2 V .G/, Dv \ NG Œv D ;. If u; v 2 V .G/ and u ¤ v, then Du ¤ Dv . If v 2 V .G/, then jDv j D k 1. If v 2 V .G/, then there is no u ¤ v such that NG Œv NG Œu.
Theorem 66 ([12]). If G is a 3-c -vertex-critical graph, then either G D C5 or G is 3-connected. In the case when G is exactly 3-connected, we can say more about its structure. Theorem 67 ([12]). Suppose G is a 3-c -vertex-critical graph and S is a vertex cutset in G with jS j D 3. Then (i) jE.GŒS /j 1. (ii) G S consists of precisely two components. Theorem 67 can then be used to establish the following results. Theorem 68 ([12]). Suppose G is a 3-c -vertex-critical graph and S is a minimum vertex cutset in G with jS j D 3. Let C1 and C2 be the two components of G S where jV .C1 /j jV .C2 /j. Then (i) Either jV .C1 /j 2 or jV .C2 /j 2. (ii) If jV .C1 /j D 2, then jV .C2 /j D 2, and G is isomorphic to the graph G0 in Fig. 4.4. (iii) If jV .C1 /j D 1 and S is independent, then G is isomorphic to one of G0 or G00 , both of which are shown in Fig. 4.4. (iv) If jV .C1 /j D 1 and S contains an edge, then G has G1 or G2 as a spanning subgraph, where G1 and G2 are shown in Fig. 4.5.
94
N. Ananchuen et al.
Go
G⬘o
Fig. 4.4 The 3-c -vertex-critical graphs G0 and G00
Kn
Kn
(Kn + Kn) - perfect matching
G1
Kn
Kn
(Kn + Kn)-perfect matching
G2
Fig. 4.5 The graphs G1 and G2
4.5 Matching Properties Recall that a perfect matching in a graph G is a matching that covers all of the vertices of G while a near-perfect matching is a matching that covers all but one of the vertices of G. A graph G is k-factor-critical if and only if for every set S V .G/ with jS j D k, the graph G S contains a perfect matching. Note that if G is k-factor-critical then .G/ k.mod 2/. k-factor-critical graphs are called factor-critical if k D 1 and bicritical if k D 2. Factor critical and bicritical graphs play an important role in a canonical decomposition theory for arbitrary graphs in term of their matchings. The interested reader is referred to [101] for much more on this subject. In this section, we are concerned with the existence of a perfect matching, a nearperfect matching, and being k-factor-critical for the classes of 3-P -edge-critical graphs and 3-P -vertex-critical graphs where P 2 f; c g.
4.5.1 3-P-Edge-Critical Graphs and Matching Properties We begin by recalling Tutte’s famous theorem on perfect matchings.
4
Domination in Graphs
95
Theorem 69 (Tutte’s theorem (see [22] page 76)). A graph G has a perfect matching if and only if !o .G S / jS j, for all S V .G/. By combining Theorem 38(ii) and Tutte’s theorem, the first part of Theorem 70 below follows immediately for P D . This was established by Sumner and Blitch [126]. For P D c ; Chen et al. [33] also established a result similar to Theorem 38(ii). So the first part of Theorem 70 also holds for P D c ; (see [33]). The second part of Theorem 70 was established in [3] for P D and in [11] for P D c : Theorem 70 ([3, 11, 33, 126]). For P 2 f; c g, let G be a connected 3-P -edgecritical graph. Then (i) If .G/ is even, G contains a perfect matching. (ii) If .G/ is odd, G contains a near-perfect matching. Sufficient conditions for 3- -edge-critical graphs to be k-factor-critical for k D 1; 2; 3 are presented next. Theorem 71 ([3, 10]). Suppose G is a 3- -edge-critical graph. (i) If G is 2-connected of odd order, then G is factor-critical. (ii) Suppose further that G is 3-connected of even order and if G is either planar or having minimum degree at least 4, then G is bicritical. (iii) If G is 4-connected of odd order and ı.G/ 5, then G is 3-factor-critical. The next theorem shows that the hypotheses on both the connectivity and minimum degree in Theorem 71 can be relaxed if the graph under consideration is claw-free. Theorem 72 ([3,10]). Suppose G is a 3- -edge-critical claw-free graph. Then, for k 2 f2; 3g, if G is k-connected with ı.G/ k C 1 and .G/ k.mod2/, then G is k-factor-critical. In [10] it was conjectured that Theorem 72 holds for k 2. The following conjecture was also posed. Conjecture 4. Suppose G is a graph with k 2 and suppose k 1 and .G/ have the same parity. Then if G is k-connected and 3- -edge-critical with ı.G/ k C 1, G is .k 1/-factor-critical. Now we turn our attention to sufficient conditions for 3-c -edge-critical graphs to be k-factor-critical graphs for k D 1; 2; 3. Theorem 73 ([11]). Suppose G is a 3-c -edge-critical graph. (i) If .G/ D 2n C 1 5 and ı.G/ 2, then G is factor-critical. (ii) If G is 3-connected with .G/ D 2n 8 and ı.G/ n1, then G is bicritical. (iii) If G is 4-connected of odd order and K1;4 -free, then G is 3-factor-critical. Note that the above minimum degree requirement of 3-c -edge-critical graphs to be bicritical is much stronger than that for 3- -edge-critical graphs. However, this bound is sharp and it cannot be lowered even if the connectivity is increased.
96
N. Ananchuen et al.
4.5.2 3-P-Vertex-Critical Graphs and Matching Properties From the point of view of matchings, the properties of 3-P -vertex-critical graphs, for P 2 f; c g, differ quite dramatically from those of the 3-P -edge-critical graphs. For example, by Theorem 70, every connected even 3-P -edge-critical graph must have a perfect matching and every connected odd 3-P -edge-critical graph must have a near-perfect matching. These conclusions do not hold for general 3-P -vertexcritical graphs as shown below. We first present an infinite family Hk;.k/k of 3--vertex-critical graphs (see [4]) 2 and an infinite family Jk of 3-c -vertex-critical graphs (see [12]). Let k be any positive integer with k 5. We proceed to construct the graph which we call Hk;.k/k . The vertex set consists of two disjoint subsets of vertices 2 called central and peripheral, respectively. Let fv1 ; v2 ; : : : ; vk g denote the set of central vertices. The subgraph induced by these central vertices will be the complete graph Kk with the Hamiltonian cycle v1 v2 vk v1 deleted. The peripheral vertices
will be k2 k in number and will be denoted by the symbol fi; j g where the
(unordered) pair fi; j g (i ¤ j ) ranges over all the k2 k subsets of size 2 of the set 1; : : : ; k, except those having j D i C 2 where i C 2 is read modulo k. The neighbor set of peripheral vertex fi; j g will be precisely the set of all central vertices, except i and j . There are no edges joining pairs of peripheral vertices. Let k 6 be a positive integer. We construct the graph Jk as follows. Let the integers 1; 2; : : : ; k span a complete k-graph with the Hamiltonian cycle 12 k1 removed. These k vertices are called central vertices. Consider a second set of k.k 3/=2 k peripheral vertices labeled with unordered pairs of distinct integers fi; j g, 1 i < j k, except for exactly those pairs of the form fi; i C 1g and fi; i C 2g modulo k. Now join the pair labeled fi; j g to all central vertices except i and j . Figure 4.6 shows graphs H6;9 and J6 , respectively. It is not difficult to see that the graphs Hk;.k/k for k 6 and Jk for k 8 do 2 not contain a perfect (or near-perfect) matching. Hence, 3-P -vertex-critical graphs, for P 2 f; c g, need not have a perfect (or near-perfect) matching. So what might be some reasonable conditions one might place on a 3-P -vertex-critical graph sufficient to guarantee the existence of a perfect (or near-perfect) matching? One of the classical theorems about matching is the following, due independently to Sumner [124] and Las Vergnas [95]. Theorem 74 ([95, 124]). Every connected claw-free graph of even order has a perfect matching. The next result can be considered as a variation on this theme. Theorem 75 ([4, 9]). Suppose G is a K1;5 -free 3--vertex-critical graph. Then (i) If .G/ is even, then G has a perfect matching. (ii) If .G/ 11 is odd with ı.G/ 1, then G has a near-perfect matching.
4
Domination in Graphs
97
~{1, 4} ~{4, 5}
~{3, 4}
1
~{1, 4} 2
6
1 ~{2, 3}
~{5, 6} 3
5 4
~{2, 5} ~{1, 2}
~{3, 6} ~{1, 6}
6
2
5
3
~{2, 5}
H6, 9
4
~{3, 6}
J6
Fig. 4.6 The 3--vertex-critical graph H6;9 and the 3-c -vertex-critical graph J6
The lower bound on v.G/ in part (ii) is best possible. The following conjecture is found in [4, 9]. Conjecture 5. Suppose G is a 3- -vertex-critical graph. Then (i) If .G/ is even K1;7 -free, then G contains a perfect matching. (ii) If .G/ is odd K1;5 -free 2-connected with ı.G/ 3, then G is factor-critical. Wang and Yu [137] showed that Conjecture 5(ii) is true with two small exceptions. If a 3- -vertex critical graph is also claw-free, more can be said. The following theorem due independently to Favaron et al. [52] and to Liu and Yu [99] is useful here. Theorem 76 ([52,99]). If G is a .k C 1/-connected claw-free graph of order n and if n k is even, then G is k-factor-critical. The next theorem follows immediately by Theorems 62 and 76. Theorem 77 ([7]). Let G be a connected claw-free 3- -vertex-critical graph. Then (i) If G has odd order, then G is factor-critical. (ii) If G has even order, then G is bicritical. (iii) If G has odd order and ı.G/ 5, then G is 3-factor-critical. We now turn our attention to 3-c -vertex-critical graphs. We saw above that 3-c vertex-critical graphs need not contain a perfect (or near-perfect) matching. Sufficient conditions for 3-c -vertex-critical graphs to contain a perfect (or near-perfect)
98
N. Ananchuen et al.
matching are given in the following theorem. This theorem can be considered as another variation of Theorem 74. Theorem 78 ([13]). Suppose G is a K1;7 -free 3-c -vertex-critical graph. Then (i) If .G/ is even, then G contains a perfect matching. (ii) If .G/ is odd, then G contains a near-perfect matching. For k-factor-critical results, we have: Theorem 79 ([13]). Suppose G is a 3-c -vertex-critical graph of even order. If G is either (i) K1;4 -free, or (ii) K1;5 -free and 5-connected, then G is bicritical. Theorem 80 ([13]). Suppose G is a 3-c -vertex-critical graph of odd order. Then (i) If G contains a vertex cutset S with jS j D 3, then G is factor-critical. (ii) If G is K1;6 -free, then G is factor-critical. (iii) If G is K1;3 -free and ı.G/ 4, then G is 3-factor-critical. In closing, we would like to remind the reader that if the connectivity of a graph is at least 2, then G is 3-c -vertex-critical if and only if G is 3-t -vertex-critical. Hence, the results dealing with 3-c -vertex-critical graphs presented in this section may be interpreted as results pertaining to 3-t -vertex-critical graphs as well.
4.6 Summary and Conclusions So what are the possible future directions in the study of domination? Domination and its many variations form a vast subject. Already two entire books have been written on the subject [71,72]. And since their publication in 1998, nearly 1000 new research papers on domination have appeared in scientific journals worldwide! It is therefore beyond the scope of this chapter to speculate individually on the future of all these variants. Certainly, with much of the world preoccupied with security issues these days, domination in all its forms will attract ever more attention. It seems clear that on the applied side, researchers will continue to classify domination problems confined to special classes of graphs as to whether they are polynomially solvable or NP-complete. In Chap. 8 of [72], chapter author Kratsch provides a nice table of algorithmic complexity results for five of the more widely studied variants of domination as applied to 15 different special classes of graphs. His table will no doubt continue to be enlarged. On the theoretical side, many unsolved problems will no doubt continue to occupy the efforts of researchers. In closing, we mention just two of our favorites. The first is the study of well-dominated graphs; i.e., those graphs in which every minimal dominating set is minimum. Graphs in this class have a trivially polynomial procedure to determine their domination number, namely the greedy algorithm. Clearly, one can decide in polynomial time if a graph is not well-dominated; just exhibit
4
Domination in Graphs
99
two minimal dominating sets of differing cardinalities. Hence the well-dominated problem is in the class co-NP. But can a well-dominated graph be so certified in polynomial time? That is, is the well-dominated problem in NP? This is unknown. Finally, in line with our emphasis on criticality issues in this chapter, we mention the following problem. Is there a polynomial algorithm to decide if a graph is edgecritical or vertex-critical with respect to domination (connected domination, total domination, etc.)? Although most domination problems for general graphs have been shown to be NP-complete, that does not automatically make the answer to this question “no.” As far as we know, it has not been proven that to recognize a domination critical graph one must know its domination number.
References 1. Ananchuen N (2007) On domination critical graphs with cutvertices having connected domination number 3. Int Math Forum 2:3041–3052 2. Ananchuen N, Plummer MD (2003) Some results related to the toughness of 3-domination critical graphs. Discrete Math 272:5–15 3. Ananchuen N, Plummer MD (2004) Matching properties in domination critical graphs. Discrete Math 277:1–13 4. Ananchuen N, Plummer MD (2005) Matching in 3-vertex-critical graphs: the even case. Networks 45:210–213 5. Ananchuen N, Plummer MD (2006) Erratum to: Matching properties in domination critical graphs. Discrete Math 306:291–291 6. Ananchuen N, Plummer MD (2006) Erratum to: Some results related to the toughness of 3-domination critical graphs. Discrete Math 306:292 7. Ananchuen N, Plummer MD (2006) On the connectivity and matchings in 3-vertex-critical claw-free graphs. Utilitas Math 69:85–96 8. Ananchuen N, Plummer MD (2006) Some results related to the toughness of 3-domination critical graphs II. Utilitas Math 70:11–32 9. Ananchuen N, Plummer MD (2007) Matchings in 3-vertex-critical graphs: the odd case. Discrete Math 307:1651–1658 10. Ananchuen N, Plummer MD (2007) 3-Factor-criticality in domination critical graphs. Discrete Math 307:3006–3015 11. Ananchuen N, Ananchuen W, Plummer MD (2008a) Matching properties in connected domination critical graphs. Discrete Math 308:1260–1267 12. Ananchuen W, Ananchuen N, Plummer MD (2008b) Vertex criticality for connected domination. Utilitas Math (to appear) 13. Ananchuen W, Ananchuen N, Plummer MD (2008c) Connected domination: vertex criticality and matchings, (submitted) (to appear) 14. Ao S (1994) Independent domination critical graphs. M.Sc. thesis, Department of Mathematics and Statistics, University of Victoria 15. Archdeacon D et al. (2004) Some remarks on domination. J Graph Theory 46:207–210 16. Baogen X, Cockayne EJ, Haynes TW, Hedetniemi ST, Shangchao Z (2000) Extremal graphs for inequalities involving domination parameters. Discrete Math 216:1–10 17. Berge C (1973) Graphs and hypergraphs. North-Holland, Amsterdam 18. Blitch PM (1983) Domination in graphs. Ph.D. thesis, Department of Mathematics and Statistics, University of South Carolina 19. Bo C, Liu B (1996) Some inequalities about connected domination number. Discrete Math 159:241–245
100
N. Ananchuen et al.
20. Bollob´as B, Cockayne EJ (1979) Graph theoretic parameters concerning domination, independence and irredundance. J Graph Theory 3:241–250 21. Bondy JA, Chv´atal V (1976) A method in graph theory. Discrete Math 15:111–135 22. Bondy JA, Murty USR (1976) Graph theory with applications. Macmillan, London 23. Brigham RC, Carrington JR, Vitray RP (2000) Connected graphs with maximum total domination number. J Combin Math Combin Comput 34:81–96 24. Brigham RC, Chinn PZ, Dutton RD (1984) A study of vertex domination critical graphs. Tech. Report M-2, Department of Mathematics, University of Central Florida 25. Brigham RC, Chinn PZ, Dutton RD (1988) Vertex domination-critical graphs. Networks 18:173–179 26. Brigham RC, Haynes TW, Henning MA, Rall DF (2005) Bicritical domination. Discrete Math 305:18–32 27. Burton T, Sumner DP (2006) Domination dot-critical graphs. Discrete Math 306:11–18 28. Burton T, Sumner DP (2007) -Excellent, critically dominated, end-dominated, and dotcritical trees are equivalent. Discrete Math 307:683–693 29. Caro Y, Roditty Y (1985) On the vertex-independence number and star decomposition of graphs. Ars Combinatoria 20:167–180 30. Caro Y, Roditty Y (1990) A note on the k-domination number of a graph. Int J Math Sci 13:205–206 31. Chang GJ (1998) Algorithmic aspects of domination in graphs. In: Du D-Z, Pardalos PM (eds) Handbook of combinatorial optimization, vol 3. Kluwer, Boston, pp 339–405 32. Chen Y, Edwin Cheng TC, Ng CT (2008) Hamilton-connectivity of 3-domination critical graphs with ˛ D ı C 1 5. Discrete Math 308:1296–1307 33. Chen XG, Sun L, Ma D-X (2004) Connected domination critical graphs. Appl Math Lett 17:503–507 34. Chen Y, Tian F (2003) A new proof of Wojcicka’s conjecture. Discrete Appl Math 127: 545–554 35. Chen Y, Tian F, Wei B (2002) Codiameters of 3-connected 3-domination critical graphs. J Graph Theory 39:76–85 36. Chen Y, Tian F, Wei B (2002) The 3-domination-critical graphs with toughness one. Utilitas Math 61:239–253 37. Chen Y, Tian F, Wei B (2003) Hamilton-connectivity of 3-domination-critical graphs with ˛ ı. Discrete Math 271:1–12 38. Chen Y, Tian F, Zhang Y (2002) Hamilton-connectivity of 3-domination critical graphs with ˛ D ı C 2. Eur J Combinator 23:777–784 39. Chengye Z, Yuansheng Y, Linlin S (2008) Domination dot-critical graphs with no critical vertices. Discrete Math 308:3241–3248 40. Clark WE, Shekhtman B, Suen S (1998) Upper bounds for the domination number of a graph. Congr Numer 132:99–123 41. Clark WE, Suen S (2000) An inequality related to Vizing’s conjecture. Electron J Combinator 7(4):3 42. Cockayne EJ (1978) Domination of undirected graphs – a survey. In: Alavi, Y., Lick, D.R. (eds) Theory and applications of graphs in America’s bicentennial year. Springer, Berlin, pp 141–147 43. Cockayne EJ, Dawes RM, Hedetniemi ST (1980) Total domination in graphs. Networks 10:211–219 44. Cockayne EJ, Hedetniemi ST (1977) Towards a theory of domination in graphs. Networks 7:247–261 45. Colbourn CJ, Stewart LK (1990) Permutation graphs: connected domination and Steiner trees. Discrete Math 86:179–189 46. Cropper M, Greenwell D, Hilton AJW, Kostochka AV (2005) The domination number of cubic Hamiltonian graphs. AKCE Int J Graph Combinator 2:137–144 47. DeLaVi˜na E, Liu Q, Pepper R, Waller B, West DB (2007) Some conjectures of Graffiti.pc on total domination. Congr Numer 185:81–95
4
Domination in Graphs
101
48. Dorfling M, Goddard W, Henning MA (2006) Domination in planar graphs with small diameter II. Ars Combinatoria 78:237–255 49. Duchet P, Meyniel H (1982) On Hadwiger’s number and the stability number. In: Bollob´as B (ed) Graph theory. Annals of Discrete Mathematics, vol 13. North-Holland, Amsterdam, pp 71–74 50. Duckworth W, Mans B (2002) On the connected domination number of random regular graphs. In: Ibarra OH, Zhang L (eds) Computing and combinatorics. Lecture notes in computer science, vol 2387. Springer, Berlin, pp 210–219 51. Edwin Cheng TC, Chen Y, Ng CT (2009) Codiameters of 3-domination critical graphs with toughness more than one. Discrete Math 309:1067–1078 52. Favaron O, Flandrin E, Ryj´ac˘ ek Z (1997) Factor-criticality and matching extension in DCTgraphs. Discuss Math Graph Theory 17:271–278 53. Favaron O, Henning MA (2004) Paired-domination in claw-free cubic graphs. Graph Combinator 20:447–456 54. Favaron O, Henning MA (2008) Total domination in claw-free graphs with minimum degree 2. Discrete Math 308:3213–3219 55. Favaron O, Henning MA (2008) Bounds on total domination in claw-free cubic graphs. Discrete Math 308:3491–3507 56. Favaron O, Kratsch D (1991) Ratios of domination parameters. In: Kulli VR (ed) Advances in graph theory. Vishwa, Gulbarga, pp 173–182 57. Favaron O, Sumner DP, Wojcicka E (1994) The diameter of domination k-critical graphs. J Graph Theory 18:723–734 58. Favaron O, Tian F, Zhang L (1997) Independence and hamiltonicity in 3-domination-critical graphs. J Graph Theory 25:173–184 59. Flandrin E, Tian F, Wei B, Zhang L (1999) Some properties of 3-domination-critical graphs. Discrete Math 205:65–76 60. Frendrup A, Henning MA, Randerath B, Vestergaard PD (2009) An upper bound on the domination number of a graph with minimum degree 2. Discrete Math 309:639–646 61. Fujita S, Kameda T, Yamashita M (1995) A resource assignment problem on graphs. In: Staples J, Eades P, Katoh N, Moffat A (eds) Algorithms and computation. Lecture notes in computer science, vol 1004. Springer, London, pp 418–427 62. Fujita S, Kameda T, Yamashita M (2000) A study on r-configurations-a resource arrangement problem. SIAM J Discrete Math 13:227–254 63. Fulman J (1994) Domination in vertex and edge critical graphs. Manuscript, Department of Mathematics, Harvard University 64. Fulman J, Hanson D, MacGillivray G (1995) Vertex domination-critical graphs. Networks 25:41–43 65. Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NPcompleteness. W.H. Freeman, San Francisco, CA 66. Goddard W, Haynes TW, Henning MA, van der Merwe LC (2004) The diameter of total domination vertex critical graphs. Discrete Math 286:255–261 67. Goddard W, Henning MA (2002) Domination in planar graphs with small diameter. J Graph Theory 40:1–25 68. Hanson D (1993) Hamilton closures in domination critical graphs. J Combin Math Combin Comput 13:121–128 69. Hanson D, Wang P (2003) A note on extremal total domination edge critical graphs. Utilitas Math 63:89–96 70. Harant J, Rautenbach D (2009) Domination in bipartite graphs. Discrete Math 309:113–122 71. Haynes TW, Hedetniemi ST, Slater PJ (1998) Fundamentals of domination in graphs. Marcel Dekker, New York 72. Haynes TW, Hedetniemi ST, Slater PJ (eds) (1998) Domination in graphs – advanced topics. Marcel Dekker, New York 73. Haynes TW, Henning MA (1998) Domination critical graphs with respect to relative complements. Australas J Combinator 18:115–126
102
N. Ananchuen et al.
74. Haynes TW, Henning MA (2009) Upper bounds on the total domination number. Ars Combinatoria 91:243–256 75. Haynes TW, Phillips JB, Slater PJ (1999) Realizability of .j; t /-critical graphs for sets of values. Congr Numer 137:65–75 76. Hedetniemi ST, Laskar R (1984) Connected domination in graphs. In: Bollob´as B (ed) Graph theory and combinatorics. Academic, London, pp 209–217 77. Hedetniemi ST, Laskar RC (1990) Bibliography on domination in graphs and some basic definitions of domination parameters. Discrete Math 86:257–277 78. Hellwig A, Volkmann L (2006) Some upper bounds for the domination number. J Combin Math Combin Comput 57:187–209 79. Henning MA (1999) A characterisation of graphs with minimum degree 2 and domination number exceeding a third their size. J Combin Math Combin Comput 31:45–64 80. Henning MA (2000) Graphs with large total domination number. J Graph Theory 35:21–45 81. Henning MA (2005) A linear Vizing-like relation relating the size and total domination number of a graph. J Graph Theory 49:285–290 82. Henning MA (2009) A survey of selected recent results on total domination in graphs. Discrete Math 309:32–63 83. Henning MA, Kang L, Shan E, Yeo A (2008) On matching and total domination in graphs. Discrete Math 308:2313–2318 84. Henning MA, Oellermann OR, Swart HC (2003) Distance domination critical graphs. J Combin Math Combin Comput 44:33–45 85. Henning MA, Yeo A (2006) Total domination and matching numbers in claw-free graphs. Electron J Combinator 13, # R 59, 28 86. Henning MA, Yeo A (2008) Total domination in graphs with given girth. Graph Combinator 24:333–348 87. Henning MA, Yeo A (2007) A new upper bound on the total domination number of a graph. Electron J Combinator 14, # R 65, 10 88. Ho PT (2008) A note on the total domination number. Utilitas Math 77:97–100 89. Jinquan D (1995) Some results on 3-domination critical graphs. Acta Sci Nat Univ NeiMonggol 26:39–42 90. Kawarabayashi K, Plummer MD, Saito A (2006) Domination in a graph with a 2-factor. J Graph Theory 52:1–6 91. Kleitman DJ, West DB (1991) Spanning trees with many leaves. SIAM J Discrete Math 4: 99–106 92. Kostochka AV, Stodolsky BY (2005) On domination in connected cubic graphs. Discrete Math 304:45–50 93. Kostochka AV, Stodolsky BY (2009) An upper bound on the domination number of n-vertex connected cubic graphs. Discrete Math 309:1142–1162 94. Lam PCB, Wei B (2007) On the total domination number of graphs. Utilitas Math 72:223–240 95. Las Vergnas M (1975) A note on matchings in graphs, Colloque sur la Th´eorie des Graphes ´ (Paris, 1974) Cahiers Centre Etudes Rech O´per 17:257–260 96. Laskar R, Walikar HB (1981) On domination related concepts in graph theory. In: Rao SB (ed) Combinatorics and graph theory. Lecture notes in mathematics, vol 885. Springer, Berlin, pp 308–320 97. Liu CL (1968) Introduction to combinatorial mathematics. McGraw-Hill, New York 98. Liu H, Sun L (2004) On domination number of 4-regular graphs. Czechoslovak Math J 54:889–898 99. Liu G, Yu Q (1998) On n-edge-deletable and n-critical graphs. Bull Inst Combinator Appl 24:65–72 100. Liying K, Erfang S (1995) On connected domination number of a graph. In: Ku T-H (ed) Combinatorics and graph theory’95, vol 1. World Science, River Edge, NJ, pp 199–204 101. Lov´asz L, Plummer MD (1986) Matching theory. Annals of Discrete Mathematics, vol 29. North-Holland, Amsterdam 102. L¨owenstein C, Rautenbach D (2008) Domination in graphs of minimum degree at least two and large girth. Graph Combinator 24:37–46
4
Domination in Graphs
103
103. MacGillivray G, Seyffarth K (1996) Domination numbers of planar graphs. J Graph Theory 22:213–229 104. McCuaig W, Shepherd B (1989) Domination in graphs with minimum degree two. J Graph Theory 13:749–762 105. Mojdeh DA, Rad NJ (2006) On the total domination critical graphs. Electron Notes Discrete Math 24:89–92 106. Mojdeh DA, Rad NJ (2007) On an open problem concerning total domination critical graphs. Expositiones Math 25:175–179 107. Moodley L (2000) Wojcicka’s theorem: complete, consolidated proof. J Combin Math Combin Comput 33:129–179 108. Moscarini M (1993) Doubly chordal graphs, Steiner trees, and connected domination. Networks 23:59–69 109. Mynhardt CM (1998) On two conjectures concerning 3-domination-critical graphs. Congr Numer 135:119–138 110. Newman-Wolfe RE, Dutton RD, Brigham RC (1988) Connecting sets in graphs – a domination related concept. Congr Numer 67:67–76 111. Ore O (1962) Theory of graphs. Am Math Soc Colloq Publ 38 112. Paris M (1994) Note: the diameter of edge domination critical graphs. Networks 24:261–262 113. Paris M, Sumner DP, Wojcicka E (1999) Edge-domination-critical graphs with cut-vertices. Congr Numer 141:111–117 114. Payan C, Xuong NH (1982) Domination-balanced graphs. J Graph Theory 6:23–32 115. Phillips JB, Haynes TW (2000) A generalization of domination critical graphs. Utilitas Math 58:129–144 116. Rautenbach D (2008) A note on domination, girth and minimum degree. Discrete Math 308:2325–2329 117. Reed B (1996) Paths, stars and the number three. Comb Probab Comput 5:277–295 118. Sampathkumar E, Walikar HB (1979) The connected domination number of a graph. J Math Phys Sci 13:607–613 119. Sanchis LA (1997) Bounds related to domination in graphs with minimum degree two. J Graph Theory 25:139–152 120. Sanchis LA (2000) On the number of edges in graphs with a given connected domination number. Discrete Math 214:193–210 121. Shan E, Kang L, Henning MA (2007) Erratum to: A linear Vizing-like relation relating the size and total domination number of a graph. J Graph Theory 54:350–353 122. Shiu WC, Zhang L-Z (2008) Pancyclism of 3-domination-critical graphs with small minimum degree. Utilitas Math 75:175–192 123. Simmons J (2005) Closure operations and hamiltonian properties of independent and total domination critical graphs. Ph.D. thesis, Department of Mathematics and Statistics, University of Victoria 124. Sumner DP (1976) 1-Factors and anti-factor sets. J Lond Math Soc 13:351–359 125. Sumner DP (1990) Critical concepts in domination. Discrete Math 86:33–46 126. Sumner DP, Blitch P (1983) Domination critical graphs. J Combin Theory B 34:65–76 127. Thomass´e S, Yeo A (2007) Total domination of graphs and small transverals of hypergraphs. Combinatorica 27:473–487 128. Tian F, Wei B, Zhang L (1999) Hamiltonicity in 3-domination-critical graphs with ˛ D ı C2. Discrete Appl Math 92:57–70 129. Tian F, Xu J-M (2008) Distance domination-critical graphs. Appl Math Lett 21:416–420 130. van der Merwe LC, Mynhardt CM, Haynes TW (1998) Total domination edge critical graphs. Utilitas Math 54:229–240 131. van der Merwe LC, Mynhardt CM, Haynes TW (1998) Criticality index of total domination. Congr Numer 131:67–73 132. van der Merwe LC, Mynhardt CM, Haynes TW (1999) 3-domination critical graphs with arbitrary independent domination numbers. Bull ICA 27:85–88 133. van der Merwe LC, Mynhardt CM, Haynes TW (2001) Total domination edge critical graphs with maximum diameter. Discuss Math Graph Theory 21:187–205
104
N. Ananchuen et al.
134. van der Merwe LC, Mynhardt CM, Haynes TW (2003) Total domination edge critical graphs with minimum diameter. Ars Combinatoria 66:79–96 135. Vizing VG (1968) Some unsolved problems in graph theory. Uspekhi Mat Nauk 23:117–134 136. Wang C, Hu Z, Li X (2009) A constructive characterization of total domination vertex critical graphs. Discrete Math 309:991–996 137. Wang T, Yu Q (2009) Factor-critical property in 3-dominating-critical graphs. Discrete Math 309:1079–1083 138. White K, Farber M, Pulleyblank W (1985) Steiner trees, connected domination and strongly chordal graphs. Networks 15:109–124 139. Wojcicka E (1990) Hamiltonian properties of domination-critical graphs. J Graph Theory 14:205–215 140. Xing H-M, Sun L, Chen X-G (2006) Domination in graphs of minimum degree five. Graph Combinator 22:127–143 141. Xue Y, Chen Z (1991) Hamiltonian cycles in domination-critical graphs. J Nanjing Univ 27:58–62 142. Yuansheng Y, Chengye Z, Xiaohui L, Yongsong J, Xin H (2005) Some 3-connected 4-edgecritical non-Hamiltonian graphs. J Graph Theory 50:316–320 143. Zhang L-Z, Tian F (2002) Independence and connectivity in 3-domination-critical graphs. Discrete Math 259:227–236 144. Zwierzchowski M (2007) Total domination number of the conjunction of graphs. Discrete Math 307:1016–1020
Chapter 5
Spectrum and Entropy for Infinite Directed Graphs Jun Ichi Fujii
Abstract From the viewpoint of operator theory, we discuss spectral properties for infinite directed graphs that have bounded valences. Graphs may have selfloops, but they are assumed not to have multiedges. Note that we use the transpose adjacency operator throughout this chapter by reason of this viewpoint. As a subsidiary effect, one may read this as a visual introduction to operator theory. Keywords Infinite directed graph Spectrum Entropy Numerical range Fractal Coding theory MSC2000: Primary 05C50; Secondary 94A17, 94A24, 05C20, 05C38, 05C90, 47A10, 47A12 In this chapter, we observe spectral properties for infinite directed graphs and discuss entropies for them from the viewpoint of operator theory. First we give an exact definition of the adjacency operator for an infinite directed graph and then its representation by the Shatten operator also called dyad. In Sect. 5.2, we give invariants for graphs related to their spectra, e.g., the spectral radii, numerical ones, and norms. These are monotone increasing quantities as graphs are growing. Also, coloring problems for directed graphs are closely related to locations for spectra in the complex plane. In Sect. 5.3, we introduce various products for two graphs and discuss these spectral invariants. In Sect. 5.4, we consider (infinite) directed trees, which are often generated by (finite) graphs. Infinite (generating) directed trees are interesting objects related to other mathematical ones, e.g., Fibonacci sequences, self-similar fractals or entropies. Based on this consideration, we introduce two types of entropies for graphs. In infinite graphs, the topological entropy differs from the spectral entropy although these coincide for finite graphs. In an extreme
J.I. Fujii () Department of Arts and Sciences (Information Science), Osaka Kyoiku University, Asahigaoka, Kashiwara, Osaka 582-8582, Japan e-mail:
[email protected]
M. Dehmer (ed.), Structural Analysis of Complex Networks, c Springer Science+Business Media, LLC 2011 DOI 10.1007/978-0-8176-4789-6 5,
105
106
J.I. Fujii
case, the former is twice as large as the latter. As an application for graphs in the last section, we use Ziv’s entropy and show a source coding theorem which is a generalization of Ziv’s one.
5.1 Adjacency Operator and Dyadic Representation For a directed graph G with the vertices V .G/ of G, an arrow (or arc) from u to v is denoted by .u; v/ or u ! v and the set of all arrows by E D E.G/. We exclude multigraphs here and V .G/ is countable. The set of vertices V D V .G/ corresponds to an orthonormal basis fev g of a (complex) Hilbert space ( H D `2 .V .G// D `2 .G/ D x D
X v2V
P
with the inner product hx; yi D
v2V
ˇ ) ˇ X ˇ xv ev ˇ jxv j2 < 1 ˇ v2V
xv yv and the norm kxk D
sX
jxv j2 .
v2V
Following Mohar’s adjacency operator for undirected graphs in [20], Fujii et al. [12] defined the adjacency operator A D A.G/ for a directed graph G as the closed operator with the domain Dom A D
8 < :
xD
X v2V
9 ˇ ˇ ˇ ˇ X ˇ X ˇ2 = ˇ ˇ ˇ xv ev 2 H ˇ xv ˇ < 1 ˇ ˇ ˇ v!u ˇ ; u2V
and the value for the above x Ax D
X X u2V
! xv eu :
(5.1)
v!u
Here we remark that this definition is not a usual adjacency operator but its transpose. If A.G/ is selfadjoint (or transpose invariant), then G is considered as an undirected graph. Define the outdegree d C .v/ (resp. indegree d .v/) for a vertex v as the cardinal number of the arrows from (resp. to) v. It is easy to see that d C .v/ D kAev k D
X u
For example,
1 and d .v/ D kA ev k D
v
X
1:
u!v
2 1 1 1 is the adjacency operator for the graph ı ı and 0 0 d C .1/ D d C .2/ D 1; d .1/ D 2
and d .2/ D 0:
5
Spectrum and Entropy for Infinite Directed Graphs
107
A graph G is said to have a bounded valency k if d ˙ .v/ 5 k for all v 2 V .G/ (One might think A.G/ is an infinite matrix with each row-sum and each columnsum are not greater than k). Then we have (see [12, Theorem 2]): Proposition 1. An infinite directed graph G has a bounded valency if and only if A.G/ is a bounded operator on H. In this case, the valency k implies ˇ n o ˇ kA.G/k inf t = 0 ˇ kA.G/xk 5 tkxk .8x 2 H/ 5 k: Proof. Suppose G has the valency k. Then the property X
n.ja1 j2 C C jan j2 / ja1 C C an j2 D
jai aj j2 = 0
15i <j 5n
shows kA.G/xk2 D
X X X X j xv j2 5 d .u/ jxv j2 u2V
5k
v!u
XX
u2V 2
jxv j D k
u2V v!u
5k
2
X
X
v!u C
d .v/jxv j2
v2V
jxv j2 D k 2 kxk2 ;
v2V
so that kA.G/k 5 k. Conversely suppose G does not have any finite valency. We may assume that for any N there exists evN with d C .evN / > N . Then kA.G/evN k D d C .evN / > N D N kevN k t u
implies that A.G/ cannot be bounded.
Throughout this chapter, we assume G has a bounded valency; that is, A.G/ is a bounded operator. So we define the norm of the graph G by kGk D kA.G/k. Since A.G/ D tA.G/ is the adjacency operator for the converse directed graph for G, the graph G denotes it. Finally in this section, we give a representation of A.G/. Each arrow .u; v/ is expressed as a dyad ev ˝ eu for u; v 2 V .G/, where .ev ˝ eu /x D hx; eu iev for x 2 H. Then the adjacency operator A.G/ of G has a dyadic representation A.G/
XX u2V v!u
eu ˝ ev
D
X
! eu ˝ ev
in short ;
v!u
where the sum is in the strong operator topology; that is, An ! A ” k.An A/xk ! 0 for all vectors x 2 H:
108
J.I. Fujii
Then we obtain (5.1) again: For x D A.G/x D
X X
P w2V
hew ; ev ixw eu D
u;w2V v!u
xw ev ,
X X
xw eu D
u;w2V w!u
X X u2V
! xw eu :
w!u
5.2 Spectral Invariants Since A.G/ represents G itself, we adopt definitions for notions of G by those of A.G/ in the operator theory (as a beginner’s book, see [17]): ˚ ˇ .G/ D .A.G// D ˇ A I is not invertible ; ˇ ˚ numerical range W .G/ D W .A.G// D hA.G/x; xi ˇ kxk D 1 ; ˚ ˇ spectral radius r.G/ D r.A.G// D sup ˇ 2 .G/ ; ˚ ˇ numerical radius w.G/ D w.A.G// D sup ˇ 2 W .G/ : spectrum
The spectrum is a nonempty closed set and included by W .G/, the closure of W .G/, which is convex (the Toeplitz–Hausdorff theorem). If the closed convex hull of .A/ coincides with W .A/, then A is called convexoid. Recall G is normally symmetric if G satisfies ˇ ˇ ˚ ˚ u 2 V .G/ ˇ v ! u; w ! u 2 E.G/ D u 2 V .G/ ˇ v
u; w
u 2 E.G/ :
Then we can show as in [12] that G is normally symmetric if and only if A.G/ is normal; i.e., A.G/ A.G/ D A.G/A.G/ . Thus normally symmetric (and hence undirected) graphs are convexoid. An example for convexoid graphs which is not normally symmetric is the backward shift U , which is discussed in the preceding paragraph of Theorem 3. Moreover, the following relations are well known in operator theory: r.G/ D lim kA.G/n k1=n 5 w.G/ 5 kGk 5 2w.G/; n!1
(5.2)
where r.G/ D w.G/ D kGk holds if G is normally symmetric. In operator theory, each equality in the inequalities (5.2) determines a class of operators, respectively (cf. [17]). If G is purely directed, i.e., A.G/ C A.G/ defines the undirected graph G which is called the symmetric cover of G, then w.G/ D 2w.G/; see [24]. Since the triangle inequality w.A C B/ 5 w.A/ C w.B/ holds for all operators, the numerical radius determines an equivalent norm to the usual one.
5
Spectrum and Entropy for Infinite Directed Graphs v
109 w
Example 1. Take a nilpotent graph N2 W ı ! ı with the adjacency matrix A.N2 / D ew ˝ ev . The term “nilpotent” is derived from the property A.N /2 D O (We discuss a general case later around Theorem 9). Then r.N2 / D 0;
w.N2 / D
1 2
and kN2 k D kev kkew k D 1:
Another typical example that shows the difference between finite and infinite graphs is given by Mohar and Woess [21]: A graph G is called k-regular if d ˙ .v/ D k for all v 2 V .G/. If G is finite, then r.G/ D k [3]. But it does not hold for the following tree, which motivated us to study entropies for graphs. Example 2. p Let T be the 3-regular homogeneous undirected tree (Fig. 5.1); then r.T / D 2 2 is shown in [21, (7.6)] in spite of k D 3. First we observe properties for the spectrum and the numerical range in the complex plane [13, 14]. Theorem 1. The spectrum .G/ and the numerical range W .G/ of a graph G are symmetric with respect to the real axis. P Proof. For a unit vector x, we put its conjugate x D v xv ev . Then, for D hA.G/x; xi 2 W .G/, via dyadic representation, we have X X
D
v;w2V v!u
and hence D
XX v2V u
Fig. 5.1 Regular homogeneous undirected tree
v
xv xw heu ; ew i D
XX
xv xu ;
v2V v!u
xv xu D hA.G/x; xi 2 W .G/:
110
J.I. Fujii
Consider the approximate point spectrum .G/; ˇ ˚ .G/ .A.G// D 2 Cˇ9kxn k D 1I k.A.G/ /xn k ! 0 : Similarly we can show .G/ is symmetric. Since .G/ D .G/ [ .G /, we have .G/ is also symmetric. t u Recall that G is called a bipartite graph if V .G/ can be divided into two disjoint sets V0 and V1 such that there is no arrow between two vertices in the same set. More generally, if V .G/ can be divided into m disjoint sets Vk .k D 0; : : : ; m 1/ such that all the arrows from Vk strike in V.kC1/ mod m , then G is called cyclically m-partite. Example 3. The following graph is cyclically 3-partite: 8 ˆ ˆ ~ }!~ } ! ~ <} 2 V0 # % # - # % # - # ~ 2 V1 ˆ ˆ : 2 V ~! ~ ! 2
Theorem 2. The spectrum .G/ and the numerical range W .G/ of a cyclically m-partite graph G are invariant under the 2 -rotation in the complex plane. m Proof. Rearranging the vertices according to the direct sum decomposition H `2 .V / D `2 .V0 / ˚ ˚ `2 .Vm1 /; we may assume that the adjacency operator is of the form for adjacency suboperators Aj on `2 .Vj /: 0 1 O Am1 BA0 O O C B C A.G/ D B :: C : : : :: :: @ : A O Am2 O Then, for a unit vector x D .xk / 2 `2 .V0 / ˚ ˚ `2 .Vm1 /, we have hA.G/x; xi D hAm1 xm1 ; x0 i C hA0 x0 ; x1 i C C hAm2 xm2 ; xm1 i: For D exp.2 i=m/, take y D t.x0 ; m1 x1 ; m2 x2 ; : : : ; xm1 /: Note that mCk D k and y D t.x0 ; x1 ; 2 x2 ; : : : ; m1 xm1 /: Thereby, kyk D 1 and hA.G/y; yi D hA.G/x; xi D . Thus 2 W .G/, that is, W .G/ is invariant for the rotation. Similarly we have .G/ is invariant. t u
5
Spectrum and Entropy for Infinite Directed Graphs
111
Corollary 1. The spectrum and the numerical range of a bipartite graph are symmetric at the origin. Next we see the radii of graphs. It is known that the spectrum is closed but the numerical range is not: For example, let U be the backward shift graph ı
ı
ı
ı
:
Then W .U / is open unit disc [18, Sol. 168(2)] and .U / is the closed one [18, Sol. 67], and therefore w.U / D 1 … W .U /. In this case, r.U / D 1 2 .U /, which implies .U / 6 W .U / and .A/ W .A/ holds for all operators A. In general, the statements r.A/ 2 .A/ and w.A/ 2 W .A/ are false. But r.G/ 2 .G/ and w.G/ 2 W .G/ hold for any graphs G as we later. We show in [14] the former, which is a natural infinite theorem. To see the latter, P version of the Perron–Frobenius P for a unit vector x D v xv ev , define jxj D v jxv jev . Then jhA.G/x; xij 5 hA.G/jxj; jxji and jxj D 1: Thus w.G/ 2 W .G/ holds [9]. Theorem 3. For any graph G, the relations r.G/ 2 .G/ and w.G/ 2 W .G/ hold. Moreover, there exist positive unit vectors xn 2 `2 .G/ with k.r.G/ A.G//xn k ! 0 and consequently r.G/ 2 .G/. To show the above results on the spectral radius, we need a notation and a lemma as in Bonsall’s method in [23]. For H D `2 .G/, define an equivalence relation on the direct sum H ˚ H by i.x; y/ .y; x/ and the equivalence class of .x; y/ is denoted by Œx; y as we identify C with IR ˚ IR. Then the quotient space B D H ˚ H= is a Banach space with a norm kŒx; yk D sup k.cos t/x C .sin t/yk; t
where kxk C kyk = kŒx; yk = maxfkxk; kykg hold. For A 2 B.H/, define AQ on Q y D ŒAx; Ay. Then the map A 7! AQ is an isometrical isomorphism and B by AŒx; Q Then we have hence r.A/ D r.A/. Lemma 1. For a complex number with jj > r.G/ for some graph G, Q 1 Œx; yk 5 k.jj A.G//1 .x C y/k k. A.G// for all nonnegative vectors x .i.e., xv = 0 for all v 2 V / and y in H. Q and Proof. Put A D A.G/. For D re i t , we have r D jj > r.A/ D r.A/ Q 1 Œx; y D . A/
1 X nD1
D
1 X nD1
n AQn1 Œx; y D
1 X
r n e i nt AQn1 Œx; y
nD1
r n AQn1 Œ.cos nt/x C .sin nt/y; .cos nt/y .sin nt/x:
112
J.I. Fujii
For a vector function P .s/ D
X
r n An1 .cos.nt C s//x C .sin.nt C s//y ;
n
the nonnegativity for r n An1 , x, and y shows Q 1 Œx; yk D sup kP .s/k 5 k.r A/1 .x C y/k: k. A/ s
t u
Proof of Theorem 3. We have only to show the results on the spectral radius. SupQ take positive pose r D r.G/ … .G/. Put A D A.G/. For re i t 2 .A/ D .A/, numbers frn g # r and a vector z 2 B with Q 1 zk D 1 lim k.rn e i t A/
n!1
via the uniform boundedness theorem. Here we can take positive vectors v; w; x; y with z D Œv w; x y. In fact, take positive vectors xk and yk with x D x1 x2 C i.x3 x4 /
and y D y1 y2 C i.y3 y4 /:
Then we can rearrange z D Œx; y D Œx1 x2 ; y1 y2 C Œi.x3 x4 /; i.y3 y4 / D Œx1 x2 ; y1 y2 C Œ.y3 y4 /; x3 x4 D Œ.x1 C y4 / .x2 C y3 /; .y1 C x3 / .y2 C x4 /: It follows from Lemma 1 that Q 1 zk 5 k.rn e i t A/ Q 1 Œv; xk C k.rn e i t A/ Q 1 Œw; yk k.rn e i t A/ 5 k.rn A/1 .v C x/k C k.rn A/1 .w C y/k 5 k.rn A/1 k.k.v C x/k C k.w C y/k/; which contradicts the choice of z. Thus r.G/ 2 .G/. Next we see r.G/ 2 .G/. Then we can take positive numbers tn # r.G/ and a positive vector z 2 H with lim k.tn A/1 zk D 1:
n!1
Moreover, putting a strictly positive unit vector y by yD we also have
zCw kz C wk
where w D
X k
lim k.tn A/1 yk D 1:
n!1
2k ev.k/ ;
5
Spectrum and Entropy for Infinite Directed Graphs
113
Take unit vectors xn D .tn A/1 y=k.tn A/1 yk. It follows that k.r.G/ A/xn k 5 k.r.G/ tn /xn k C k.tn A/xn k kyk D jr.G/ tn j kxn k C k.tn A/1 yk 1 D tn r.G/ C ! 0; k.tn A/1 yk which shows r.G/ 2 .G/ and gives the required vectors xn .
t u
Recall the spanning subgraph G 0 of G is a graph such that V .G/ D V .G 0 / and E.G/ E.G 0 /. Then kGk, r.G/ and w.G/ are monotone increasing: Theorem 4. If G 0 is a spanning subgraph of G, then kG 0 k 5 kGk;
r.G 0 / 5 r.G/ and w.G 0 / 5 w.G/:
Proof. For nonnegative unit vector x, we have 0 5 hA.G 0 /x; xi 5 hA.G/x; xi and kA.G 0 /xk2 D hA.G 0 / A.G 0 /x; xi 5 hA.G/ A.G/x; xi D kA.G/xk2 : Thus the numerical radius and the norm are monotone increasing. So is the spectral radius by r.G 0 / D lim kA.G 0 /n k1=n 5 lim kA.G/n k1=n D r.G/: n!1
n!1
t u
Although one might conjecture that r.G/ (or else) is approximated by finite spanning subgraphs Gn , it is false: Consider the unilateral shift graph: U W ı ! ı ! ı ! : Then all the finite subgraphs of U are nilpotent, and r.U / D 1. But Y. Seo gave the following interesting example in [15] which has the approximating finite subgraphs slightly related to Chebyshev polynomials Tn with Tn .cos x/ D cos nx. (We give another proof here based on Seo’s idea.) Example 4. Let an infinite graph G be 1 3 ı ı l GW l ı!ı! 2 4
5 2n 1 ı ı l l ı ! ı ! 6 2n :
114
J.I. Fujii
Then we have 0
01 B1 0 B B0 0 B B A.G/ D B0 1 B B0 0 B @0 0 :: :: : :
10 000 011 100 000 011 :: : 00
1 C C C C C C C C :: C :A :: :
0
1 B0 B B0 B B and A.G/ A.G/ D B0 B B0 B @0 :: :
000 220 220 002 002 000 :: :: : : 0
0 2 2 0 0
1
C C C C 0C C; C 0C :: C :A :: :
p which shows r.G/ 5 kGk D kA.G/ A.G/k D 2. Take corresponding finite graphs for each natural numbers n: 1 ı Gn W l ı! 2
3 5 ı ı l l ı!ı! 4 6
2n 1 ı l ı 2n :
Considering the characteristic polynomial (of order 2n) Sn .x/ for Gn , 0 x B 1 B B 0 B B B 0 B Sn .x/ det.A.Gn / xI / D det B B B B B B B @
1 x 0 1
1 0 x 1
1
0 0 1 x ::
: x 1 0 0
1 x 0 1
C C C C C C C C: C C 1 0 C C 0 0 C C x 1 A 1 x
Putting the determinant (polynomial of order 2n 1) for the following .2n 1/ .2n 1/ matrix (and expanding it at the 1st row to get Sn1 ): 0
1 1 0 B0 x 1 B B1 1 x B B :: B : Rn .x/ D det B B B x 1 1 B B 1 x 0 B @ 0 0 x 0 1 1
1 C C C C C C C D Sn1 .x/ C .1/2 Rn1 .x/; C 0 C C 0 C C 1 A x
5
Spectrum and Entropy for Infinite Directed Graphs
we can expand Sn :
115
Sn .x/ D x 2 Sn1 .x/ Rn .x/:
It follows that Sn .x/ Sn1 .x/ D x 2 .Sn1 Sn2 / .Rn .x/ Rn1 .x// D x 2 .Sn1 Sn2 / Sn1 .x/; and consequently Sn .x/ x 2 Sn1 .x/ C x 2 Sn2 D 0: Putting
p x 2 C i 4x 2 x 4 ; D 2
which is a solution of t 2 x 2 t C x 2 D 0, we have Sn .x/ D
n n
S1 .x/ D
.n n /.x 2 1/ : p i 4x 2 x 4
Let x D 2 cos y. Then Sn .2 cos y/ D
4 cos2 yC4i sin y cos y 2
n
4 cos2 y4i sin y cos y 2
4i sin y cos y
n .4 cos2 y 1/
D 2n cosn y ..cos y C i sin y/n .cos y i sin y/n / D 2nC1 .cosn y/.sin ny/
4 cos2 y 1 2i sin 2y
4 cos2 y 1 : 2i sin 2y
For y D =n, we have 4 cos2 n 1 Sn 2 cos D 2nC1 cosn .sin / D 0: n n 2i sin 2 n Thus 2 cos n 2 .Gn /, so that 2 cos
5 r.Gn / 5 r.GnC1 / 5 5 r.G/ 5 2 D lim 2 cos ; n!1 n n
which implies r.Gn / " r.G/ as n ! 1.
116
J.I. Fujii
5.3 Products for Graphs If V .G/ D V .G 0 /, then the product A.G/A.G 0 / (in particular, A.G/n ) makes sense, but it does not always represent the adjacency operator of some graph in discourse. This usual product is discussed in the next section. Here we investigate some “products” for graphs. First we introduce the tensor product for graphs [10]. The tensor product `2 .V / ˝ 2 ` .W / for Hilbert spaces `2 .V / and `2 .W / can be defined as `2 .V W / where ev ˝ ew denotes .ev ; ew / which forms the basis of `2 .V / ˝ `2 .W /. The inner product of it means hx1 ˝ y1 ; x2 ˝ y2 i D hx1 ; x2 ihy1 ; y2 i: The tensor product A ˝ B for operators A and B is defined by .A ˝ B/.x ˝ y/ D Ax ˝ By; which is an extension of the Kronecker product for matrices. It follows from the definition .A ˝ B/.C ˝ D/ D AB ˝ CD: It is known that kA ˝ Bk D kAkkBk
and .A ˝ B/ D .A/.B/:
Note that W .A ˝ B/ W .A/W .B/ and the equality does not always hold. In fact, let 0 0 0 1 : AD ; B D tA D 1 0 0 0 ˚ ˇ Then W .A/ D W .B/ D W .A ˝ B/ D ˇjj 5 1=2 . In particular, w.A/w.B/ D
1 1 < D w.A ˝ B/; 4 2
and r.A ˝ B/ D r.A/r.B/. Indeed, r.A ˝ B/ D lim k.A ˝ B/n k1=n D lim kAn ˝ B n k1=n n!1
n!1
n
n
D lim .kA kkB k/ n!1
1=n
D r.A/r.B/:
Now, we define the tensor product G ˝ H for graphs G and H by X
A.G ˝ H / D A.G/ ˝ A.H / D D
X
X
.eu ˝ ev / ˝ .ex ˝ ew /
.v!u/2V .G/ .w!x/2V .H /
X
.eu ˝ ex / ˝ .ev ˝ ew /:
.v!u/2V .G/ .w!x/2V .H /
5
Spectrum and Entropy for Infinite Directed Graphs
117
So, summing up, we have: Theorem 5. For graphs G and H , kG ˝ H k D kGkkH k; .G ˝ H / D .G/.H /; r.G ˝ H / D r.G/r.H /; W .G ˝ H / W .G/W .H / and w.G ˝ H / = w.G/w.H /: P1
Example 5. Let U D
kD1 ekC1
1
U W
2
˝ ek be the (unilateral) shift: r.U / D 1
3
ı ! ı ! ı !
and S C.2/ the supercomplete graph: S C.2/ W
v
ı
w
! ı
r.S C.2// D 2 :
Since A.S C.2// D ev ˝ ev C ev ˝ ew C ew ˝ ev C ew ˝ ew ; we have A.S C.2/˝U / D
1 X
ev.kC1/ ˝ evk Cev.kC1/ ˝ ewk Cew.kC1/ ˝ evk Cew.kC1/ ˝ ewk
kD1
where the new vertices vk are determined by evk D ev ˝ ek . Thus the tensor product S C.2/ ˝ U is
S C.2/ ˝ U W
v1
v2
v3
v4
w1
w2
w3
w4
ı ! ı ! ı ! ı % & % & % & ı ! ı ! ı ! ı
r S C.2/ ˝ U D 2 :
In general, we have r S C.n/ ˝ U D n. Next we mention the Hadamard (Schur) product for graphs. Let G and H be infinite directed graphs with V .G/ D V .H /. Then the Hadamard product G H is defined by A.G/ A.H /; hA.G/ A.H /ev ; ew i D hA.G/ev ; ew ihA.H /ev ; ew i: Take isometric operator U (i.e., U U D I ) from `2 .V / to `2 .V / ˝ `2 .V / determined by Uev D ev ˝ ev for all v 2 V , namely, as a dyadic representation, U D
X v2V
.ev ˝ ev / ˝ ev :
118
J.I. Fujii
Then we have the Toyama–Marcus–Khan theorem [6, 10, 22]: A.G/ A.H / D U .A.G/ ˝ A.H //U; which is a useful tool to investigate properties of the Hadamard product. Since we have E.G H / D E.G/ \ E.H /, the Hadamard product G H is a spanning subgraph of G and H . Thus Theorem 5 implies kG H k 5 kGk; kH k; r.G H / 5 r.G/; r.H / and w.G H / 5 w.G/; w.H /: Noting that A ˝ B D .A ˝ I /.I ˝ B/ D .I ˝ B/.A ˝ I /, we have .A ˝ I C I ˝ B/ D .A/ C .B/ for all bounded operators. But, even for graphs G and H , the operator A.G/ ˝ I C I ˝ A.H / is not always the adjacency one of some graph. Here we adopt Mohar’s term [21]: A graph G is called simple if there is no selfloop. Then, for simple graphs G and H , the graph G ˚ H defined by A.G ˚ H / D A.G/ ˝ I`2 .V .H // C I`2 .V .G// ˝ A.H /
(5.3)
is called the Cartesian product. Although the Cartesian product can be defined for all simple graphs, we also define it for graphs if (5.3) determines some graph. In the case of Example 5, we have: Example 6. Although the shift U in Example 5 is simple, a supercomplete graph S C.n/ is not. But the Cartesian product S C.2/ ˚ U can be defined as ı ! l ı !
ı ! ı ! ı S C.2/ ˚ U W r S C.2/ ˚ U D 3 l l l ı ! ı ! ı The definition (5.3) implies r S C.n/ ˚ U D n C 1 in general.
In general, spectral relations for the Cartesian products for simple graphs are: Theorem 6. For simple graphs G and H , the following hold: .G ˚ H / D .G/ C .H /;
and W .G ˚ H / W .G/ C W .H /
and kG ˚H k 5 kGkCkH k; r.G ˚H / D r.G/Cr.H /; w.G ˚H / D w.G/Cw.H /: Proof. For unit vectors x and y hA.G/x; xi C hA.H /y; yi D hA.G/x; xihy; yi C hx; xihA.H /y; yi D hA.G/ ˝ I C I ˝ B/x ˝ y; x ˝ yi 2 W .G ˚ H /;
5
Spectrum and Entropy for Infinite Directed Graphs
119
which implies the inclusion for numerical ranges. Moreover it shows w.G ˚ H / = w.G/ C w.H / and the reversed inequality is the triangle one, so that we have the equality. Other relations are clear. t u For simple undirected graphs, Mohar and Woess [21] introduced the NEPS (i.e., the noncomplete extended p-sum) which is a general concept including tensor and Cartesian products. We extend it to the directed case in [10]: Let C be a nonempty subset of the two-dimensional binary space f0; 1g2 . For simple graphs G and H , the NEPS G H is defined as the graph with vertices V D V .G/ V .H / satisfying C
X
A.G H / D C
A.G/c1 ˝ A.H /c2
(5.4)
.c1 ;c2 /2C
with convention X 0 D I . If the right-hand side of (5.4) determines a graph, it can be defined even for the nonsimple case. If C D f.1; 1/g, then NEPS means tensor product and C D f.1; 0/; .0; 1/g gives C
the Cartesian one. Now we have general spectral results by (5.4). Theorem 7. For simple graphs G and H , 8 < X c1 c2 .G H / D : C .c1 ;c2 /2C
and r.G H / D C
X
9 ˇ = ˇ ˇ ˇ 2 .G/; 2 .H / ˇ ;
r.G/c1 r.H /c2 :
.c1 ;c2 /2C
Remark 1. Recently, from the viewpoint of quantum information theory, Accardi et al. discussed other products of rooted undirected simple graphs G (i.e., there is a unique vertex eG called the root. Rooted graphs are extended easily to the directed case; in particular, we will discuss the “rooted directed tree” to consider entropy for all graphs). The orthogonal product for G and H is the graph obtained by attaching a copy of H by its root eH to each vertex of G except its root eG . If a copy of H is attached also to eG in addition to the orthogonal product, then it is called the comb product. The star product is obtained by attaching a copy of H by eH only to eG . Their main interest is in the free product .V; E/ of a finite set of rooted graphs Gk : Define the set of vertices as the words by ˇ ˚ V D feg [ v1 v2 vm ˇ vk 2 V .Gjk / n feGjk g jk 6D jkC1 ; where e is newly added as the empty word. The empty word means ev D ve D e for all vertices v and the original roots ek are identified with e. Define the edge by ˚ E D fvu; v0 ug j fv; v0 g 2 [j E.Gj /; u; vu; v0 u 2 V :
120
J.I. Fujii
If the length ` of each word in E is restricted to ` 5 m for some m, then the free product is called an m-free one. (for details, see [1]). All these notions can be extended to the directed case; for example, the above E is redefined by ˚ E D fvu; v0 ug j v ! v0 2 [j E.Gj /; u; vu; v0 u 2 V ; so that we have the definition of the free product for directed rooted graphs. Here we give each example for directed graphs. Let
H W
% and G W ı ! ı eG v1 &
ı
eH
w
ı v2 ı v3 ;
then we have e
ı!ı
% &
star product
comb product
orthogonal product
ı ;
e
ı!ı
ı
% &
ı
% ;
ı
w
ı v2
ı! ı e
v1
&
ı v3
and v2 w
ı
ı
2-free product v3 w
ı
.
v1 w
ı ! wv2 % ı ! ı ! wv1 & ı ! wv3 :
5.4 Directed Path and Tree To see the spectral structure of graphs, we consider directed trees and paths. Here a k-path from v to w in G means a set of connected k arrows from v to w in G whose existence corresponds to the .v; w/-element of A.G/k . If A.G/k determines some graph, then G is called k-powerable (for k D 2, squarable). If A.G/ is k-idempotent (i.e., A.G/k D A.G/) or k-nilpotent (i.e., A.G/k D O), then G is k-powerable. The permutation graphs and shift ones are k-powerable for all k 2 R. Algebraic operators, such as idempotent and nilpotents, have a specific spectral property: Equation p.A/ D O implies p./ D 0 for 2 .A/ by the spectral mapping theorem. Thus, for k-idempotent (resp. nilpotent) A, we have
5
Spectrum and Entropy for Infinite Directed Graphs
n
2 ij
.A/ e k1
ˇ o ˇ ˇ j D 1; : : : ; k 1 [ f0g
121
.resp. .A/ D f0g/ ;
and hence r.A/ D 1 (resp. 0). Moreover it has a standard block matrix form
I T AD O O
O T resp. ; O O
so that we have ˇ ˇ ˚ ˚ W .A/ D 1 C hT y; xi ˇ kxk2 C kyk2 D 1 resp. hT y; xi ˇ kxk2 C kyk2 D 1 p kT k kT k resp. and kAk D 1 C kT k2 .resp. kT k/ : w.A/ D 1 C 2 2 Example 7. A typical connected k-idempotent finite graph Ik is defined by the k k adjacency matrix 0
0 B1 B B B B0 A.Ik / D B : B: B: B @0 0
1 1 1C C :: C C Rk1 1k1 :C ; CD :: C 0k1 0 : 0 0 1C C 1 0 1A 0 0 0
0 : 1 :: ::
:
0 1 0 :: :: : :
where Rk1 is the k 1-dimensional cyclic permutation and 1k1 (resp. 0k1 ) is the k 1-dimensional column (resp. row) vector with entries 1 (resp. 0). Then p p 1C k1 r.Ik / D 1, w.Ik / D and kIk k D k. These graphs are: 2 a a a j I5 @ I3 a I4 I 6 ] J @ a
6 I2 a S J
a / wa S 6 a J @
? HH a j a Ra @ a a Clearly, the above notions can be rephrased in terms of k-paths. Theorem 8. The following equivalences hold. (1) A graph G is k-powerable if and only if G has at most one k-path between each pair of vertices. (2) A graph G is k-idempotent if and only if the condition that G has a unique k-path from v to w is equivalent to v ! w 2 E.G/. (3) A graph G is k-nilpotent if and only if G has no k-path. Similarly to (1) in the above theorem, we give a condition that the usual product makes sense.
122
J.I. Fujii
Corollary 2. For graphs G and H with V D V .G/ D V .H /, the product A.G/A.H / determines some graph GH if and only if #
˚
ˇ u 2 V ˇ v ! u 2 E.H /; u ! w 2 E.G/ 5 1
for all pairs .v; w/ of vertices in V . A quasinilpotent operator is the one with .N / D f0g, or equivalently r.N / D 0. For example, the backward weighted shift 0
0 21 B0 0 B D B0 0 @ :: :
Uf2 k g
22 0 0 23 :: :: : :
1
0
:: :
C C C A
2 4 6 satisfies Uf2k g Uf2 ; 2 ; 2 ; : : :/ and thereby k g D diag.0; 2 1 kUf2 k g k D 2
n and k.Uf2 k g / k D 2
n.n1/ 2
:
It follows that n 1=n r.Uf2 D lim 2 k g / D lim k.Uf2k g / k n!1
n!1
n1 2
D 0:
Thus the quasinilpotent operator is not always nilpotent. Nevertheless all quasinilpotent graphs are nilpotent and r.G/ … .0; 1/ for all graphs G. Theorem 9. The following statements are equivalent: (i) G is nilpotent, (ii) G is quasinilpotent, and (iii) r.G/ < 1. Proof. It suffices to show (iii) implies (i). In fact, suppose that r.G/ < 1. Then there exists n with kA.G/n k < 1. Since all the entries of A.G/n are nonnegative integers, its norm is not less than 1 unless it is a zero operator. Thus A.G/n must be zero; that is, G is nilpotent. t u Next we consider trees generated by a graph. Here a .mono/ rooted tree means a nontrivial directed tree graph G with a unique origin; that is, a graph G with the valency k has no selfloops and there is a vertex v0 called the origin such that d C .v/ 5 k d .v0 / D 0
for all v 2 V; and d .v/ D 1
d C .v0 / 6D 0 for v 6D v0 :
Thus, the minimum graph in the rooted trees is ı ! ı. Note also that a rooted tree T is not normally symmetric but k-powerable for all k. Note that we can take T 0 naturally with A.T 0 / D A.T /2 and V .T 0 / D V .T /, which is denoted by T 2 . Then we have that T 2 is a rooted tree again and so is T n for each n.
5
Spectrum and Entropy for Infinite Directed Graphs
123
For a rooted tree T , let T ŒnI v be the number of n-paths starting from the vertex v. C C In particular, T Œn denotes T ŒnI v0 . Thus, T ŒnI v D d.n/ .v/ where d.n/ is the degree n function in T . So we can obtain the norm, the spectral radius, and afterwards the (prototype of) entropy of a rooted tree. Theorem 10. If T is a rooted tree, then r.T / D lim max T ŒnI v1=.2n/ n!1
v2V
and kT k D max v2V
p d C .v/:
Proof. Since d .v/ 1 except v0 , then A.T / A.T / is the diagonal matrix diag.d C.v1 /; d C .v2 /; /, so that we obtain the formula for norm kT k. Thereby 1
r.T / D lim kT n k n D lim n!1
n!1
n1 p 1 max T ŒnI v t D lim max T ŒnI v 2n : u v2V
n!1
v2V
Example 8. Let Tk be the (rooted) k-regular .directed/ tree, that is, a rooted tree with d C .v/ k. The 1-regular treep T1 is also called the unilateral shift and denoted also by U . Then we have r.Tk / D k. Example 9. For a monotone-increasing sequence c D .c.n// in N , let Mc be the class of rooted trees T with T Œc.n/ D 1 for all n. Define a locally k-regular tree Fc 2 Mc as a rooted tree with valency k = 2 such that Fc Œm D kFc Œm 1 for all m 2 N nfc.n/jn 2 N g. So we have lim inf n!1
log Fc Œn log Fc Œc.n/ D lim inf D 0: n!1 n c.n/
In this tree Fc , d C .v/ D k except the vertices that are the terminals of paths from the origin whose lengths are c.n/ 1. For j with 0 < j 5 c.n/ c.n 1/, we have .c.n/ c.n 1/ j / log k c.n 1/ log Fc Œc.n/ j D D 1 log k c.n/ j c.n/ j c.n/ j c.n 1/ log Fc Œc.n/ 1 5 1 log k D : c.n/ 1 c.n/ 1 It follows that lim sup n!1
log Fc Œn log Fc Œc.n/ 1 c.n 1/ D lim sup D 1 lim sup log k: n c.n/ 1 n!1 n!1 c.n/ 1
Thus, lim sup.log Fc Œn/=n D 0 if c.n/ is a polynomial of n. However, it is equal to n .log k/.M 1/=M for c.n/ D M n and log k for c.n/ D M N .
124
J.I. Fujii
Considering this example, we define H0 .T / as H0 .T / D lim sup n!1
1 log T Œn; n
which is a prototype of entropy. Then, in Example 8, we have H0 .Tk / D log k D 2 log r.Tk /: For a rooted tree T with the valency k, it holds for any n that T Œn 5 Tk Œn D k n . So we have an upper bound of H0 .T / by Example 9 and a lower bound. Lemma 2. Let T be a rooted tree with the valency k. If T is infinite, then 0 5 H0 .T / 5 log k, and otherwise H0 .T / D 1. For a nontrivial directed graph G with the valency k and a fixed vertex w in G, define the free-generating tree T .GI w/ as the rooted tree satisfying (T0 )–(T2 ). (T0 ) (T1 ) (T2 )
There is a surjection ˚ from V .T .GI w// onto V .G/, d C .v/ D d C .˚.v// for all v 2 V .T .GI w//, ˚.v0 / D w for the origin v0 of T .GI w/.
For the sake of convenience, we identify v0 with w. All the directed paths in T .GI w/ correspond one-to-one to those in G via ˚. Thus, the number of the n-paths from w in G is exactly T .GI w/Œn. For example: Example 10. For all the following graphs Gk , the free-generating rooted tree T .Gk I v/ for any vertex v is a unilateral shift U :
G5 W
G1 W ı
G2 W ı
ı
G3 W ı
ı . ı ! ı
G6 W ı ! ı ! ı
!ı
G4 W ı ! ı
G7 D U W ı ! ı ! ı ! :
Example 11. For the homogeneous k-regular undirected tree Uk (i.e., d ˙ .v/ k), the free-generating tree T .Uk I v/ is the k-regular tree Tk for all v. The following lemma is a characterization of nilpotent graphs in terms of the free-generating trees. Recall that the length of a finite tree T is the maximum of the lengths of the paths in T . Lemma 3. A graph G is nilpotent if and only if all free-generating trees of G are finite and their lengths are bounded. It is easy to see that T .T I v0 / D T for a rooted tree T with the origin v0 . For a k-regular tree Tk , we have T .Tk I v/ D Tk for all v in Tk . In the following simple example, we see how the entropy of the free-generating tree is changing.
5
Spectrum and Entropy for Infinite Directed Graphs
125
Example 12. Consider a rooted tree G D T2;4 defined as the star product graph for ı ! T2 and ı ! T4 attaching to the root to each tree T2 and T4 : e1
e2
T2;4 W T2
.
v0 ı
&
T4
Then we have H0 .T .GI v1 // D log 2 and H0 .T .GI v2 // D log 4. In order to obtain H0 .T .GI v0 //, let us see the number of n-paths T .GI v0 /Œn from the origin v0 . Since T .GI v0 /Œn D 2n1 C 4n1 ; we have H0 .T .GI v0 // D lim sup n!1
log.2n1 C 4n1 / log.2n1 C 4n1 / D lim D log 4: n!1 n n
Finally in this section, we give an interesting example for free-generating trees, which shows clearly the property of the original graph. Example 13. It is known that the following undirected graph G ı
! ı ;
which is frequently used as an elementary automaton, is closely related to the Fibonacci sequence .a0 ; a1 ; a2 ; : : :/ D .1; 1; 2; 3; 5; 8; 13; 21; : : :/ and the golden ratio
p 1C 5 . 2
In fact, its adjacency matrix is 0 1 A D A.G/ D 1 1
and its spectrum (in this case, eigenvalues) is p 1˙ 5 2 .A/; 2 which shows r.G/ is the golden ratio. Also the transition an an1 0 1 an1 DA D anC1 an an 1 1 gives the Fibonacci relation, cf. [19]: anC1 D an C an1 :
(5.5)
126
J.I. Fujii
Then, the initial vector t.a0 ; a1 / D t.1; 1/ yields the above sequences (5.5). Moreover, by the Jordan decomposition, we have 1 0 p n p 1 5 0 1 5 2 2p 2p @ 2 1 C n p n A p A D p 1C 5 51 2 4 5 1 5 1C 5 0 2 which shows 0
p !nC1 1 @ 1C 5 an D p 2 5
p !nC1 1 1 5 A: 2
But it is not easy to see that the above graph G gives (5.5). So we consider the freegenerating tree of T D T .GI v0 /. (To make it easy, we label and color vertices.) GW
! :
ı
v0
v1
Then (5.5) appears as each number an of the nth node vertices in T and the relation between G and the Fibonacci sequence is visually clear. v0 d 1
v1
) t
? d t d t ? t ? d
? t
t ? d
t 9
d? 2
d?
? t 3
? t d 5
? t
t?
t ? d t ? d
? t 1
? t
t ? d t ? d
? t
t? 8 t ? d 13
Thereby, we have H0 .T .GI v0 // D lim sup n!1
1 log an n
1 D lim sup log p n!1 5
1=n
0
p !nC1 @ 1C 5 2
p p !.nC1/=n 1C 5 1C 5 : D lim log D log n!1 2 2
p !nC1 11=n 1 5 A 2
5
Spectrum and Entropy for Infinite Directed Graphs
127
Thus we have the logarithm of the golden ratio. This gives us much information to consider entropies for infinite directed graphs.
5.5 Two Entropies for Graphs Based on the preceding section, we define two entropies of graphs. First, according to the case of finite graphs, we defined an entropy h.G/ for a graph G. Definition 1. For a nonnilpotent graph G, the spectral entropy h.G/ is defined by h.G/ D log r.G/. This entropy for finite graphs was observed again as the complexity in the sense of Kolmogorov by Fujii, Nakamura, Seo, and Watatani [16]. (This is extended to the complexity for positive operators in [8].) loghA.G/n u; ui n!1 n
h.G/ D lim
0 1 1 B :: C where u D @ : A. Here, for each natural number n, the number 1 an .G/ D hA.G/n u; ui is called the Schwarz constant for G and is equal to the number of n-paths in G. To consider the distribution of spectral entropies for graphs, we give the following example. Example 14. For k = 2, n = 1, there exist finite graphs fGn .k/g with r.Gn .k// D k 1=n . For example, for the cyclic permutation U.n/ with n vertices, i.e., 0 0 0 0 B1 0 B n1 X B :: e.kC1/ mod n ˝ ek D B A.U.n// D Rn D B0 1 : B: :: kD0 @ :: : 0 0 1
1 1 0C C :: C :C C; C 0A 0
let Gn .k/ be a graph including exactly k U.n/’s as subgraphs with only one common vertex called the center, as in the following examples, see Fig. 5.2.
128
J.I. Fujii G2 .2/
kD2 r D2
1 2
b
G3 .2/
b 6 ? b 6 ? b
G4 .2/
AA U b r D2
1 3
@ R b
r D2
KA A b - b
nD2
b
nD4
b
b b b b @ I b - b @ Rb 1 Ib b @ 4
KA KA A A b - b - b KA A b - b
1
r D 33
G2 .3/
G3 .3/
Ib b @ @ R b
1 4
nD3
b b KAU A b 1 r D 32 6 b?
kD3
b
b Ib b @
rD3
@ R b
G4 .3/
Fig. 5.2 Gn .k/
Then the number of m-paths in Gn .k/ is 0 am .Gn .k// D k @
n1 X
j
k
mCj n
k
1
0
AD@
j D0
n1 X
j
k
1
mCj n
k C1 A
;
j D0
where b c means Gauss’ symbol. Then complexity formula shows 0 r.Gn .k// D lim @ m!1
n1 X
j
k
11=m
mCj n
k C1 A
j D0
D lim
m!1
mCn1 1=m k b n cC1
mC1
D lim k mnnC1 D k 1=n m!1
by replacing m with mn n C 1. Considering the tensor products for the above examples, we have the distribution for the spectral radii or entropies for graphs by Theorem 5. Theorem 11. The entropies h.G/ for graphs G are densely distributed in the halfline Œ0; 1/. Examples 12–14 suggest another entropy for graphs as in [5]. Let an .v/ be the number of n-paths in G started from the vertex v: an .v/ D
X u2V .G/
hA.G/n ev ; eu i:
5
Spectrum and Entropy for Infinite Directed Graphs
129
Definition 2. For a nonnilpotent graph G, the topological (or combinatorial) entropy H.G/ of a graph G is defined by H.G/ D sup
lim
v2V .G/ n!1
log an .v/ : n
Then we showed in [5] that Theorem 12. For all nonnilpotent graphs G, the topological entropy is estimated by the spectral entropy h.G/: h.G/ 5 H.G/ 5 2h.G/: Moreover if G is a finite graph, then h.G/ D H.G/. Proof. By Lemma 3, T .GI v/Œn may be assumed to be nonzero. Let p.vI n/ V be the vertices that are the terminals of n-paths from v. For the adjacency operator A of G, we have ˇ ˇ2 ˇX ˇ X ˇ ˇ 2 n T .GI v/Œn D ˇ hA ev ; ew iˇ 5 jhAn ev ; ew ij2 ˇ w ˇ X
5 kAn ev k2
w2p.vIn/
kew k2 5 kAn k2 T .GI v/Œn:
w2p.vIn/
Thus, T .GI v/Œn1=n 5 kAn k2=n ! r.G/2 for all v, hence H.G/ 5 2h.G/. To show h.G/ D log r.G/ 5 H.G/, put A D A.G/, B D A , and r D r.G/ D r.A/ D r.B/. Theorem 3 shows there exist unit positive approximate proper vectors fxn g of r for B such that kzn k 5 1=.nk n1 / where zn D .B r/xn . Here we may assume that there is a vertex v with ı infn hev ; xn i > 0. Putting ˛n D ..An1 C rAn2 C C r n1 /ev ; zn /; we have T .G W v/Œn D
X
hAn ev ; ew i D
w2V
X
hev ; B n ew i
w2V n
= hev ; B xn i D hev ; r n xn i C hev ; .B n1 C rB n2 C C r n1 /zn i D r n hev ; xn i C ˛n = ır n C ˛n : Note that ˛n is bounded by the following inequalities: 0 5 ˛n 5 .kAn1 ev k C rkAn2 ev k C C r n1 kev k/kzn k 5 .k n1 C rk n2 C C r n1 /kzn k 5 nk n1 kzn k 5 1 since r 5 k. Thereby we have H.G/ = lim sup n!1
1 1 log T .GI v/Œn = lim sup log.ır n C ˛n / D log r D h.G/: n n!1 n
130
J.I. Fujii
Next we show the equality for the finite case. The above equation holds when r.G/ < 1. So suppose G is a finite nonnilpotent graph. Then G has an infinite freegenerating tree and consequently G has a cycle. Considering (strongly) connected components, we may assume that the adjacency matrix A.G/ is irreducible. Then the Perron–Frobenius theorem shows that there exists the unit positive eigenvector p for an eigenvalue r.G/. Let e be a vector whose entries are all 1. Then T .GI v/Œn D hG n ev ; ei where ev is the vector corresponding to the vertex v. It follows from the positivity of p that there exists a positive number ˛ such that ˛p e is a positive vector. Then r.G/n hp; ei D hG n p; ei 5 hG n e; ei 5 ˛hG n p; ei D ˛ r.G/n hp; ei for all n. By he; ei D dim `2 .V / D ]V , we have 1 log T .GI v/Œn n v n!1 P T .GI v/Œn hG n e; ei 1 1 = lim sup log v D lim sup log he; ei he; ei n!1 n n!1 n
H.G/ D sup lim sup
r.G/n hp; ei 1 log D log r.G/ D h.G/: n!1 n he; ei
= lim Conversely, we have
H.G/ 5 lim sup n!1
5 lim sup n!1
1 loghG n e; ei n 1 log.˛ r.G/n hp; ei/ D log r.G/ D h.G/ n
so that h.G/ D H.G/ holds.
t u
The above theorems show the distribution for H.G/. Corollary 3. The entropies H.G/ for nonnilpotent graphs G are densely distributed in the half-line Œ0; 1/. We have that the estimation in Theorem 12 is best possible by the following example. Example 15. As in Fig. 5.3, let Tk;m be the directed tree such that in the nth nodes, .km/wn vertices have k arrows and others have none, where wn is the number of k
5
Spectrum and Entropy for Infinite Directed Graphs
)
c c
p
c
PP PP ? q P c
@ ? R @ c c
C CW ? ccc pp pp
p
p
c
C ? CW ccc pp pp
131
p
p
c
@ ? R @ c c
C ? CW ccc pp pp
p
p
C ? CW ccc pp pp
p
pp p ?
Cantor set Fig. 5.3 The tree T3;1 and the Cantor set
the nth node vertices and the root (i.e., 0th node) vertex has k arrows, or w1 D k. (In particular, Tk D Tk;0 is the k-ary directed tree.) For a tree Tk;m , we have wn D k.k m/n1 and Tk;m is squarable in the sense that A.Tk;m /2 is also an adjacency operator for 2 some graph, say Tk;m . In fact, 2 n D Tk.km/;m.km/ and in general Tk;m D Tk.km/n1 ;m.km/n1 : Tk;m
So the topological entropy is log k.k m/n1 n!1 n
H.Tk;m / D lim
D lim
n!1
log k C .n 1/ log.k m/ D log.k m/: n
On the other hand, by A.Tk;m / A.Tk;m / D kP for some projection P , we have the norm p kTk;m k D k and hence the spectral entropy is h.Tk;m / D log r.Tk;m / D lim
n log kTk;m k
n!1 n p log .k m/n log.k m/ D : D lim n!1 n 2
The above examples Tk;m are attractive ones which represent fractals called selfsimilar sets (see, e.g., [4]). For example, T3;1 represents the Cantor set as in Fig. 5.3.
132
J.I. Fujii
Other examples for self-similar sets are in the following table. Self-similar set
k
m
J
Scale
Similarity dimension
Cantor dust Sierpi´nski gasket Menger sponge
3 4 27
1 1 7
1 2 3
1/3 1/2 1/3
log 2= log 3 log 3= log 2 log 20= log 3
Here J is the dimension of the space on which the figure in discourse lies. In these fractals, the ratio is k 1=J and the number of self-similar maps is k m. Thus the similarity dimension is d D J log.k m/= log k and the relation to the entropies is d D
J log.k m/ J h.Tk;m / JH.Tk;m / D D : log k log kTk;m k 2 log kTk;m k
5.6 Ziv’s Entropy and Coding Finally, we apply our discussion to coding theory. If we put a letter on each arrow in G, we may consider an infinite path in G as a message on G. Hereafter suppose G is a finite directed graph, and consequently h.G/ D H.G/. For a message x D .v0 ; v1 ; v2 ; : : :/ on a graph G, let xŒn be the n-path .v0 ; v1 ; : : : ; vn / in x, say the first n-words in x. For a shift S on the message S.: : : ; vi ; : : :/ D .: : : ; vi C1 ; : : :/, put ˇ ˚ Xn D ] S j .x/Œn ˇ j D 1; 2; : : : ; the number of n-words in x. Then a kind of complexity of x is defined; see [25]. Definition 3. For a message x on G, Ziv’s entropy h.x/ is defined by h.x/ D lim
n!1
log Xn : n
By the definition, we have Theorem 13. For all messages x on a finite directed graph G, h.x/ 5 h.G/. If G is irreducible, then there exists a message x such that h.x/ D h.G/. Proof. Since Xn is not greater than the Schwarz constant an D an .G/, we have h.x/ 5 h.G/. Next suppose G is irreducible. For any integer m = 1, let x1m ; x2m ; : : : ; xamm be all the distinct m-words on G. For two words xim D v1 v2 vm and xinC1 D u1 u2 un , there exists a path .vm ; w1 ; : : : ; wk ; u1 / from vm to u1 in G since G is m n irreducible. Let wm;n i;j be w1 w2 wk if xi xi C1 is not the word on G, and otherwise m m;n m the empty word. Then xi wi;j xi C1 is the word on G. Thus we put a message x by
5
Spectrum and Entropy for Infinite Directed Graphs
133
1;2 1 1 2 2;2 2 x D x11 w1;1 1;2 x2 xa1 wa1 ;1 x1 w1;2 x2 ;
and hence we have Xm D am .G/ for all m. Therefore h.x/ D h.G/.
t u
Remark 2. The above argument for entropy or complexity is in the nonstochastic situation. Here we mention the relation between the entropy of graphs and that of a probability matrix. By setting probabilities P on all arrows in G, we obtain a transition matrix G.P/ of a Markov chain. Then it is known that h.G/.D H.G// D max H.G.P//; P
where H.G.P// is the entropy as a Markov source. In fact, for A.G/ D .aij / and its Frobenius vector f D .ri /, the above maximum is attained at B D .bij / with bij D
ri aij : rj r.G/
Here we deal with block source encoding and decoding without noise, which is used for data compression. The (finite state) block encoder (resp. decoder) with length N means the map W x 7! y (resp. W y 7! x) O for a message x, the encoded message y, and the replica (i.e., decoded message) xO such that the i th block S iN .y/ŒN (resp. S iN .x/ŒN O ) depends only on S iN .x/ŒN (resp. S iN .y/ŒN ) for all i . Then, Ziv showed the following lemma in [25]. Lemma 4. (Ziv’s Data processing lemma) h.b x / 5 h.y/ 5 h.x/ for every encoderdecoder pair. Here we assume that the messages x and xO are written by an alphabet of M letters and y by that of M 0 letters with M = M 0 . Considering the case that the encoded message is on a finite directed graph, we can show the estimation by the entropy of the graph, which is better than by log M 0 , and considered as a generalization of Ziv’s result [25]. Theorem 14. (Bound for invertibility) Let F be a finite directed graph and suppose that a message x is encoded to the message on F . If h.x/ > h.F /, then x 6D b x. Proof. To show the contraposition, suppose that there exists a block encoder ' and a block decoder such that x D b x . Then Theorem 13 implies h.y/ 5 h.F /. It follows from Ziv’s data processing lemma that h.b x / 5 h.y/ 5 h.F /. By x D b x, we have h.x/ D h.b x /, so that h.x/ 5 h.F /. t u Finally in this section, we try to generalize Ziv’s block source coding theorem in [25], which, however, included a somewhat ambiguous part. In [2], S. Arimotro reformulated it to a mathematically accurate statement. Now we generalize Ziv– Arimoto’s coding theorem by a finite graph. Recall that an irreducible finite graph G is aperiodic if there is a positive integer m such that there exists an m-path from v to u for all vertices v and u.
134
J.I. Fujii
Theorem 15. (Coding theorem of graph version) For an aperiodic finite directed graph F , let x be the message on the alphabet of M letters and encoded messages on F . If h.x/ < h.F / for all x, then there exists a pair of N -block encoder and decoder with x D xO ..x//. Proof. To estimate length for codewords, suppose that we can take N and its largest divisor ` with `2 M ` 5 N . For all the distinct `-words x1` ; x2` ; ; xs` in the i th block S iN .x/ŒN , we have s D X` 5 M ` . Since F is aperiodic, there exists a set of m-paths from u and v for all vertices u and v of F . Taking an integer k with bkm = M ` = bkm1 where bn is the Schwarz constant of F , we can translate the words xi` over A into the codewords yikm on F . As in the proof of Theorem 13, km m km m km m z1 y2 z2 yM zs being also the words on there exist m-words zm i with y1 F , which is called the list of the casts and defines the first L letters in the codeword S iN .y/ŒN . Then we have km1 L D .k m C m/s D kX` 5 X` m C 1 C log M ` log bkm1 k m 1 log M mC1 : 5N C 2 ` log bkm1 ` Now parse S iN .x/ŒN as S iN .x/ŒN D S iN .x/Œ`S iN C` .x/Œ` S i.N C1/` .x/Œ`: There are at most N` vectors in the parsed S iN .x/ŒN . Then the remainder of the i th block codeword S iN .y/ŒN is taken to be the list of the addresses: Each word S iN Cj ` .x/Œ` is encoded into a word on F pointing to the place of the corresponding `-word in the list part. Thus the length Q D q m of this codeword is large enough if bQ1 < X` 5 bQ ; or equivalently q <mC1C
qm1 log X` : log bqm1
For the addresses wqm ; : : : ; wqm for 1 P S iN .x/Œ`; S iN C` .x/Œ`; : : : ; S i.N C1/` .x/Œ`; z01 wqm z02 wqm z0P is also a respectively, we can take m-words z0i such that wqm 1 2 P N N word on F of length . ` /q. If K D L C . ` /q turns out to be less than N , prolong it by adding .N K/-words whose letters are all equal to the first letter in F (say 0). For K = N , summing up the list of the casts and the addresses, we have
5
Spectrum and Entropy for Infinite Directed Graphs
135
N q K DLC ` mC1 q m 1 log X` k m 1 log M mC1 5N C C : C `2 log bkm1 ` ` log bqm1 ` Now we show that we can take N . Since 1 1 log X` D h.x/ < log r.F / D lim log bqm1 q!1 q m 1 `!1 ` lim
N D 0, we can take N large enough to make K 5 N . `!1 `
and lim
t u
Remark 3. If F D S C.M 0 / is the supercomplete graph with vertices M 0 , then we can obtain the coding theorem by Ziv and Arimoto from Theorem 13. Corollary 4. Let G be a finite directed graph with M arrows and F an aperiodic finite directed graph with M 0 arrows. If h.G/ < h.F / and M = M 0 , then there exists a pair of a block encoder and a decoder with length N such that x D b x ..x// for all messages x on G. Proof. It follows from Theorem 13 that h.x/ 5 h.G/ < h.F / for all messages x on G. Thereby Theorem 15 implies the required result. u t
5.7 Notes The adjacency operator for graphs was introduced by Mohar [20] for an undirected case and then by Fujii et al. [12] for a general case. The latter is the starting point of our study of infinite directed graphs from the viewpoint of operator theory [5, 7, 9–11, 13–16, 19, 24]. In particular, Seo and the author investigated spectral properties and various operations for graphs. Based on these studies, the author introduced two entropies of infinite graphs and discussed the difference between them [5]. On the other hand, considering S. Arimoto’s idea for Ziv’s coding theorem in a Japanese text [2], Y. Seo and the author obtained a generalization of his theorem in [11].
References 1. Accardi L, Staszewski R, Salacity R (2007) Decompositions of the free product of graphs. Infix Dampens Anal Quantum Probed Relax Top 10:303–334. http://arxiv.org/pdf/math/0609329.pdf 2. Arimoto S (1980) Probability, information and entropy (in Japanese). Morikita, Tokyo 3. Cvetkovi´c DM, Doob M, Sachs H (1980) Spectra of graphs. Academic, New York
136
J.I. Fujii
4. 5. 6. 7. 8.
Edgar GA (1990) Measure, topology and fractal geometry. Springer, New York Fujii JI (1993) Entropy of graphs. Math Japon 38:39–46 Fujii JI (1995) The Marcus-Khan theorem for Hilbert space operators. Math Japon 41:531–535 Fujii JI, Fujii M (1993) Theorems of Williams and Pasadena. Math Japon 38:35–37 Fujii JI, Fujii M (2002) Kolmogorov’s complexity for positive definite matrices. Lin Algebra Appl 341:171–180 Fujii JI, Seo Y (1993) Graphs and numerical center of mass. Math Japon 38:351–359 Fujii JI, Seo Y (1995) Graphs and tensor products of operators. Math Japon 41:245–252 Fujii JI, Seo Y (1997) Entropy and coding for graphs. Int J Math Stat Sci 6(1):63–77 Fujii M, Sasaoka H, Watatani Y (1989) Adjacency operators of infinite directed graphs. Math Japon 34:727–735 Fujii M, Sasaoka H, Watatani Y (1990) The numerical range of an infinite directed graph. Math Japon 35:577–582 Fujii JI, Sasaoka H, Watatani Y (1991) The spectrum of an infinite directed graph. Math Japon 36:607–625 Fujii M, Nakamoto M, Seo Y (1996) Graphs and Gersgorin’s theorem. Math Japon 44:517–523 Fujii M, Nakamoto M, Seo Y, Watatani Y (1996) Graphs and Kolmogorov’s complexity. Math Japon 44:113–117 Furuta T (2001) Invitation to linear operators. Taylor & Francis, New York Halmos PR (1982) A Hilbert space problem book, 2nd edn. Springer, Berlin, New York Matsumoto A, Seo Y (1996) Graphs and Fibonacci numbers. Math Japon 44:317–322 Mohar B (1982) The spectrum of an infinite graph. Lin Algebra Appl 48:245–256 Mohar B, Woess W (1989) A survey on spectra of infinite graphs. Bull Lond Math Soc 21: 209–234 Paulsen I (1986) Completely bounded maps and dilations (Pitman Res Notes Math 146). Longman Scientific and Technical, Essex, and John Wiley and Sons, New York Schaefer HH (1980) Topological vector spaces. Springer, Berlin, New York Seo Y (1993) Graphs and nilpotent operators. Math Japon 38:1089–1093 Ziv J (1978) Coding theorems for individual sequences. IEEE Trans Inf Theory IT-24:405–412
9. 10. 11. 12. 13. 14. 15. 16. 17. 18. 19. 20. 21. 22. 23. 24. 25.
Chapter 6
Application of Infinite Labeled Graphs to Symbolic Dynamical Systems Kengo Matsumoto
Abstract We apply a theory of infinite labeled graphs to studying presentations and classifications of symbolic dynamical systems, by introducing a class of infinite labeled graphs, called -graph systems. Its matrix presentation is called a symbolic matrix system. The notions of a -graph system and symbolic matrix system are generalized notions of a finite labeled graph and symbolic matrix for sofic subshifts to general subshifts. Strong shift equivalence and shift equivalence between symbolic matrix systems are formulated so that two subshifts are topologically conjugate if and only if the associated canonical symbolic matrix systems are strong shift equivalent. We construct several kinds of shift equivalence invariants for symbolic matrix systems. They are the dimension groups, the K-groups, and the Bowen–Franks groups that are generalizations of the corresponding notions for nonnegative matrices. They yield topological conjugacy invariants of subshifts. The entropic quantities called -entropy and volume entropy for -graph systems are also studied related to the topological entropy of symbolic dynamics. Keywords Subshifts Symbolic dynamics -Graph systems Strong shift equivalence Bowen–Franks group K-theory Topological entropy MSC2000: Primary 37B10; Secondary 28D20, 46L80
6.1 Introduction Graph theory has intersections with other branches of mathematics. The theory of symbolic dynamics is one of them. It has significant uses for coding theory and formal language theory in information sciences. The class of symbolic dynamical systems is a basic part of topological dynamical systems. Graph-theoretical
K. Matsumoto () Department of Mathematics, Joetsu University of Education, Joetsu 943-8512, Japan e-mail:
[email protected]
M. Dehmer (ed.), Structural Analysis of Complex Networks, c Springer Science+Business Media, LLC 2011 DOI 10.1007/978-0-8176-4789-6 6,
137
138
K. Matsumoto
techniques and linear algebraic techniques are very useful to study symbolic Z dynamical systems. Q1Let ˙ be a finite set, called an alphabet. Let ˙ be the infinite product spaces i D1 ˙i where ˙i D ˙, endowed with the product topology. The transformation on ˙ Z given by ..xi /i 2Z / D .xi C1 /i 2Z is called the (full) shift. Let be a shift-invariant closed subset of ˙ Z i.e. ./ D . The topological dynamical system .; j / is called a subshift. QWe denote j by and write the subshift as for short. We denote by X . 1 i D1 ˙i / the set of all right-infinite sequences that appear in . Symbolic dynamical systems have several subclasses by viewing the underlying graphs. The class of Markov shifts, which are often called SFT (shifts of finite type) comes from finite directed graphs, and the class of sofic shifts, which are a generalization of Markov shifts, comes from finite directed labeled graphs. In the study of Markov shifts and sofic shifts, graph-theoretical techniques are very useful. More generally we apply a theory of infinite labeled graphs to studying general symbolic dynamical systems, by introducing a class of infinite labeled graphs, called -graph systems. Its matrix presentation is called a symbolic matrix system. The notions of the -graph system and symbolic matrix system are generalized notions of a finite labeled graph and symbolic matrix for sofic shifts to general subshifts. Strong shift equivalence and shift equivalence between symbolic matrix systems are formulated such that two subshifts are topologically conjugate if and only if the canonical symbolic matrix systems are strong shift equivalent. We construct several kinds of shift equivalence invariants for symbolic matrix systems. They are the dimension groups, the Bowen–Franks groups, and the nonzero spectra that are generalizations of the corresponding notions for nonnegative matrices. The K-groups for symbolic matrix systems are introduced. They are also shift equivalence invariants and stronger than the Bowen–Franks groups but weaker than the dimension triples. These kinds of shift equivalence invariants naturally induce topological conjugacy invariants for subshifts. In particular the K-groups and the Bowen–Franks groups induce not only topological conjugacy invariants for subshifts, but also flow equivalence invariants. As entropic quantities, the volume entropy and the -entropy for -graph systems are introduced. They are shift equivalence invariants and hence induce topological conjugacy invariants of subshifts. The -entropy measures a distance from sofic shifts. The volume entropy does not necessarily coincide with classical topological entropy unless the subshift is sofic. A finite sequence D .1 ; :::; k / of elements j 2 ˙ is called a word. We denote by jj the length k of . A word D .1 ; :::; k / is said to appear in x D .xi /i 2Z 2 ˙ Z if xm D 1 ; :::; xmCk1 D k for some m 2 Z. For a subshift , we denote by Bk ./ the set of all words of length k appearing in some x 2 , where B0 ./ denotes the empty word. We set B ./ D [1 B ./. A matrix kD0 k with entries in nonnegative integers is called a nonnegative matrix. Throughout the chapter, ZC and N denote the set of all nonnegative integers, and the set of all positive integers, respectively. For an introduction to the theory of symbolic dynamical systems, see [21, 33] (cf. [11, 27]). The chapter is organized as follows. In Sects. 6.2–6.4, basic classes of subshifts called topological Markov shifts that are defined by finite directed graphs, sofic shifts that are defined by finite labeled graphs, and coded shifts that are defined
6
Application of Infinite Labeled Graphs to Symbolic Dynamical Systems
139
by codes, respectively, are briefly explained. In Sect. 6.5, -graph systems and symbolic matrix systems are introduced as a presentation of subshifts. In Sect. 6.6, strong shift equivalences and shift equivalences of symbolic matrix systems are defined and studied. In Sect. 6.7, nonnegative matrix systems are introduced to define K-theoretic invariants of symbolic matrix systems. In Sect. 6.8, K-theoretic invariants for symbolic matrix systems called dimension groups, K-groups, and Bowen–Franks groups are introduced. They yield topological conjugacy invariants of subshifts. In Sect. 6.9, spectrum, -entropy, and volume entropy for -graph systems and symbolic matrix systems are introduced. They are closely related to the topological entropy of subshifts. In Sect. 6.10, the K-groups and the Bowen–Franks groups for a class of nonsofic shifts is presented. In Sect. 6.11, a relation of the K-theoretic invariants for -graph systems and symbolic matrix systems to K-theory for C -algebras is remarked. Finally, in Sect. 6.12, conclusions and further works are described.
6.2 Markov Shifts and Finite Directed Graphs The classification of symbolic dynamical systems has been very important and one of the central problems in the theory of topological dynamical systems. The classification problem was first examined for a class of symbolic dynamical systems called topological Markov shifts. Each dynamical system of the class is determined by a single square nonnegative matrix. Hence the behavior of such a dynamical system depends on the underlying matrix. Let A be an n n nonnegative matrix. Put VA D f1; : : : ; ng: the vertex set. Write A.i; j / edges from i 2 VA to j 2 VA . We have a directed graph denoted by GA . Let ˙ be the set EA of all edges of GA . Let sA and rA be the maps from EA to VA that assign the source vertex and the range vertex of an edge respectively. Let A be the set of all bi-infinite sequences .ei /i 2Z of ei 2 EA with rA .ei / D sA .ei C1 /; i 2 Z. Then A becomes a subshift, called the topological Markov shift defined by nonnegative matrix A. In [52], R. F. Williams introduced the notions of strong shift equivalence and shift equivalence between nonnegative matrices and showed that two topological Markov shifts are topologically conjugate if and only if the underlying matrices are strong shift equivalent. Strong shift equivalence implies shift equivalence. Although the converse implication had been a long-standing open problem, Kim and Roush [20] have solved negatively for even irreducible matrices. Two nonnegative matrices M and N are said to be strong shift equivalent in 1-step, written as M N; if there exist rectangular nonnegative matrices R and S such that
1
M D RS;
N D SR:
Definition 6.2.1 ([52]). Two matrices A and B are said to be strong shift equivalent in l-step, written as A B; if there exist nonnegative square matrices A1 ; A2 ; : : : ; Al1 such that
l
140
K. Matsumoto
A A1 A2 Al1 B: 1
1
1
1
1
We say A and B are strong shift equivalent if A B for some l, and write it as l
A B:
Williams has proved the following fundamental theorem of Markov shifts. Theorem 6.2.2 ([52]). Topological Markov shifts A and B are topologically conjugate if and only if A and B are strong shift equivalent. Definition 6.2.3 ([52]). Two matrices A and B are said to be shift equivalent of lag l, written as A B; if there exist nonnegative rectangular matrices R and S such that
l
Al D RS;
B l D SR;
SA D BS;
RB D AR:
We say A and B are shift equivalent if A B for some l, and write it as A B: l
Both strong shift equivalence and shift equivalence are equivalence relations, and strong shift equivalence implies shift equivalence.
6.3 Sofic Shifts and Finite Labeled Graphs We fix a finite set ˙ called an alphabet. We write the empty symbol ; in ˙ as 0. We denote by S˙ the set of all finite formal sums of elements of ˙. A square matrix with entries in S˙ is called a symbolic matrix over ˙. It is an equivalent object to a labeled graph called a -graph [47]. There is a class of subshifts called sofic shifts that are a generalized class of Markov shifts determined by symbolic matrices (see [14, 25, 26, 51], etc.). Let A.D ŒA.i; j /i;j D1;:::;n / be an n n symbolic matrix over ˙. We have a directed graph GA from the matrix A with labeled edges by the symbols in ˙. We denote by .e/ D ˛ 2 ˙ the label ˛ of edge e. Let A be the set of all bi-infinite sequences ..ei //i 2Z of labels of edges ei 2 EA with rA .ei / D sA .ei C1 /; i 2 Z, where rA .ei / and sA .ei C1 / denote the range vertex of ei and the source vertex of ei C1 , respectively. Then A becomes a subshift, called the sofic shift defined by symbolic matrix A. M. Nasu in [47,48] generalized the notion of strong shift equivalence to symbolic matrices. He showed that two sofic shifts are topologically conjugate if and only if their canonical symbolic matrices are strong shift equivalent ([47, 48]; see also [16]). M. Boyle and W. Krieger in [4] introduced the notion of shift equivalence for symbolic matrices and studied topological conjugacy for sofic shifts. For two symbolic matrices A over alphabet ˙ and A0 over alphabet ˙ 0 and a bijection from a subset of ˙ onto a subset of ˙ 0 , A and A0 are said to be specified equivalent
6
Application of Infinite Labeled Graphs to Symbolic Dynamical Systems
141
under specification if A0 can be obtained from A by replacing every symbol a
appearing in A by .a/ [47, 48]. We write it as A ' A0 , or simply A ' A0 . We call a specification from ˙ to ˙ 0 . Two symbolic matrices M and M are said are strong shift equivalent in 1-step, written as M M; if there exist rectangular 1
symbolic matrices R and S such that M ' RS;
M ' SR:
Definition 6.3.1 ([47]). Two symbolic matrices A and B are said to be strong shift equivalent in l-step, written as A B; if there exist symbolic matrices l
A1 ; A2 ; : : : ; Al1 such that
A A1 A2 Al1 B: 1
1
1
1
1
We say A and B are strong shift equivalent if A B for some l, and write it as l
A B:
For a sofic shift and x D .xn /n2N 2 X , we put P .x/ D f.1 ; : : : ; k / 2 B ./ j .1 ; : : : ; k ; x1 ; x2 ; : : : / 2 X g: Two x D .xn /n2N ; y D .yn /n2N 2 X are said to be past equivalent if P .x/ D P .y/. Let V be the equivalence classes of X under the past equivalence. As is sofic, the set V is a finite set. We write an edge labeled ˛ from Œx to Œy if Œy D Œ˛x, where ˛x D .˛; x1 ; x2 ; : : : /. We have a finite labeled graph G with vertex set V . The labeled graph is called the left Krieger cover graph for the sofic shift [25,26]. Let us denote by A its symbolic matrix. We call the matrix A the canonical symbolic matrix for the sofic shift : Nasu has proved the following fundamental theorem of sofic shifts. Theorem 6.3.2 ([47]). Sofic shifts and 0 are topologically conjugate if and only 0 if their canonical symbolic matrices A and A are strong shift equivalent. Definition 6.3.3 ([4]). Two symbolic matrices A and B are said to be shift equivalent of lag l, written as A B; if there exist symbolic rectangular matrices R and S such that Al ' RS;
l
B l ' SR;
SA ' BS
RB ' AR:
We say A and B are shift equivalent if A B for some l, and write it as A B: l
Both strong shift equivalence and shift equivalence are equivalence relations, and strong shift equivalence implies shift equivalence.
142
K. Matsumoto
6.4 Coded Shifts Denote by ˙ the set of all words of an alphabet ˙. A (finite or infinite) collection C. ˙ / of words over ˙ is said to be uniquely decipherable if whenever ˛1 ˛2 ˛n D 1 2 m with ˛i ; j 2 C, then n D m and ˛i D i for i D 1; : : : ; n. A uniquely decipherable set C is called a code. Blanchard and Hansel [2] have introduced the notion of coded shift. A subshift is called a coded shift if is the closure of the set of bi-infinite sequences obtained by freely concatenating the words in a code C. It is denoted by C . Proposition 6.4.1 ([2]). For a subshift over ˙, the following four conditions are equivalent: 1. is a coded shift. 2. is presented by an irreducible countable labeled graph. 3. is the closure of the set of sequences obtained by freely concatenating the words in a subset of ˙ . 4. contains an increasing sequence of irreducible Markov shifts whose unions are dense in . Irreducible sofic shifts are coded shifts, and any coded shift is irreducible. The following are examples of coded shifts. 1. Synchronizing counter shift (cf. [9, 17, 28]). Let ˙ D fa; b; cg. Put C D n n ‚…„ƒ ‚…„ƒ fa b b c c j n D 0; 1; : : : g: It is easy to see that C is a code, and the coded shift C is not sofic. Its language is accepted by a synchronizing counter automaton. It is named the context-free shift in [33, Example 1.2.9]. 2. Dyck shifts ([22]). For 2 N 2 N, let ˙ D f.1 ; : : : ; .N ; /N ; : : : ; /1 g be the N -kinds of brackets. Define a semi-group structure in ˙ by setting ( .i / j D
1 if i D j; 0 otherwise.
Let CN be the set of all words in ˙ whose products are reduced to 1. It is easy to see that CN is a code, and the resulting coded shift CN is not sofic. The coded shift is called the Dyck shift of order N and written as DN . Its language is accepted by a push-down automaton and forms a context-free language (cf. [9, 17]).
6.5 -Graph Systems and Symbolic Matrix Systems A symbolic matrix corresponds to a labeled graph, called a -graph, that is a presentation of a sofic shift. We consider a generalization of -graphs to present any subshift. Details of this section are seen in [36].
6
Application of Infinite Labeled Graphs to Symbolic Dynamical Systems
143
We first explain the notion of the Bratteli diagram that appears in the theory of operator algebras (see [5, 12]). A Bratteli diagram consists of a vertex set V D V1 [ V2 [ and an edge set E D E1;2 [ E2;3 [ where each Vl and El;lC1 are finite and nonempty. We have maps s; r W E ! V such that s.El;lC1 / D Vl , r.El;lC1 / D VlC1 . They are called a source map and a range map, respectively. For u 2 Vl ; v 2 VlC1 ; put El;lC1 .u; v/ D fe 2 El;lC1 js.e/ D u; r.e/ D vg: A labeled Bratteli diagram .V; E; / over alphabet ˙ consists of a Bratteli diagram .V; E/ with a map from E to ˙. Definition 6.5.1. A -graph system .V; E; ; / over alphabet ˙ consists of a labeled Bratteli diagram .V; E; / over ˙ and a surjective map from V n V1 to V satisfying the following two conditions: 1. .VlC1 / D Vl for l 2 N. 2. For u 2 Vl ; w 2 VlC2 ; there exists a bijective correspondence between El;lC1 .u; .w//
[
and
ElC1;lC2 .v; w/
v2VlC1 ;.v/Du
that is compatible with the labeling . By the above condition 1, the cardinality of the set VlC1 is greater than or equal to that of the set Vl . The above condition 2 is called the local property of the -graph system. It yields the following two conditions: 1. For e 2 ElC1;lC2 , there exists e 0 2 El;lC1 such that .s.e// D s.e 0 /;
.r.e// D r.e 0 /
and
.e/ D .e 0 /:
2. For f 2 El;lC1 , v 2 VlC2 with .v/ D r.f /, there exists e 2 ElC1;lC2 such that .s.e// D s.f /;
r.e/ D v
and
.e/ D .f /:
Two -graph systems .V; E; ; / over ˙ and .V 0 ; E 0 ; 0 ; 0 / over ˙ 0 are said to be isomorphic if there exist bijections ˆV W V ! V 0 , ˆE W E ! E 0 , and a specification W ˙ ! ˙ 0 such that 1. 2. 3. 4.
0 for l 2 N; ˆV .Vl / D Vl0 and ˆE .El;lC1 / D El;lC1 ˆV .s.e// D s.ˆE .e// and ˆV .r.e// D r.ˆE .e// for e 2 E; 0 .ˆV .v// D ˆV . .v// for v 2 V; 0 .ˆE .e// D ..e// for e 2 E.
We construct subshifts from -graph systems. Let L D .V; E; ; / be a -graph system over ˙. For k < l; set
144
K. Matsumoto
Pk;l D f.ek ; ekC1 ; : : : ; el1 /jei 2 Ei;i C1; r.ei / D s.ei C1 / for i D k; kC1; : : : ; l 2g the set of all paths from Vk to Vl , and lk times
Lk;l
‚ …„ ƒ D f.ek /.ekC1 / .el1 / 2 ˙ ˙ j .ek ; ekC1 ; : : : ; el1 / 2 Pk;l g
the set of all labeled paths from Vk to Vl . Put Ll D L1;lC1 and endow it with discrete topology. We set XL D f..e1 /; .e2 /; : : : / 2 ˙ N jei 2 Ei;i C1 ; r.ei / D s.ei C1 / for i 2 Ng the set of all right infinite sequences consisting of labels along infinite paths. The topology on XL is defined from open sets of the form U.1 ;:::;k / D f.˛1 ; ˛2 ; : : : / 2 XL j˛i D i for i D 1; : : : ; kg for .1 ; : : : ; k / 2 Lk : By the local property of the -graph system, one sees: 1. if .˛1 ; ˛2 ; : : : / 2 XL ; we have .˛2 ; ˛3 ; : : : / 2 XL , 2. if .˛k ; : : : ; ˛l1 / 2 Lk;l for l > k, we have .˛k ; : : : ; ˛l1 / 2 LkC1;lC1 : As in [33, Definition 1.3.1], a set L of words of ˙ is called a language if it satisfies the following conditions: (a) Every subword of a word w in L belongs to L. (b) For a word w in L, there are nonempty words u; v in L such that uwv belongs to L. Let L.L/ be the set of all words appearing in XL . That is, L.L/ D [kl Lk;l : Then Proposition 6.5.2. L.L/ is a language. By [33, Proposition 1.3.4], we see Theorem 6.5.3. There exists a subshift over alphabet ˙ whose language is L.L/. Namely the set B ./ of all admissible words of the subshift is L.L/: The subshift is realized as D f.: : : ; ˛2 ; ˛1 ; ˛0 ; ˛1 ; ˛2 ; : : : /j.˛n ; ˛nC1 ; : : : / 2 XL for all n 2 Zg: We denote by L the subshift in the above theorem and call it the subshift presented by the -graph system L. We next construct -graph systems from subshifts. For a subshift over ˙, denote by X its right one-sided subshift. Set l .x/ D f 2 Bl ./jx 2 X g
for
x 2 X ;
l 2 N:
6
Application of Infinite Labeled Graphs to Symbolic Dynamical Systems
145
We define a nested sequence of equivalence relations in the space X . Two points x; y 2 X are said to be l-past equivalent, written as x l y, if l .x/ D l .y/. Denote by ˝l D X = l the quotient space. For x; y 2 X and 2 Bk ./, one sees that 1. if x l y, we have x m y for m < l, 2. if x l y and x 2 X , we have y 2 X and x lk y for l > k. We have the following sequence of surjections in a natural way: ˝1
˝2
˝l
˝lC1
:
The subshift is a sofic shift if and only if ˝l D ˝lC1 for some l 2 N. For a fixed l 2 N, let Fil ; i D 1; 2; : : : ; m.l/ be the set of all l-past equivalence classes of X . Hence X is a disjoint union of Fil ; i D 1; 2; : : : ; m.l/. The vertex set Vl at level l consist of the sets Fil ; i D 1; : : : ; m.l/. We write an edge with label a from the vertex Fil 2 Vl to FjlC1 2 VlC1 if ax 2 Fil for some x 2 FjlC1 . We denote by El;lC1 the set of all edges from Vl to VlC1 . There exists a natural map l from VlC1 to Vl by mapping FjlC1 to Fil when Fil contains FjlC1 . Set V D [1 lD1 Vl and 1 E D [lD1 El;lC1 . The labeling of edges is denoted by W E ! ˙. We then see Theorem 6.5.4. For a subshift , .V ; E ; ; / becomes a -graph system which we denote by L . Moreover the subshift L presented by L coincides with the original subshift . We call L the canonical -graph system for . For a -graph system L, let L be the presented subshift by L. Then its canonical -graph system LL does not necessarily coincide with the original -graph system L. We indeed see that the canonical -graph system L for a subshift is left-resolving; i.e., the incoming edges to each vertex carry different labels, and is predecessor-separated; i.e., distinct vertices at each level have distinct predecessor sets of labels. If in particular, is a sofic shift, its canonical -graph system is eventually realized as the left Krieger cover graph for . Let us consider matrix presentation of -graph systems. Definition 6.5.5. Let .Ml;lC1 ; Il;lC1 /; l 2 N be a pair of sequences of rectangular matrices such that the following conditions for each l 2 N are satisfied: 1. Ml;lC1 is an m.l/ m.l C 1/ rectangular matrix with entries in S˙ . 2. Il;lC1 is an m.l/ m.l C 1/ rectangular matrix with entries in f0; 1g satisfying the relation: Il;lC1 MlC1;lC2 D Ml;lC1 IlC1;lC2 ;
l 2 N:
(6.1)
We further assume that both the matrices Ml;lC1 and Il;lC1 have no zero columns and no zero rows. For j , there uniquely exists i such that Il;lC1 .i; j / ¤ 0. By the above conditions one sees m.l/ m.l C 1/: The pair .M; I / is called a symbolic matrix system over ˙.
146
K. Matsumoto
Two symbolic matrix systems .M; I / over ˙ and .M0 ; I 0 / over ˙ 0 are said to be isomorphic if m.l/ D m0 .l/ for l 2 N and there exist a specification from ˙ to ˙ 0 and an m.l/ m.l/ permutation matrix Pl for each l 2 N such that
Pl Ml;lC1 ' M0l;lC1 PlC1 ;
0 Pl Il;lC1 D Il;lC1 PlC1
for
l 2 N:
The notion of a symbolic matrix system is a generalized notion of a symbolic matrix. For an n n symbolic matrix A, we set Ml;lC1 D A;
Il;lC1 D En
for
l 2N
where En denotes the identity matrix of size n. Then .Ml;lC1 ; Il;lC1 /; l 2 N is a symbolic matrix system. The following proposition shows that symbolic matrix systems are nothing but the matrix presentation of -graph systems. Proposition 6.5.6. There exists a bijective correspondence between the set of all isomorphism classes of symbolic matrix systems and the set of all isomorphism classes of -graph systems. We say a symbolic matrix system is canonical for a subshift if its corresponding -graph system is canonical. It is denoted by .M ; I /. a b 1 0 and Il;lC1 D : The For example, set for each l 2 N, Ml;lC1 D b 0 0 1 -graph system for the symbolic matrix system gives rise to the even shift, denoted by Y . Its canonical symbolic matrix system is given by the following matrices: MY1;2
a aCb b D ; b 0 0
Y I1;2
1 1 0 D 0 0 1
and 2
MYl;lC1
3 a a b D 40 b 05 ; b 0 0
2
Y Il;lC1
3 1 0 0 D 40 1 05 0 0 1
for
l 2:
6.6 Strong Shift Equivalences and Shift Equivalences In this section, we define two kinds of strong shift equivalences between symbolic matrix systems. One is called the properly strong shift equivalence that exactly reflects a bipartite decomposition of the associated -graph systems. The other one is called the strong shift equivalence that is weaker than the former strong shift equivalence. They coincide at least among symbolic matrix systems whose -graph systems are predecessor-separated and left-resolving, and hence between canonical symbolic matrix systems for subshifts. The latter is more easily defined and treated
6
Application of Infinite Labeled Graphs to Symbolic Dynamical Systems
147
than the former. The main purpose in this section is to see that topological conjugacy between two subshifts is completely characterized by strong shift equivalence between their canonical symbolic matrix systems. We first define properly strong shift equivalence between two symbolic matrix systems as a generalization of strong shift equivalence between two nonnegative matrices defined by Williams in [52] and between two symbolic matrices defined by Nasu in [47]. For the details of this section see [36]. P For alphabets C; D, put C D D P fcd jc 2 C; d 2 Dg: For x D j cj 2 SC P and y D k dk 2 SD , define xy D j;k cj dk 2 SC D . Let .M; I / and .M0 ; I 0 / be symbolic matrix systems over ˙ and ˙ 0 , 0 respectively, where Ml;lC1 ; Il;lC1 are m.l/ m.l C1/ matrices and M0l;lC1 ; Il;lC1 0 0 are m .l/ m .l C 1/ matrices. Definition 6.6.1. Two symbolic matrix systems .M; I / and .M0 ; I 0 / are said to be properly strong shift equivalent in 1-step, written as .M; I / .M0 ; I 0 /; if there 1pr
exist alphabets C; D and specifications W ˙0 ! D C
' W ˙ ! C D;
and increasing sequences n.l/; n0 .l/ on l 2 N such that for each l 2 N, there exist an n.l/ n0 .l C 1/ matrix Pl over C; an n0 .l/ n.l C 1/ matrix Ql over D; an n.l/ n.l C 1/ matrix Xl over f0; 1g, and an n0 .l/ n0 .l C 1/ matrix Xl0 over f0; 1g satisfying the following equations: '
Ml;lC1 ' P2l Q2lC1 ; Il;lC1 D X2l X2lC1 ;
M0 l;lC1 ' Q2l P2lC1 ;
(6.2)
0 0 0 Il;lC1 D X2l X2lC1
(6.3)
Xl0 QlC1 D Ql XlC1 :
(6.4)
and Xl PlC1 D Pl X 0 lC1 ;
It follows by (6.1) that n.2l/ D m.l/ and n0 .2l/ D m0 .l/ for l 2 N. Two symbolic matrix systems .M; I / and .M0 ; I 0 / are said to be properly strong shift equivalent in N-step, written as .M; I / .M0 ; I 0 /; if there exists a N pr
sequence of symbolic matrix systems .M.i / ; I .i / /; i D 1; 2; : : : ; N 1 such that .M; I / .M.1/ ; I .1/ / .M.N 1/ ; I .N 1/ / .M0 ; I 0 /: 1pr
1pr
1pr
1pr
We simply call it a properly strong shift equivalence. Lemma 6.6.2. Properly strong shift equivalence is an equivalence relation on symbolic matrix systems.
148
K. Matsumoto
Proof. It suffices to show that .M; I /
1pr
.M; I /: Put C D ˙; D D f0; 1g:
Define ' W a 2 ˙ ! a 1 2 C D and W a 2 ˙ ! 1 a 2 D C: Let Ek be the k k identity matrix. Set P2l D P2lC1 D Ml;lC1 ; Q2l D Em.l/ ; X2l D Em.l/ ;
X2lC1 DIl;lC1 ;
Q2lC1 D Em.lC1/ ;
0 X2l D Il;lC1 ;
0 X2lC1 D Em.lC1/ :
They give a properly strong shift equivalence in 1-step between .M; I / and .M; I /. u t We now introduce the notion of a bipartite symbolic matrix system and a bipartite -graph system. Definition 6.6.3. A symbolic matrix system .M; I / over ˙ is said to be bipartite if there exist disjoint subsets C; D ˙ and increasing sequences n.l/; n0 .l/ on l 2 N with m.l/ D n.l/ C n0 .l/ such that for each l 2 N, there exist an n.l/ n0 .l C 1/ matrix Pl;lC1 over C; an n0 .l/ n.l C 1/ matrix Ql;lC1 over D; an n.l/ n.l C 1/ 0 matrix Xl;lC1 over f0; 1g and an n0 .l/n0 .l C1/ matrix Xl;lC1 over f0; 1g satisfying the equations Ml;lC1 D
0 Ql;lC1
Pl;lC1 ; 0
Il;lC1
# " 0 Xl;lC1 : D 0 0 Xl;lC1
Since the relations Il;lC1 MlC1;lC2 D Ml;lC1 IlC1;lC2 and hence 0 Xl1;l Pl;lC1 D Pl1;l Xl;lC1 ;
0 Xl1;l Ql;lC1 D Ql1;l Xl;lC1 :
hold, the following lemma is straightforward. Lemma 6.6.4. For a bipartite symbolic matrix system .M; I / as above, set Pl D Pl;lC1 ;
Ql D Ql;lC1 ;
Xl D Xl;lC1 ;
X 0 l D X 0 l;lC1
and MCD l;lC1 D P2l Q2lC1 ; CD D X2l X2lC1 ; Il;lC1
MDC l;lC1 D Q2l P2lC1 ; DC 0 0 Il;lC1 D X2l X2lC1 :
Then both pairs .MCD ; I CD / and .MDC ; I DC / are symbolic matrix systems over C D and D C , respectively, and they are properly strong shift equivalent in 1-step. Definition 6.6.5. A -graph system .V; E; ; / over ˙ is said to be bipartite if there exist disjoint subsets C; D ˙ such that ˙ D C [ D and disjoint subsets VlC ; VlD Vl for each l 2 N such that VlC [ VlD D Vl and
6
Application of Infinite Labeled Graphs to Symbolic Dynamical Systems
149
1. for each e 2 El;lC1 s.e/ 2VlD ; s.e/ D 2. .VlC1 / D VlD ;
2VlC ;
C r.e/ 2 VlC1
if and only if
.e/ 2 C;
r.e/ 2
if and only if
.e/ 2 D;
D VlC1
C .VlC1 / D VlC :
Lemma 6.6.6. A symbolic matrix system is bipartite if and only if its corresponding -graph system is bipartite. Nasu introduced the notion of bipartite subshift in [47, 48]. A subshift over alphabet ˙ is said to be bipartite if there exist disjoint subsets C; D ˙ such that any .xi /i 2Z 2 is either xi 2 C and xi C1 2 D for all i 2 Z
or
xi 2 D and xi C1 2 C for all i 2 Z:
Let .2/ be the 2-higher power shift for . Put CD D f.ci di /i 2Z 2 .2/ jci 2 C; di 2 Dg; DC D f.di ci /i 2Z 2 .2/ jci 2 C; di 2 Dg: They are subshifts over alphabets C D and D C , respectively. Hence .2/ is partitioned into the two subshifts CD and DC . Lemma 6.6.7. A subshift is bipartite if and only if its canonical symbolic matrix system .M ; I / is bipartite. Proof. It is clear that a bipartite canonical symbolic matrix system gives rise to a bipartite subshift from the preceding lemma. Suppose that is bipartite with respect to alphabets C; D. Denote by .V ; E ; ; / the canonical -graph system L for . As in the construction of the canonical -graph system, the vertex set Vl is the set of all l-past equivalence classes fFil gi D1;:::;m.l/ . Put VlC D fFil jx1 2 D for all .x1 ; x2 ; : : : / 2 Fil g; VlD D fFil jx1 2 C for all .x1 ; x2 ; : : : / 2 Fil g so that we have a disjoint union VlC [ VlD D Vl to yield a bipartite decomposition t u of L . Let be a bipartite subshift over ˙ with respect to alphabets C; D: We have two symbolic matrix systems .MCD ; I CD / and .MDC ; I DC / over C D and D C from the bipartite canonical symbolic matrix system .M ; I / for , respectively. They are naturally identified with the canonical symbolic matrix systems for the subshifts CD and DC , respectively.
150
K. Matsumoto
Corollary 6.6.8. For a bipartite subshift with respect to alphabets C; D, we have .MCD ; I CD / .MDC ; I DC / 1pr
a properly strong shift equivalence in 1-step. The following notion of bipartite conjugacy has been introduced by Nasu in [47, 48]. The conjugacy from CD onto DC that maps .ci di /i 2Z to .di ci C1 /i 2Z is called the forward bipartite conjugacy. The conjugacy from CD onto DC that maps .ci di /i 2Z to .di 1 ci /i 2Z is called the backward bipartite conjugacy. A topological conjugacy between subshifts is called a symbolic conjugacy if it is a 1-block map given by a bijection between the underlying alphabets of the subshifts. Nasu proved the following factorization theorem. Lemma 6.6.9 ([47]). Any topological conjugacy into a composition of the form
between subshifts is factorized
D n n n1 n1 1 1 0 where 0 ; : : : ; n are symbolic conjugacies and 1 ; : : : ; n are either forward or backward bipartite conjugacies. Thanks to the above Nasu’s result, we reach the following theorem. Theorem 6.6.10. For two subshifts and 0 , let .M; I /, and .M0 ; I 0 / be their canonical symbolic matrix systems for and 0 , respectively. If and 0 are topologically conjugate, the symbolic matrix systems .M; I / and .M0 ; I 0 / are properly strong shift equivalent. Conversely, assume that two symbolic matrix systems .M; I / over ˙ and .M0 ; I 0 / over ˙ 0 are properly strong shift equivalent in 1-step. Let L and L0 be their associated -graph systems for .M; I / and .M0 ; I 0 /, respectively. Lemma 6.6.11. Let ' W ˙ ! C D and W ˙ 0 ! D C be specifications that give a properly strong shift equivalence in 1-step between .M; I / and .M0 ; I 0 /. For a word x1 x2 2 B2 .L / of the presented subshift L , put '.xi / D ci di ; i D 1; 2 where ci 2 C; di 2 D. Then there uniquely exists y0 2 ˙ 0 such that .y0 / D d1 c2 . Theorem 6.6.12. If two symbolic matrix systems are properly strong shift equivalent, their presented subshifts are topologically conjugate. Proof. Suppose .M; I /
1pr
.M0 ; I 0 /: We use the same notation as in the def-
inition of properly strong shift equivalence. Set D L and 0 D L0 : By the preceding lemma, we have a 2-block map ˆ from B2 ./ to ˙ 0 defined by ˆ.x1 x2 / D y0 where .y0 / D d1 c2 and '.xi / D ci di ; i D 1; 2. Let ˆ1 be the sliding block code induced by ˆ so that ˆ1 is a map from to ˙ 0 Z . We also write as ˆ the map from to the set of all words of ˙ 0 defined by
6
Application of Infinite Labeled Graphs to Symbolic Dynamical Systems
151
ˆ.x1 x2 xn / D ˆ.x1 x2 /ˆ.x2 x3 / ˆ.xn1 xn /: To prove ˆ1 ./ 0 , it suffices to show that for any word w in , ˆ.w/ is an admissible word in 0 . For w D w1 w2 wn 2 Bn ./ and any fixed l n C 1, we find j D 1; 2; : : : ; m.l C n/ and k D 1; 2; : : : ; m.l/ such that w appears in Ml;lCn .k; j /, where Ml;lCn D Ml;lC1 MlCn1;lCn . Take i D 1; 2; : : : ; m.l n/ with Iln;l .i; k/ D 1, where Iln;l D Iln;lnC1 Il1;l . Hence w appears in Iln;l Ml;lCn .i; j /. Put '.wi / D ci di ; i D 1; 2; : : : ; n. By the equality '
Il1;l Ml;lCn ' X2l2 P2l1 Q2l P2lC1 Q2lC2 P2lC2n3 Q2lC2n2 X2lC2n1 ; the word d1 c2 d2 c3 dn1 cn appears in a component of Q2l P2lC1 Q2lC2 P2lC2n3 : Hence the word 1 .d1 c2 / 1 .d2 c3 / 1 .dn1 cn / appears in a component of M0l;lC1 M0lC1;lC2 M0lCn2;lCn1 : Thus ˆ.w/ is an admissible word in 0 so that the sliding block code ˆ1 maps to 0 . Similarly, we can construct a sliding block code ‰1 from 0 to that is an inverse of ˆ1 . t u Properly strong shift equivalence exactly corresponds to a finite sequence of bipartite decompositions of symbolic matrix systems and -graph systems. The definition of properly strong shift equivalence for symbolic matrix systems, however, needs rather more complicated formulations than that of strong shift equivalence for nonnegative matrices. We next introduce the notion of strong shift equivalence between two symbolic matrix systems that is a simpler and weaker condition than properly strong shift equivalence. Let .M; I / and .M0 ; I 0 / be two symbolic matrix systems over alphabet ˙ and ˙ 0 , respectively. Let m.l/ and m0 .l/ be the sequences 0 for which Ml;lC1 ; Il;lC1 are m.l/ m.l C 1/ matrices and M0l;lC1 ; Il;lC1 are 0 0 m .l/ m .l C 1/ matrices, respectively. Definition 6.6.13. Two symbolic matrix systems .M; I / and .M0 ; I 0 / are said to be strong shift equivalent in 1-step, written as .M; I / .M0 ; I 0 /; if there exist alphabets C; D and specifications ' W ˙ ! C D;
1st
W ˙0 ! D C
such that for each 1 < l 2 N, there exist an m.l 1/ m0 .l/ matrix Hl over C and an m0 .l 1/ m.l/ matrix Kl over D satisfying the following equations: '
Il1;l Ml;lC1 ' Hl KlC1 ;
0 Il1;l M0l;lC1 ' Kl HlC1
and 0 Hl Il;lC1 D Il1;l HlC1 ;
0 Kl Il;lC1 D Il1;l KlC1 :
152
K. Matsumoto
Two symbolic matrix systems .M; I / and .M0 ; I 0 / are said to be strong shift equivalent in N-step, written as .M; I / .M0 ; I 0 /; if there exist symbolic matrix N st
systems .M.i / ; I .i / /; i D 1; 2; : : : ; N 1 such that .M; I / .M.1/ ; I .1/ / .M.N 1/ ; I .N 1/ / .M0 ; I 0 /: 1st
1st
1st
1st
We simply call it a strong shift equivalence. Similarly to the case of properly strong shift equivalence, we see that strong shift equivalence on symbolic matrix systems is an equivalence relation. Proposition 6.6.14. Properly strong shift equivalence in 1-step implies strong shift equivalence in 1-step. Proof. Let Pl ; Ql ; Xl , and Xl0 be the matrices in the definition of properly strong shift equivalence in 1-step between .M; I / and .M0 ; I 0 /: We set Hl D X2l1 P2l1 ;
0 Kl D X2l1 Q2l1 :
They give rise to a strong shift equivalence in 1-step between .M; I / and .M0 ; I 0 /. t u Conversely we have Proposition 6.6.15 ([41]). Let .M; I / and .M0 ; I 0 / be the symbolic matrix systems for -graph systems L and L0 , respectively. Suppose that both L and L0 are left-resolving and predecessor-separated. The following conditions are equivalent: 1. .M; I / and .M0 ; I 0 / are strong shift equivalent in l-step. 2. .M; I / and .M0 ; I 0 / are properly strong shift equivalent in l-step. Hence the two notions, strong shift equivalence and properly strong shift equivalence, coincide with each other in the canonical symbolic matrix systems. By a similar argument to the proof of Theorem 6.6.12, we obtain Theorem 6.6.16. If two symbolic matrix systems (not necessarily canonical) are strong shift equivalent, their presented subshifts are topologically conjugate. We next introduce the notion of shift equivalence between two symbolic matrix systems as a generalization of Williams’s notion for nonnegative matrices [52] and Boyle–Krieger’s notion for symbolic matrices [4]. Let .M; I / and .M0 ; I 0 / be two symbolic matrix systems over alphabets ˙ and ˙ 0 , respectively. For N 2 N, we put .˙/N D ˙ ˙ and .˙ 0 /N D ˙ 0 ˙ 0 W the N -times products. Definition 6.6.17. For N 2 N, two symbolic matrix systems .M; I / and .M0 ; I 0 / are said to be shift equivalent of lag N if there exist alphabets CN ; DN and specifications '1 W ˙ CN ! CN ˙ 0 ;
'2 W ˙ 0 DN ! DN ˙
6
Application of Infinite Labeled Graphs to Symbolic Dynamical Systems
153
and 1
W .˙/N ! CN DN ;
2
W .˙ 0 /N ! DN CN
such that for each l 2 N, there exist an m.l/ m0 .l C N / matrix Hl over CN and an m0 .l/ m.l C N / matrix Kl over DN satisfying the following equations: '1
Ml;lC1 HlC1 ' Hl M0lCN;lCN C1 ; 1
Il;lCN MlCN;lC2N ' Hl KlCN ;
'2
M0l;lC1 KlC1 ' Kl MlCN;lCN C1 ; 2
0 Il;lCN M0lCN;lC2N ' Kl HlCN
and 0 Il;lC1 HlC1 D Hl IlCN;lCN C1 ;
0 Il;lC1 KlC1 D Kl IlCN;lCN C1 :
We denote this situation by .M; I / .M0 ; I 0 / lagN
or
.H; K/ W .M; I / .M0 ; I 0 / lagN
and simply call it a shift equivalence. Similarly to the case of nonnegative matrices and symbolic matrices, we see that 1. .M; I / .M0 ; I 0 / implies .M; I / .M0 ; I 0 / for all L N . lagN
2. .M; I /
lagN
.M0 ; I 0 / and .M0 ; I 0 /
.M00 ; I 00 /:
lagL
lagN 0
.M00 ; I 00 / imply .M; I /
lagN CN 0
Hence shift equivalence is an equivalence relation on symbolic matrix systems. Proposition 6.6.18. Strong shift equivalence in N -step implies shift equivalence of lag N in symbolic matrix systems. For a subshift .; / over ˙, its n-higher power shift ..n/ ; / is defined to be the subshift .; n / over .˙/n (cf. [33]). Two subshifts are called eventually conjugate if their n-higher power shifts are topologically conjugate for all large enough n [19, 52]. Williams and Kim and Roush showed that two square nonnegative matrices are shift equivalent if and only if the associated topological Markov shifts are eventually conjugate. Boyle and Krieger generalized their result to symbolic matrices and sofic subshifts [4]. For a symbolic matrix system .M; I /; let be the presented subshift. We set for l 2 N, n Il;lC1 D Inl;nlC1 InlCn1;nlCn ;
Mnl;lC1 D Mnl;nlC1 MnlCn1;nlCn :
Then .Mn ; I n / becomes a symbolic matrix system whose presented subshift is the n-higher power shift .n/ of .
154
K. Matsumoto
Proposition 6.6.19. If symbolic matrix systems .M; I / and .M0 ; I 0 / are shift equivalent, their presented subshifts and 0 are eventually conjugate. Proof. Assume .H; K/ W .M; I / .M0 ; I 0 /: For a number K 2 N, put n D lagN
K C N . Let CN ; DN be the alphabets as in the definition of shift equivalence. Set C D CN ; D D DN .˙/K . There are natural specifications .˙/n ! C D and .˙ 0 /n ! D C by using the specifications in the shift equivalence between .M; I / and .M0 ; I 0 /. Put the matrices 0 0 0 Pl D Hnln InlK;nlKC1 InlKC1;nlKC2 Inl1;nl ;
Ql D Knln MnlK;nlKC1 MnlKC1;nlKC2 Mnl1;nl : They are an m.nl n/ m0 .nl/ matrix over C and an m0 .nl n/ m.nl/ matrix over D, respectively. They yield a strong shift equivalence in 1-step between .Mn ; I n / and .M0 n ; I 0 n / so that their presented subshifts are topologically conjugate. t u Properly shift equivalences .M; I /
N pr
.M0 ; I 0 / are defined in [36, 41]. They
are slightly stronger than shift equivalence and weaker than properly strong shift equivalence.
6.7 Nonnegative Matrix Systems In this section, we introduce the notion of a nonnegative matrix system that is also a generalization of nonnegative matrices. We then generalize strong shift equivalent and shift equivalence between nonnegative matrices to between nonnegative matrix systems. Let .Al;lC1 ; Il;lC1 /; l 2 N be a pair of sequences of rectangular matrices such that the following conditions for each l 2 N are satisfied: 1. Al;lC1 is an m.l/ m.l C 1/ rectangular matrix with entries in nonnegative integers. 2. Il;lC1 is an m.l/ m.l C 1/ rectangular matrix with entries in f0; 1g satisfying the relation: Il;lC1 AlC1;lC2 D Al;lC1 IlC1;lC2 ;
l 2 N:
(6.5)
We further assume that both the matrices Al;lC1 and Il;lC1 have no zero columns and no zero rows. For j , there uniquely exists i such that Il;lC1 .i; j / ¤ 0. The above conditions imply that m.l/ m.l C1/: The pair .A; I / is called a nonnegative matrix system. The following is basic. Lemma 6.7.1. For a symbolic matrix system .M; I /, let Ml;lC1 be the m.l/ m.l C 1/ nonnegative matrix obtained from Ml;lC1 by setting all the symbols equal to 1. Then the resulting pair .M; I / becomes a nonnegative matrix system.
6
Application of Infinite Labeled Graphs to Symbolic Dynamical Systems
155
We write the matrices above as supp.Ml;lC1 / D Ml;lC1 and call Ml;lC1 the support of Ml;lC1 . The pair .M; I / is also called the support of .M; I / or the nonnegative matrix system associated with .M; I /. Definition 6.7.2. Two nonnegative matrix systems .A; I / and .A0 ; I 0 / are said to be strong shift equivalent in 1-step, written as .A; I / .A0 ; I 0 /; if for each 1st
1 < l 2 N, there exist an m.l 1/ m0 .l/ nonnegative matrix Hl and an m0 .l 1/ m.l/ nonnegative matrix Kl satisfying the equations: Il1;l Al;lC1 D Hl KlC1 ;
0 Il1;l A0l;lC1 D Kl HlC1
0 Hl Il;lC1 D Il1;l HlC1 ;
0 Kl Il;lC1 D Il1;l KlC1 :
and
Two nonnegative matrix systems .A; I / and .A0 ; I 0 / are said to be strong shift equivalent in N-step, written as .A; I / .A0 ; I 0 /; if there exist nonnegative matrix N st
systems .A.i / ; I .i / /; i D 1; 2; : : : ; N 1 such that .A; I / .A.1/ ; I .1/ / .A.N 1/ ; I .N 1/ / .A0 ; I 0 /: 1st
1st
1st
1st
We simply call it a strong shift equivalence. This formulation is also a generalization of Williams’s strong shift equivalent between nonnegative matrices [52]. Similarly to symbolic matrix systems, strong shift equivalence is an equivalence relation on nonnegative matrix systems. We directly have Proposition 6.7.3. If two symbolic matrix systems are strong shift equivalent (in N -step), then the associated nonnegative matrix systems are strong shift equivalent (in N -step). t For a nonnegative matrix system .A; I /, the transpose Il;lC1 of the matrix Il;lC1 m.l/ naturally induces an ordered homomorphism from Z to Zm.lC1/ , where the positive cone Zm.l/ of the group Zm.l/ is defined by C m.l/
ZC
D f.n1 ; n2 ; : : : ; nm.l/ / 2 Zm.l/ jni 0; i D 1; 2 : : : m.l/g:
We put the inductive limits: t W Zm.l/ ! Zm.lC1/ g; ZI t D limfIl;lC1 ! t ZC D limfIl;lC1 W Zm.l/ ! Zm.lC1/ g: C C It !
156
K. Matsumoto
t For each l 2 N, the homomorphism Il;lC1 W Zm.l/ ! Zm.lC1/ is injective. Hence the canonical homomorphism l W Zm.l/ ! ZI t is injective. By the relation (6.5), the sequence of the transposed matrices Atl;lC1 ; l 2 N of Al;lC1 ; l 2 N yields an endomorphism of the ordered group ZI t . We write it as .A;I / .
Definition 6.7.4. For nonnegative matrix systems .A; I / and .A0 ; I 0 / and L 2 N, a homomorphism from the group ZI t to the group ZI 0 t is called a finite homomor0 phism of lag L if it satisfies the condition .Zm.l/ / Zm .lCL/ for all l 2 N; where m.l/ m0 .l/ Z and Z are naturally embedded into ZI t and ZI 0 t , respectively. Proposition 6.7.5. Two nonnegative matrix systems .A; I / and .A0 ; I 0 / are strong shift equivalent in 1-step if and only if there exist order-preserving finite homomorphisms of lag 1: W ZI t ! ZI 0 t and W ZI 0 t ! ZI t such that
ı D .A;I / ;
ı D .A0 ;I 0 / :
For a nonnegative matrix system .A; I /, we set the m.l/ m.l C k/ matrices: Il;lCk D Il;lC1 IlCk1;lCk ;
Al;lCk D Al;lC1 AlCk1;lCk
for each l; k 2 N. Definition 6.7.6. Two nonnegative matrix systems .A; I / and .A0 ; I 0 / are said to be shift equivalent of lag N if for each l 2 N, there exist an m.l/ m0 .l C N / nonnegative matrix Hl and an m0 .l/ m.l C N / nonnegative matrix Kl satisfying the equations: Al;lC1 HlC1 D Hl A0lCN;lCN C1 ; Hl KlCN D Il;lCN AlCN;lC2N ;
A0l;lC1 KlC1 D Kl AlCN;lCN C1 ; 0 Kl HlCN D Il;lCN A0lCN;lC2N
0 Il;lC1 HlC1 D Hl IlCN;lCN C1 ;
0 Il;lC1 KlC1 D Kl IlCN;lCN C1 :
and
We write this situation as .A; I / .A0 ; I 0 / lagN
or
.H; K/ W .A; I / .A0 ; I 0 / lagN
and simply call it a shift equivalence. This formulation is a generalization of Williams’s shift equivalence between nonnegative matrices ([52], see also [4]). Shift equivalence is an equivalence relation on nonnegative matrix systems. Similarly to symbolic matrix systems, strong shift equivalence in N -step implies shift equivalence of lag N in nonnegative matrix systems. As in the case of strong shift equivalence, we may describe shift equivalence on nonnegative matrix systems in terms of single homomorphisms between inductive limits of Abelian groups.
6
Application of Infinite Labeled Graphs to Symbolic Dynamical Systems
157
Proposition 6.7.7. Two nonnegative matrix systems .A; I / and .A0 I 0 / are shift equivalent of lag N if and only if there exist order-preserving finite homomorphisms of lag N : W ZI t ! ZI 0 t and W ZI 0 t ! ZI t such that .A0 ;I 0 / ı D ı .A;I / ;
.A;I / ı D ı .A0 ;I 0 /
(6.6)
ı D N .A0 ;I 0 / :
(6.7)
and
ı D N .A;I / ;
Let .M; I /; .M0 ; I 0 / be symbolic matrix systems and .M; I /; .M 0 ; I 0 / be their supports, respectively. The following proposition is direct. Proposition 6.7.8. 1. .M; I / .M0 ; I 0 / implies .M; I / .M 0 ; I 0 /: nst
2. .M; I / .M0 ; I 0 / implies .M; I / .M 0 ; I 0 /: lagN
nst
lagN
6.8 Dimension Groups, K-Groups, and Bowen–Franks Groups In this section, we study several shift equivalence invariants of nonnegative matrix systems. They are the dimension group, K-groups, and Bowen–Franks groups. The dimension group for a nonnegative matrix system is a generalization of the dimension group for a nonnegative matrix defined by W. Krieger in [23, 24, 35]. Krieger’s idea to define dimension groups for nonnegative matrices is based on the K-theory for C -algebras (cf. [12, 50]). Let .A; I / be a nonnegative matrix system. We set ZI t .k/ D ZI t and ZC .k/ D ZC for k 2 N: We define an Abelian group and its It It positive cone by the inductive limits: .A;I / D limf.A;I / W ZI t .k/ ! ZI t .k C 1/g; ! k
D limf.A;I / W ZC .k/ ! ZC .k C 1/g: C .A;I / It It ! k
We call the ordered group ..A;I / ; C .A;I / / the dimension group for .A; I /. Since the map ı.A;I / W ZI t .k/ ! ZI t .k C 1/ defined by ı.A;I / .ŒX; k/ D .ŒX; k C 1/ for X 2 ZI t yields an automorphism on .A;I / that preserves the positive cone C . We also denote it by ı.A;I / and call it the dimension automorphism. The .A;I / triple ..A;I / ; C .A;I / ; ı.A;I / / is called the dimension triple for .A; I /. Proposition 6.8.1. If two nonnegative matrix systems are shift equivalent, their dimension triples are isomorphic.
158
K. Matsumoto
Proof. Suppose .A; I /
lagN
.A0 ; I 0 /: By Proposition 6.7.7, there exist order-
preserving finite homomorphisms W ZI t ! ZI 0 t and W ZI 0 t ! ZI t of lag N satisfying (6.6) and (6.7). Define the maps ˆ W ZI t .k/ ! ZI 0 t .k/ and ˆ W ZI 0 t .k/ ! ZI t .k/ by ˆ .ŒX; k/ D .Œ .X /; k/ and ˆ .ŒY; k/ D .Œ .Y /; k/ for X 2 ZI t ; Y 2 ZI 0 t : They induce homomorphisms from .A;I / to .A0 ;I 0 / and .A0 ;I 0 / to .A;I / , respectively. We still denote them by ˆ and ˆ , respectively. Since the homomorphisms ; are order preserving, the maps ˆ ; ˆ also preserve order structures of the dimension groups. It then follows that ı.A;I / ı ˆ D N N ˆ ı ı.A0 I 0 / ; ı.A0 ;I 0 / ı ˆ D ˆ ı ı.A;I / , and ˆ ı ˆ D ı.A;I / ; ˆ ı ˆ D ı.A0 ;I 0 / : Both the maps ˆ and ˆ are isomorphisms and the corresponding dimension triples are isomorphic. t u We define the dimension triple ..M;I / ; C .M;I / ; ı.M;I / / for a symbolic matrix system .M; I / as the dimension triple ..M;I / ; C ;ı / for its support .M; I /. .M;I / .M;I / C We may also define the dimension triple . ; ; ı / for subshift as the dimension triple for its canonical symbolic matrix system. Proposition 6.8.2. The dimension triples for subshifts are topological conjugacy invariants. For an n n nonnegative matrix A, the Bowen–Franks group BF .A/ is defined by the group Zn =.1 A/Zn [3]. This group was discovered in a study of suspension flows of topological Markov shifts by Bowen and Franks ([3, 15], cf. [49]). They showed that the groups are not only an invariant under shift equivalence but also an almost complete invariant under flow equivalence of topological Markov shifts. We introduce and study the notion of Bowen–Franks groups for nonnegative matrix systems as a generalization of the original Bowen–Franks groups for nonnegative matrices. Our Bowen–Franks groups for a nonnegative matrix system consist of a pair of Abelian groups. One corresponds to a generalization of the original Bowen–Franks group, called the Bowen–Franks group of degree zero, and the other one corresponds to its suspension, called the Bowen–Franks group of degree one. For matrices, the latter group is the torsion-free part of the original Bowen–Franks group. For a nonnegative matrix system, the group of degree one is not necessarily the torsion-free part of the group of degree zero (see Sect. 6.10). We introduce two Abelian groups for nonnegative matrix systems, called K-groups, that are invariant under shift equivalence. Let .A; I / be a nonnegative matrix system. For l 2 N, we set the Abelian groups t K0l .A; I / D Zm.lC1/ =.Il;lC1 Atl;lC1 /Zm.l/ ; t Atl;lC1 / in Zm.l/ : K1l .A; I / D Ker.Il;lC1 t W Zm.l/ ! Zm.lC1/ naturally induces homoBy the relation (6.5), the map Il;lC1 morphisms: il W Kl .A; I / ! KlC1 .A; I / for D 0; 1:
Definition 6.8.3. The K-groups for .A; I / are defined as the inductive limits of the Abelian groups:
6
Application of Infinite Labeled Graphs to Symbolic Dynamical Systems
159
K0 .A; I / D limfi0l W K0l .A; I / ! K0lC1 .A; I /g; ! l
K1 .A; I / D limfi1l W K1l .A; I / ! K1lC1 .A; I /g: ! l
For a symbolic matrix system .M; I /, its K-groups K0 .M; I /; K1 .M; I / are defined to be the K-groups for its support. The groups K .A; I / are also represented in the following way. Proposition 6.8.4. 1. K0 .A; I / D ZI t =.id .A;I / /ZI t D .A;I / =.id ı.A;I / / .A;I / ; 2. K1 .A; I / D Ker.id .A;I / / in ZI t D Ker.id ı.A;I / / in .A;I / : Since the dimension triple ..A;I / ; C .A;I / ; ı.A;I / / is invariant under shift equivalence of nonnegative matrix systems, we thus have Proposition 6.8.5. The groups Ki .A; I /; i D 0; 1 are invariant under shift equivalence of nonnegative matrix systems. Set the Abelian group ZI D limfIl;lC1 W Zm.lC1/ ! Zm.l/ g; l
the projective limit of the system: Il;lC1 W Zm.lC1/ ! Zm.l/ ; l 2 N: The sequence Al;lC1 ; l 2 N naturally acts on ZI as an endomorphism, denoted by A. The identity on ZI is denoted by I . Definition 6.8.6. For a nonnegative matrix system .A; I /, set BF 0 .A; I / D ZI =.I A/ZI ;
BF 1 .A; I / D Ker.I A/ in ZI :
We call BF 0 .A; I / the Bowen–Franks group for .A; I / of degree zero and BF 1 .A; I / the Bowen–Franks group for .A; I / of degree one. Theorem 6.8.7. The Bowen–Franks groups BF i .A; I /; i D 0; 1 are invariant under shift equivalence of nonnegative matrix systems. Proof. Suppose .H; K/ W .A; I / .A0 ; I 0 /: Put ˆK ..xi /i 2N / D .Ki .xN Ci /i 2N / lagN
for .xi /i 2N 2 ZI . The map ˆK yields a homomorphism from ZI to ZI 0 . By the 0 0 equality: Ki ı .IN Ci;N Ci C1 AN Ci;N Ci C1/ D .Ii;i C1 Ai;i C1 / ı Ki C1 ; the homomorphism induces a homomorphism from BF 0 .A; I / to BF 0 .A0 ; I 0 /: We denote it N K . We similarly have a homomorphism ˆ N H from BF 0 .A0 ; I 0 / to BF 0 .A; I /. by ˆ N Since we have ˆH ı ˆK D A on ZI and ˆK ı ˆH D A0 N on ZI 0 , the homomorN H and ˆ N K are inverses of each other. The homomorphisms ˆH and ˆK phisms ˆ also induce isomorphisms between BF 1 .A; I / and BF 1 .A0 ; I 0 /: t u
160
K. Matsumoto
We see the following universal coefficient theorem by using elementary homological algebra. It says that the Bowen–Franks groups are determined by the K-groups. Theorem 6.8.8. 1. There exists a short exact sequence
ı
0 ! Ext1Z .K0 .A; I /; Z/ ! BF 0 .A; I / ! HomZ .K1 .A; I /; Z/ ! 0 that splits unnaturally. 2. BF 1 .A; I / Š HomZ .K0 .A; I /; Z/: In the above theorem, Ext1Z is the derived functor of the Hom-functor in homological algebra. The formulations above come from the universal coefficient theorem for K-theory of the C -algebra OL associated with the -graph system L ([40], cf. [6]). Remark 1. As Ext1Z .K1 .A; I /; Z/ D 0; the following short exact sequence clearly holds by Theorem 6.8.8(2).
ı
0 ! Ext1Z .K1 .A; I /; Z/ ! BF 1 .A; I / ! HomZ .K0 .A; I /; Z/ ! 0: Example. Let M be an n n nonnegative matrix. Put for each l 2 N Al;lC1 D M;
Il;lC1 D the n n identity matrix:
Then .A; I / is a nonnegative matrix system that satisfies K0 .A; I / D Zn =.1 M t /Zn ; BF 0 .A; I / D Zn =.1 M /Zn ;
K1 .A; I / D Ker.1 M t / in Zn ; BF 1 .A; I / D Ker.1 M / in Zn :
Hence we have K0 .A; I / Š BF 0 .A; I / D BF .M / W the original Bowen–Franks group for M; K1 .A; I / Š BF 1 .A; I / D the torsion-free part of BF .M /: Let .A ; I / be the canonical nonnegative matrix system for a subshift . Define Ki ./ D Ki .A ; I /; i D 0; 1; BF ./ D BF .A ; I /; i D 0; 1; i
i
: the K-groups for ; : the Bowen–Franks groups for :
Theorem 6.8.9. The K-groups Ki ./ and the Bowen–Franks groups BF i ./ for subshift are Abelian groups that are topological conjugacy invariants of subshifts.
6
Application of Infinite Labeled Graphs to Symbolic Dynamical Systems
161
Suppose that is a sofic shift. We denote by m./ the cardinality of the vertices of the left Krieger cover graph for and A its adjacency matrix. Then BF 0 ./ D Zm./ =.1 A /Zm./ ;
BF 1 ./ D Ker.1 A / in Zm./ :
The Bowen–Franks group for the nonnegative matrix was first invented for use as an invariant of flow equivalence of the associated topological Markov shift rather than topological conjugacy [3, 15, 49]. For a general subshift, we have Theorem 6.8.10. The K-groups K ./ and hence the Bowen–Franks groups BF ./ for subshifts are also invariant under flow equivalence of subshifts. The proof is seen in [38, 39] by using a result of Parry–Sullivan [49].
6.9 Spectrum, -Entropy, and Volume Entropy It is well known that the set of all nonzero eigenvalues of a nonnegative matrix M is a shift equivalence invariant. The set of M is called the nonzero spectrum of M and plays an important rˆole for studying dynamical properties of the associated topological Markov shift (cf. [21, 33]). In this section, we introduce the notion of spectrum of nonnegative matrix system .A; I /. It is an eigenvalue of .A; I / in the sense stated below. We denote by Sp.A; I / the set of all eigenvalues of .A; I /: As the sequence of the sizes of matrices Al;lC1 ; Il;lC1 ; l 2 N is increasing, it seems to be natural to deal with eigenvalues of .A; I / with a certain boundedness condition defined below on the corresponding eigenvectors. We fix a nonnegative matrix system .A; I / for a while. A sequence fvl gl2N of vectors vl D .vl1 ; : : : ; vlm.l/ / 2 Cm.l/ ; l 2 N is called an I -compatible vector if it satisfies the conditions: vl D Il;lC1 vlC1
for all
l 2 N:
(6.8)
An I -compatible vector fvl gl2N is said to be nonzero if vl is a nonzero vector for some l. If vli 0 for all i D 1; : : : ; m.l/ and l 2 N, fvl gl2N is said to be nonnegPm.l/ ative. If there exists a number M such that i D1 jvli j M for all l 2 N; fvl gl2N is said to be bounded. We remark that, for an I -compatible vector fvl gl2N , vN ¤ 0 for some N implies vl ¤ 0 for all l N . Definition 6.9.1. For a complex number ˇ, a nonzero I -compatible vector fvl gl2N is called an eigenvector of .A; I / for eigenvalue ˇ if it satisfies the conditions: Al;lC1 vlC1 D ˇvl
for all
l 2 N:
(6.9)
An eigenvalue ˇ is said to be bounded if it is an eigenvalue for a bounded eigenvector. We denote by Sp .A; I / the set of all nonzero eigenvalues of .A; I / and
162
K. Matsumoto
by Spb .A; I / the set of all nonzero bounded eigenvalues of .A; I /, respectively. We call them the nonzero spectrum of .A; I / and the nonzero bounded spectrum of .A; I /, respectively. Theorem 6.9.2. If two nonnegative matrix systems are shift equivalent, their nonzero spectra coincide. Proof. Suppose .H; K/ W .A; I /
lagN
.A0 ; I 0 /: We show Sp .A; I / Sp
.A0 ; I 0 /. For ˇ 2 Sp .A; I / with nonzero eigenvector vl , we set ul D Kl vlCN for l 2 N. It is direct to see that 0 ulC1 ; ul D Il;lC1
A0l;lC1 ulC1 D ˇul :
Now if the vectors ul are zero for all l l0 for some l0 , by the equality Hl KlCN vlC2N D Il;lCN AlCN;lC2N vlC2N , we see 0 D Al;lCN IlCN;lC2N vlC2N D Al;lCN vlCN D ˇvl : Thus vl D 0 for all l l0 and hence for all l 2 N, a contradiction. Therefore ˇ is a nonzero eigenvalue of .A0 ; I 0 /. t u We next show that the nonzero bounded spectrum of .A; I / is also invariant under shift equivalence. Put NA D max j
m.l/ X
Al;lC1 .i; j /
i D1
Pm.l/ for l 2 N: By the relation (6.5), the right-hand side maxj i D1 Al;lC1 .i; j / does not depend on the choice of l 2 N. For an I -compatible vector fvl gl2N , we put Pm.l/ kvl k D i D1 jvli j. The sequence fkvl kgl2N is increasing. If fvl gl2N is nonnegative, fkvl kgl2N is constant and hence fvl gl2N is bounded. We set kvk1 D lim sup kvl k: l!1
Proposition 6.9.3. Spb .A; I / fz 2 Cjjzj NA g: Proof. For ˇ 2 Sp.A; I / with a bounded eigenvector fvl gl2N , we have ˇ
m.l/ X i D1
jvli j
m.lC1/ X j D1
0 @max j
m.l/ X i D1
1 Al;lC1 .i; j /A jvlC1 j: j
Hence the inequality ˇkvl k NA kvlC1 k holds. As fvl gl2N is bounded, liml!1 kvl k D kvk1 exists so that we have a desired assertion. t u
6
Application of Infinite Labeled Graphs to Symbolic Dynamical Systems
163
We denote by BI the set of all bounded I -compatible vectors. It is a complex Banach space with norm k k1 . A nonnegative I -compatible vector v D fvl gl2N is called a state if kvk1 D 1. Let SI be the set of all states. It is a convex subset of BI . Any bounded I -compatible vector v 2 BI can be expressed as a finite linear combinations of states. For v 2 BI , we put .LA v/li
D
m.lC1/ X j D1
Al;lC1 .i; j /vlC1 j
for
i D 1; : : : ; m.l/;
l 2 N:
Then LA gives rise to a bounded linear operator on the Banach space BI that satA vk1 . isfies kLA k D NA ; where the norm of LA is given by kLA k D supv¤0 kLkvk 1 Therefore we have Proposition 6.9.4. For a complex number ˇ, it belongs to Spb .A; I / if and only if it satisfies LA v D ˇv for some nonzero v 2 BI . That is, the bounded spectra of .A; I / are nothing but the eigenvalues of the bounded linear operator LA on the Banach space BI . By a similar manner to the proof of Theorem 6.9.2, we have Theorem 6.9.5. If two nonnegative matrix systems are shift equivalent, their nonzero bounded spectra coincide. Let .LA / be the set of all spectra of LA as a bounded linear operator on the Banach space BI . The general theory of bounded linear operators tells us that the set .LA / is not empty. Let rA be the spectral radius of the operator LA on BI ; that is, rA D supfjrj W r 2 .LA /g: By a proof similar to [46, Lemma 4.1], we have Proposition 6.9.6. There exists a state v 2 SI such that LA v D rA v. Hence we have rA 2 Spb .A; I /. It is well known that the topological entropy htop ./ for subshift is given by htop ./ D lim
k!1
1 log ]Bk ./ k
where ]Bk ./ denotes the cardinality of the set Bk ./ of all admissible words of length k in the subshift (cf. [21, 33]). We say a symbolic matrix system .M; I / is left-resolving if a symbol appearing in M.i; j / cannot appear in M.i 0 ; j / for other i 0 ¤ i ; equivalently, its -graph system is left-resolving. As in Sect. 6.5, the canonical symbolic matrix system is left-resolving. Proposition 6.9.7. Let .M; I / be a left-resolving symbolic matrix system and .M; I / its support. For any ˇ 2 Spb .M; I /, we have the inequalities: log jˇj log rM htop ./ where rM is the spectral radius of the operator LM on BI and is the presented subshift by .M; I /.
164
K. Matsumoto
Proof. The inequality log jˇj log rM is clear. Take v 2 SI such that LM v D rM v. We have for k 2 N, k 1 vi D rM
m.kC1/ X
M1;kC1 .i; j /vkC1 : j
j D1
As
Pm.1/ i D1
v1i D 1, it follows that 0 k @max rM j
m.1/ X
1 M1;kC1 .i; j /A
i D1
m.kC1/ X j D1
vkC1 D kLkM k: j
Pm.1/ We may find j0 such that kLkM k D i D1 M1;kC1 .i; j0 /. Since .M; I / is leftPm.1/ resolving, the number i D1 M1;kC1 .i; j0 / is majorized by ]Bk ./. Thus we obtain the inequalities k rM kLkM k ]Bk ./: 1
As kLkM k k ! rM for k ! 1, we have the desired inequalities.
t u
For a subshift , define the nonzero spectrum Sp ./ and the nonzero bounded spectrum Spb ./ of by the nonzero spectrum and the nonzero bounded spectrum of the canonical nonnegative matrix systems .M; I / for , respectively. We thus have Theorem 6.9.8. Both the sets Sp ./ and Spb ./ are not empty and topological conjugacy invariants of subshifts. In particular, Spb ./ is bounded by the topological entropy of the subshift . Other entropic quantities for a -graph system L have been introduced in [30,42]; the first one is called -entropy, written as h .L/, which measures a growth rate of the cardinalities of the vertex sets fVl gl2N . The second one is called the volume entropy, written as hvol .L/; which measures a growth rate of the cardinalities of the sets of labeled paths. Their definitions are as follows: h .L/ D lim sup l!1
1 log ]Vl : l
We denote by Pl .L/ the set of all labeled paths starting at a vertex in V1 and terminating at a vertex in Vl ; and by ] Pl .L/ its cardinality. The volume entropy is defined by the formula: 1 hvol .L/ D lim sup log ]Pl .L/: l!1 l Theorem 6.9.9. Both h .L/ and hvol .L/ are invariant under shift equivalence of -graph systems.
6
Application of Infinite Labeled Graphs to Symbolic Dynamical Systems
165
This implies that they yield topological conjugacy invariants of subshifts. We see that hvol .L/ is given by the topological entropy of a topological dynamical system .L ; XL / associated with the -graph system L [42].
6.10 Example We give examples of the K-groups and the Bowen–Franks groups for a class of certain nonsofic subshifts that include the synchronizing counter shift C defined in Sect. 6.4. Let ˙N be the set of symbols fa1 ; : : : ; aN ; b; cg for a fixed N 2 N. The nonsofic subshift CN is the coded shift over ˙N whose forbidden words are FCN D fai b m c k aj j i; j D 1; : : : ; N with m ¤ kg; m
k ‚…„ƒ ‚…„ƒ where the word ai b c aj means ai b b c c aj : In [45], the C -algebra OCN associated with the subshift CN has been studied so that its K-groups and Bowen– Franks groups that are those of the canonical symbolic matrix system for CN have been calculated. We have m k
Proposition 6.10.1. K0 .CN / D Z=N Z ˚ Z; BF 0 .CN / D Z=N Z;
K1 .CN / D 0 and
BF 1 .CN / D Z:
These types of Bowen–Franks groups cannot be realized in sofic shifts because BF 1 .CN / is not the torsion-free part of BF 0 .CN / (cf. [34]). In [18, 29, 43], the K-groups and the Bowen–Franks groups for ˇ-shifts and the Dyck shifts are calculated.
6.11 Remark: Relation to K-Theory for C -Algebras The author has constructed a C -algebra OL from the -graph system L ([40], cf. [10, 37]). The C -algebra OL has a canonical action ˛ of the one-dimensional torus group T, called gauge action. The fixed point algebra FL of OL under ˛ is an AF-algebra which is stably isomorphic to the cross product OL ˛ T. Let .M; I / be the nonnegative matrix system for L. The invariants studied in this chapter are described in terms of the K-theory for the C -algebra in the following way: ..M;I / ; C O /; .M;I / ; ı.M;I / / D .K0 .FL /; K0 .FL /C ; ˛ Ki .M; I / D Ki .OL /; i C1
BF .M; I / D Ext i
.OL /;
i D 0; 1; i D 0; 1
166
K. Matsumoto
where ˛O denotes the dual action of ˛ and Ext1 .OL / D Ext.OL /; Ext0 .OL / D Ext.OL ˝ C0 .R//. The normalized nonnegative eigenvectors of .M; I / exactly correspond to the KMS-states for ˛ on the C -algebra OL . Hence the set of all bounded spectra with nonnegative eigenvectors is the set of all inverse temperatures for the admitted KMS states [46], cf. [13].
6.12 Conclusions and Further Work As a consequence, we see that infinite labeled graphs called -graph systems yield presentations of symbolic dynamical systems so that several kinds of computable topological conjugacy invariants of symbolic dynamical systems are defined. The invariants are related to invariants of the associated C -algebras. Computations of these invariants for other kinds of symbolic dynamical systems are seen, for example, in [7, 8, 31]. Related works to C -algebras are, for example, [1, 32, 44]. Acknowledgments The author would like to deeply thank Matthias Dehmer and Jun Ichi Fujii for their invitation to the author to write this chapter and for their helpful suggestions in the presentation of this paper.
References 1. Bates T, Pask D (2007) C -algebras of labelled graphs. J Oper Theory 57:207–226 2. Blanchard F, Hansel G (1986) Systems cod´es. Theor Comput Sci 44:17–49 3. Bowen R, Franks J (1977) Homology for zero-dimensional nonwandering sets. Ann Math 106:73–92 4. Boyle M, Krieger W (1988) Almost Markov and shift equivalent sofic systems. In: Proceedings of Maryland special year in dynamics 1986–1987. Lecture Notes in Mathematics, vol 1342. Springer, pp 33–93 5. Bratteli O (1972) Inductive limits of finite-dimensional C -algebras. Trans Am Math Soc 171:195–234 6. Brown LG (1983) The universal coefficient theorem for Ext and quasidiagonality. Operator Algebras and Group Representation, vol 17. Pitmann Press, Boston, pp 60–64 7. Carlsen TM, Eilers S (2004) Matsumoto K-groups associated to certain shift spaces. Doc Math 9:639–671 8. Carlsen TM, Eilers S (2006) K-groups associated to substitutional dynamics. J Funct Anal 238:99–117 9. Chomsky N, Sch¨utzenberger MP (1963) The algebraic theory of context-free languages. In: Braffort P, Hirschberg D (eds) Computer programing and formal systems. North-Holland, Amsterdam, pp 118–161 10. Cuntz J, Krieger W (1980) A class of C -algebras and topological Markov chains. Invent Math 56:251–268 11. Denker M, Grillenberger C, Sigmund K (1976) Ergodic theory on compact spaces. Springer, Berlin, Heidelberg and New York 12. Effros EG (1981) Dimensions and C -algebras. In: AMS-CBMS Reg Conf Ser Math, vol 46. American Mathematical Society, Providence, RI
6
Application of Infinite Labeled Graphs to Symbolic Dynamical Systems
167
13. Enomoto M, Fujii M, Watatani Y (1984) KMS states for gauge action on OA . Math Japon 29:607–619 14. Fischer R (1975) Sofic systems and graphs. Monats f¨ur Math 80:179–186 15. Franks J (1984) Flow equivalence of subshifts of finite type. Ergod Theory Dyn Syst 4:53–66 16. Hamachi T, Nasu M (1988) Topological conjugacy for 1-block factor maps of subshifts and sofic covers. In: Proceedings of Maryland special year in dynamics 1986–1987. Lecture Notes in Mathematics, vol 1342. Springer, pp 251–260 17. Hopcroft JE, Ullman JD (2001) Introduction to automata theory, languages, and computation. Addison-Wesley, Reading, MA 18. Katayama Y, Matsumoto K, Watatani Y (1998) Simple C -algebras arising from ˇ-expansion of real numbers. Ergod Theory Dyn Syst 18:937–962 19. Kim KH, Roush FW (1979) Some results on decidability of shift equivalence. J Combin Inf Syst Sci 4:123–146 20. Kim KH, Roush FW (1999) Williams conjecture is false for irreducible subshifts. Ann Math 149:545–558 21. Kitchens BP (1998) Symbolic dynamics. Springer, Berlin 22. Krieger W (1974) On the uniqueness of the equilibrium state. Math Syst Theory 8:97–104 23. Krieger W (1980) On dimension for a class of homeomorphism groups. Math Ann 252:87–95 24. Krieger W (1980) On dimension functions and topological Markov chains. Invent Math 56:239–250 25. Krieger W (1984) On sofic systems I. Isr J Math 48:305–330 26. Krieger W (1987) On sofic systems II. Isr J Math 60:167–176 27. Krieger W (2000) On subshifts and topological Markov chains. Numbers, Information and Complexity (Bielefeld 1998). Kluwer, Boston, MA, pp 453–472 28. Krieger W, Matsumoto K (2002) Shannon graphs, subshifts and lambda-graph systems. J Math Soc Jpn 54:877–900 29. Krieger W, Matsumoto K (2003) A lambda-graph system for the Dyck shift and its K-groups. Doc Math 8:79–96 30. Krieger W, Matsumoto K (2004) A class of topological conjugacy of subshifts. Ergod Theory Dyn Syst 24:1155–1172 31. Krieger W, Matsumoto K (2010) Subshifts and C -algebras from one-counter codes. Contemporary Math 503(2009):93–120 AMS 32. Kumjian A, Pask D, Raeburn I, Renault J (1997) Graphs, groupoids and Cuntz–Krieger algebras. J Funct Anal 144:505–541 33. Lind D, Marcus B (1995) An introduction to symbolic dynamics and coding. Cambridge University Press, Cambridge 34. Matsumoto K (1999) A simple C -algebra arising from certain subshift. J Oper Theory 42:351–370 35. Matsumoto K (1999) Dimension groups for subshifts and simplicity of the associated C -algebras. J Math Soc Jpn 51:679–698 36. Matsumoto K (1999) Presentations of subshifts and their topological conjugacy invariants. Doc Math 4:285–340 37. Matsumoto K (2000) Stabilized C -algebras constructed from symbolic dynamical systems. Ergod Theor Dyn Syst 20:821–841 38. Matsumoto K (2001) Bowen–Franks groups for subshifts and Ext-groups for C -algebras. K Theor 23:67–104 39. Matsumoto K (2001) Bowen–Franks groups as an invariant for flow equivalence of subshifts. Ergod Theory Dyn Syst 21:1831–1842 40. Matsumoto K (2002) C -algebras associated with presentations of subshifts. Doc Math 7:1–30 41. Matsumoto K (2003) On strong shift equivalence of symbolic matrix systems. Ergod Theory Dyn Syst 23:1551–1574 42. Matsumoto K (2005) Topological entropy in C -algebras associated with -graph systems. Ergod Theor Dyn Syst 25:1935–1951 43. Matsumoto K (2005) K-theoretic invariants and conformal measures on the Dyck shifts. Int J Math 16:213–248
168
K. Matsumoto
44. Matsumoto K (2007) Actions of symbolic dynamical systems on C -algebras. J Reine Angew Math 605:23–49 45. Matsumoto K A class of simple C -algebras arising from certain nonsofic subshifts, to appear in Ergod Theory Dyn Syst, arxiv:0805.2767 46. Matsumoto K, Watatani Y, Yoshida M (1998) KMS-states for gauge actions on C -algebras associated with subshifts. Math Z 228:489–509 47. Nasu M (1986) Topological conjugacy for sofic shifts. Ergod Theory Dyn Syst 6:265–280 48. Nasu M (1995) Textile systems for endomorphisms and automorphisms of the shift. Mem Am Math Soc 114:546 49. Parry W, Sullivan D (1975) A topological invariant for flows on one-dimensional spaces. Topology 14:297–299 50. Tuncel S (1983) A dimension, dimension modules, and Markov chains. Proc Lond Math Soc 46:100–116 51. Weiss B (1973) Subshifts of finite type and sofic systems. Monatsh Math 77:462–474 52. Williams RF (1973) Classification of subshifts of finite type. Ann Math 98:120–153. Erratum (1974) Ann Math 99:380–381
Chapter 7
Decompositions and Factorizations of Complete Graphs Petr Kov´arˇ
Abstract Graph decompositions into isomorphic copies of a given graph are a well-established topic studied in both graph theory and design theory. Although spanning tree factorizations may seem to be just a special case of this concept, not many general results are known. We investigate necessary and sufficient conditions for a graph factorization into isomorphic spanning trees to exist. Keywords Graph decomposition Graph factorization Graph labeling MSC2000: Primary 05C70; Secondary 05C78, 05C05 In this chapter we investigate factorization of complete graphs into isomorphic spanning trees. The main goal is to present a recursive method that generalizes several previously introduced concepts. We start with a detailed overview of known methods. A brief summary of known results on spanning tree factorization of complete graphs follows. In the last part we describe a construction that unifies most of the presented methods in one general labeling called recursive labeling.
7.1 About Graph Decompositions and Factorizations There are several real-life problems that lead to graph decompositions or constructing block designs. One of them – the design of ad hoc wireless networks – is described in Sect. 7.1.1. We proceed by giving a detailed overview of methods used for decompositions and spanning tree factorizations of complete graphs and in later sections we try to generalize them. Thus, this chapter provides a survey of techniques as well as a new result in this area.
P. Kov´arˇ () Department of Applied Mathematics, Technical University Ostrava, 17. listopadu, 708 33 Ostrava–Poruba, Czech Republic e-mail:
[email protected]
M. Dehmer (ed.), Structural Analysis of Complex Networks, c Springer Science+Business Media, LLC 2011 DOI 10.1007/978-0-8176-4789-6 7,
169
170
P. Kov´arˇ
7.1.1 Ad Hoc Wireless Network Design Various difficulties have to be resolved while designing ad hoc networks. After the network structure is changed locally (due to some failure) it can take a long time until this change is absorbed by the network, in particular, by the routing tables. Resolving such a failure by reconnecting nodes within the network may lead to huge diameter or high load for certain nodes in the network structure. Let us concentrate on wireless networks of mobile units of a firefighter department. The firefighters in action communicate with each other and headquarters broadcasts orders to all units. Their wireless networks consist of several mobile units, usually about two dozen with rather low traffic (compared with an Internet network) and with a limited number of stationary units. Each unit can communicate with every other unit but some pairs may temporarily lose connection since the firefighters are moving in the terrain. It is crucial to restore connections quickly, since blackouts can jeopardize the operation and firefighters’ lives. We want both to quickly restore connectivity and keep appropriate network parameters: a low number of hops (small diameter, usually 3–10) and balance (low highest degree, up to 20). Each unit has its unique ID and responds only to this particular ID. Every unit operates as receiver, transmitter, and router to receive messages from one unit and forward it to another unit. Routing is maintained by the units itself. Reformulating this problem as a graph theory problem we require network designs that are connected and do not contain circuits. The set of all possible connections forms a complete graph. Each particular network forms a spanning tree in this complete graph. We present a method of decomposing a complete graph into spanning trees that are all isomorphic to the same structure. We obtain a collection of isomorphic factors (network structures), forming a pool of networks, all with the same diameter and the same highest degree. Moreover, all pairs of networks are edge disjoint, thus if one particular connection fails, no other factor from the pool will be affected by this failure. Instead of repairing one broken connection we swap to an entirely alternate network. The list of networks can be hard-coded with the software on the units. In case of lost connection a broadcast message from the two separated units can resolve the problem immediately by switching to one of the backup networks. Once removed, a network structure can be put back into the list. We expect the missing connection to restore in time.
7.1.2 Description of the Graph Theory Problem We are given a graph representing a network or a set of relations on n elements. Performing an operation on this net, one may want to parallelize or simply split one complex task into several smaller tasks. This immediately translates into decomposing the given graph into subgraphs. Each edge of the original graph is to appear in exactly one subgraph.
7
Decompositions and Factorizations of Complete Graphs
171
There may be further requirements put on the decomposition. It is natural to assume that all smaller graphs are not “too big,” that they have the same number of vertices and edges, or that the diameter is bounded, or that they are all isomorphic. Further, one may require that all smaller subgraphs are spanning; i.e., each of them is connected is contains all vertices of the original graph. The main scope of this chapter is decompositions of complete graphs into small acyclic isomorphic spanning graphs: isomorphic spanning trees. Decompositions of complete graphs are the subject of studies in both design theory and graph theory. Since design theory methods are suitable mainly for problems of decomposition into highly symmetric graphs (e.g., vertex transitive graphs such as complete graph, cycles or multipartite graphs [1, 6]) and we examine decomposition into trees (nonregular graphs) the methods discussed further in this chapter are based almost exclusively on graph theory. We use standard terminology that can be found in any textbook (see [35] or [7]). All graphs are finite and simple (without loops or multiple edges). A graph G is a pair .V; E/, where the set of vertices V (often denoted by V .G/) is nonempty and the set of edges E (or E.G/) is a subset of P2 .V /, the set of all two-element subsets of V . Definition 1. Let H be a graph on n vertices. A decomposition of the graph H is a set of pairwise edge disjoint subgraphs G1 ; G2 ; : : : ; Gs of H such that every edge of H belongs to exactly one of the subgraphs Gr . If each subgraph Gr is isomorphic to a graph G we speak about a G-decomposition of H . If G is a connected factor of H , then we call the G-decomposition a G-factorization.
7.1.3 Necessary Conditions for Decompositions There are some obvious and some less obvious necessary conditions for a G-decomposition of a given graph H . It is easy to see that the number of edges jE.G/j has to divide the number of edges jE.H /j since each edge of the graph H belongs to one copy of G. Moreover there are restrictions on the degree sequence of G. If k D jE.H /j=jE.G/j is the number of copies of G in H , then the multiset D in which the degree of every vertex of G appears exactly k times has to be decomposable into multisets Di , i D 1; 2; : : : ; jV .G/j, such that the sum of degrees in each Di corresponds to the degree of a vertex wi 2 V .H /. If H is r-regular this condition is simpler, the sum of elements in each Di has to be r. In particular, if H is a complete graph Kn , then the sum of elements in each Di has to be n 1. Example 1. We show that the graph H ' Kr can be decomposed into G ' K4 only if r 1 .mod 12/. The number of edges r.r 1/=2 has to be divisible by 6,
172
P. Kov´arˇ
thus r 0; 1 .mod 12/. Moreover the degree 3 of every vertex in K4 has to divide r 1, thus r 1 .mod 3/. Combining these conditions, the claim follows. Example 2. Let t be an integer. The complete graph K2t cannot be decomposed into cycles nor any even regular graphs, since it is odd-regular. On the other hand there are also structural limitations that apply to the existence of a G-decomposition of H . A caterpillar is a tree such that by removing all leaves we obtain a path. Although the graphs R1 and R2 in Fig. 7.1 have the same number of edges and the same degree sequence, the caterpillar R1 does and the caterpillar R2 does not decompose the complete graph K6 (for a small graph a brute force search can be performed; a general nonexistence result addressing certain caterpillars with diameter four is presented in [14]). The structural restrictions depend strongly on the particular class of graphs and are difficult to explore in general. Therefore such structural necessary conditions are known almost exclusively for highly symmetric graphs, such as vertex transitive graphs, and only sparsely for trees. Some results are presented in Sect. 7.3. Definition 2. We say a G-decomposition of a graph H on 2n C 1 vertices into G0 ; G1 ; : : : ; G2n is cyclic if there exists an ordering .x0 ; x1 ; : : : ; x2n / of vertices of H and isomorphisms i W G1 ! Gi ; i D 0; 1; : : : ; 2n such that i .xj / D xi Cj for every j D 0; 1; : : : ; 2n, where the subscripts are taken modulo 2n C 1. Example 3. In Fig. 7.2 is shown the factor G1 of a cyclic C3 -decomposition of K7 . The next six subgraphs are obtained by isomorphisms “rotating” the graph G1 clockwise. If we have a graph G with m edges and we are looking for a cyclic Gdecomposition of some Kn there have to be n copies of G in Kn . The number of edges in nG (n copies of G) has to divide jE.Kn /j, nmjn.n 1/=2 thus n D mk C 1 for some positive integer k.
Fig. 7.1 Caterpillars R1 and R2
7x
Fig. 7.2 Cyclic C3 -decomposition of K7
7
Decompositions and Factorizations of Complete Graphs
173
7.1.4 Sufficient Conditions for Decompositions There is no necessary and sufficient condition known for a graph G to decompose a graph H in general, not even in the case when H is a complete graph and G is arbitrary. Only for some classes of graph G was the sufficiency settled. Now let us restrict only to the problem when H ' Kn for some integer n. There are only a few sufficient conditions for a G-decomposition of a complete graph to exist. They include both design theory and graph theory techniques. Here we focus on the latter ones since only these also apply to the factorizations in Sect. 7.1.6. The problem of the existence of a G-decomposition of a complete graph is transformed into the existence of a certain labeling of a given graph G. To describe the methods of decompositions using a graph labeling we have to introduce some terms. We denote the vertices of the complete graph Kn by v1 ; v2 ; : : : ; vn . The length of an edge vi vj is the smaller “distance” between vi and vj along the cycle v1 ; v2 ; : : : ; vn . It can be counted by taking the smaller value of jj i j and njj i j. This notion can also be extended to graphs that are labeled by the first n positive integers. In general, a graph labeling is a mapping that assigns integers (usually positive) to graph elements: vertices, edges, or both. Hence the following definition. Definition 3. Let G be a graph with m edges and the vertex set V .G/ and let be an injection W V .G/ ! S where S is a subset of the set f0; 1; 2; : : : ; 2mg. The length of an edge xy is defined as `.x; y/ D minfj.x/ .y/j; 2m C 1 j.x/ .y/jg. The set of vertex labels is denoted by .V .G//. Additional requirements are put on the labelings to guarantee that in a Gdecomposition of Kn each edge appears in precisely one copy of G. In 1967 Rosa (see [31]) defined the ˛-, ˇ-, -, and -valuations depending on which of the following conditions of a vertex labeling of a graph G with m edges are satisfied: (a) (b) (c) (d) (e)
the set of vertex labels .V .G// f0; 1; : : : ; mg the set of vertex labels .V .G// f0; 1; : : : ; 2mg the set fj.x/ .y/jW xy 2 E.G/g D f1; 2; : : : ; mg the set of edge lengths f`.x; y/W xy 2 E.G/g D f1; 2; : : : ; mg there exists a 2 f0; 1; : : : ; mg, such that for all xy 2 E.G/ either .x/ a < .y/ or .x/ > a .y/
If the labeling satisfies
(a), (c), (e), then it is an ˛-valuation (a), (d), then it is a ˇ-valuation (b), (c), then it is a -valuation (b), (d), then it is a -valuation
The hierarchy of the valuations is ˛-, ˇ-, -, and -valuation which means that if G allows a certain valuation in the list, it also allows any latter one. Since 1967 hundreds of papers have been published extending the list of graphs known to allow some of these valuations. See Gallian [17] for an excellent survey updated every
174
P. Kov´arˇ
year. Through the years the names ˛-labeling, -labeling, and graceful labeling for the ˇ-valuation (see Golomb [18]) became more popular. The importance of the valuations for decompositions is apparent from the following paragraphs. In the next paragraphs several other labelings are defined. There are plenty of definitions, some of them rather technical, that are used for spanning tree factorizations of complete graphs. Later, in Sect. 7.4 we try to find a general labeling that extends features of most of the labelings described here. Therefore the techniques are explained in detail. ˛-Labeling It is easy to observe that when a graph G allows an ˛-labeling then it has to be bipartite. In [31] Rosa proved the following sufficient condition for the existence of cyclic decompositions. Theorem 1. If a graph G with m edges has an ˛-labeling, then there exists a cyclic G-decomposition of the complete graph K2kmC1 , where k is any natural number. We accept the following convention: if convenient the vertex name is unified with its label. For example, instead of saying “the vertex x labeled i ” we say “the vertex i ” and vice versa. Example 4. In Fig. 7.3 is shown an example of an ˛-labeling. Notice that evaluating the edge lengths we get all consecutive integers 1; 2; : : : ; 5. Moreover, taking a D 3 for every edge xy is either x 3 and y > 3 or x > 3 and y 3. It should be pointed out that not all decompositions are necessarily cyclic as shown by the next example. Example 5. K9 can be decomposed into triangles C3 (a Steiner triple system), but since there are 12 of them, this decomposition cannot be cyclic. Moreover, for K2t no cyclic spanning tree decomposition into trees with t edges can exist, since there would have to be 2t 1 of the copies, not 2t. On the other hand, there are trees that have no ˛-labeling (see [2]), hence the property of being bipartite is not a sufficient condition for an ˛-labeling to exist. 5
1
4 4
Fig. 7.3 ˛-Labeling of a graph G and a bipartite drawing of G
3 3
5
1 2
2
a
7
Decompositions and Factorizations of Complete Graphs
175
Fig. 7.4 -Labeling of R1 and its drawing as a subgraph in K11
0
10
9
1
9
2
8
3 7
0
5
1
3
2
4 6
5
ˇ-, -, and -Labelings Surprisingly most attention was devoted to graceful labelings (ˇ-valuation) although it is the -labeling that is the most general labeling sufficient for the existence of a G-decomposition of a complete graph. In [31] Rosa proved the following necessary and sufficient condition Theorem 2. Let G be a graph with m edges. A cyclic G-decomposition of the complete graph K2mC1 exists if and only if G has a -labeling. The research in graceful labelings has been intensive during the past four decades; see [17]. Example 6. There is an example of a -labeling of R1 given in Fig. 7.4. Notice that evaluating the edge lengths we get all consecutive integers 1; 2; : : : ; 5. This is easy to check in the same figure where R1 is drawn as a subgraph G1 in K11 .
7.1.5 Necessary Conditions for Factorizations Recall that the main scope of this chapter is factorization of complete graphs. Since G-factorizations are a special case of G-decompositions, then besides the necessary conditions given in Sect. 7.1.3 more restrictions apply. For a G-factorization of Kn to exist, all the multisets Di (defined on page 171) have to be of the same size, namely k where k is the number of factors isomorphic to G in Kn . Moreover, since the degree of every vertex x in each factor Gi has to be at least one, the largest degree .G/ has to be at most n k. We call this the degree condition. Let T be a spanning tree of Kn . Thus T is a tree on n vertices (and m D n 1 edges) and since ! 1 n jE.Kn /j D D n.n 1/ 2 2 it follows that n has to be even, say n D 2t, and there have to be exactly n=2 D t factors in a T -factorization of K2t and the largest degree .T / D nk D 2t t D t. Example 7. No star K1;n1 can factorize the complete graph Kn due to the degree condition. A double-star is a tree with only two vertices of degree t greater than 1
176
3
+
Fig. 7.5 A double-star factorizing K6
P. Kov´arˇ
(called nonleaves). A double-star satisfies the degree condition for factorizing K2t and it can easily be observed that it actually does decompose K2t for every t 2. See Fig. 7.5. Let G be a graph with m edges and m C 1 vertices, with possibly some of them isolated. Since we are factorizing the complete graph (on m C 1 vertices) into isomorphic copies of G it follows that the order of the complete graph has to be even.
7.1.6 Sufficient Conditions for Factorizations In comparison to decompositions, factorizations remained fairly unexplored. All methods known for spanning tree factorizations are based on graph labelings, save for the trivial Hamiltonian path or double-star factorizations. The methods include -symmetric labeling, blended -labeling, swapping labeling, 2n-cyclic blended labeling, and fixing labeling. We describe these in the following paragraphs. To present clearly the idea of our main result in Sect. 7.4 we try to keep a general point of view by stressing the important facts and skipping some details. Then in Sect. 7.4 we combine these methods. We start with a definition. Definition 4. A G-decomposition of a graph H on 2n vertices into G1 ; G2 ; : : : ; Gs is bicyclic if there exists an ordering .x0 ; x1 ; : : : ; xn1 ; y0 ; y1 ; : : : ; yn1 / of vertices of H and isomorphisms i W G1 ! Gi ; i D 1; 2; : : : ; s such that i .xj / D xj Ci 1 and i .yj / D yj Ci 1 for every j D 0; 1; : : : ; n 1, where the subscripts are taken modulo n.
Factorizing Regular Complete Bipartite Graphs For factorization of regular complete bipartite graphs Kn;n Fronˇcek introduced the bipartite -labeling; see [12]. Although we are factorizing complete graphs, the notion of a, bipartite -labeling is used in most of the subsequent labelings and plays an important role in Sect. 7.4. We give the definition here. Definition 5. Let G be a bipartite graph with n edges and the vertex set V .G/ D V0 [ V1 . Let be an injection W Vi ! Si , where Si is a subset of the set f0i ; 1i ; : : : ; .n 1/i g, i D 0; 1. The length of an edge .x0 ; y1 / for x0 2 V0 and
7
Decompositions and Factorizations of Complete Graphs
177
y1 2 V1 with .x0 / D a0 and .y1 / D b1 is defined as `01 .x0 ; y1 / D b a .mod n/. If the set of all lengths of n edges is equal to f0; 1; 2; : : : ; n 1g, then is a bipartite -labeling. It was shown in [12] that the existence of a bipartite -labeling of a graph G implies a bicyclic decomposition of the complete graph Kn;n . Theorem 3. Let a bipartite graph G with n edges have a bipartite -labeling. Then there exists a bicyclic decomposition of Kn;n into n copies of G. This idea plays an important role for all the blended, swapping, 2n-cyclic blended, and fixing labelings. -Symmetric Labeling A connected graph G with an edge .x; y/ (called a bridge) is symmetric if there is an automorphism of G such that .x/ D y and .y/ D x. The isomorphic components of G .x; y/ are called banks and denoted by H; H 0 , respectively. See Fig. 7.6. Definition 6. A labeling of a symmetric graph G with 2n 1 edges and banks H , H 0 is -symmetric graceful if H has a -labeling and .i / D i C n .mod 2n/ for each vertex i in H . A graph that admits a -symmetric graceful labeling is called -symmetric graceful. This concept was introduced by Eldergill in [8]. The following theorem (proven in [8]) shows how this applies to spanning tree factorizations. Theorem 4. Let G be a symmetric graph with 2n 1 edges. Then there exists a cyclic G-decomposition of K2n if and only if G is -symmetric graceful. If G is an acyclic graph, it is a spanning tree of K2n . Thus a symmetric tree on 2n vertices that allows a -symmetric graceful labeling factorizes the complete graph K2n . The requirement for a tree to be symmetric is too restrictive as we show in the next paragraph. Example 8. In Fig. 7.6 is a symmetric graph with a -symmetric graceful labeling drawn as a subgraph of K10 .
9
Fig. 7.6 Symmetric graph with a -symmetric graceful labeling
0
1
8
2
7
3 6
5
4
178
P. Kov´arˇ
Blended -Labeling Blended -labeling (or blended labeling for short) was introduced by Fronˇcek [12] as a generalization of the -symmetric graceful labeling. Definition 7. Let G be a graph with V .G/ D V0 [ V1 , V0 \ V1 D ;, and jV0 j D jV1 j D r. Let be an injection, W Vi ! f0i ; 1i ; : : : ; .r 1/i g, i D 0; 1. The pure length of an edge .xi ; yi / with xi ; yi 2 Vi , where i 2 f0; 1g, for .xi / D pi and .yi / D qi is defined as `i i .xi ; yi / D minfp q
.mod r/; q p
.mod r/g:
The mixed length of an edge .x0 ; y1 / with x0 2 V0 , y1 2 V1 , for .x0 / D p0 and .y1 / D q1 , is defined as `01 .x0 ; y1 / D q p
.mod r/;
where p; q 2 f0; 1; : : : ; r 1g are the vertex labels without subscripts. The edges .xi ; yi / for i D 0; 1 with the pure length `i i are called pure edges and the edges .x0 ; y1 / with the mixed length `01 are called mixed edges. This concept of lengths can be extended to any equal-sized partite set V 0 ; V1 ; : : : ; Vk . Definition 8. Let G be a graph with 4n C 1 edges, V .G/ D V0 [ V1 , V0 \ V1 D ;, and jV0 j D jV1 j D 2n C 1. Let be an injection, W Vi ! f0i ; 1i ; : : : ; .2n/i g, i D 0; 1 and let the lengths be as defined in Definition 7. We say G has a blended -labeling if (1) f`i i .xi ; yi /W .xi ; yi / 2 E.G/g D f1; 2; : : : ; ng for i D 0; 1 (2) f`01 .x0 ; y1 /W .x0 ; y1 / 2 E.G/g D f0; 1; : : : ; 2ng Notice that in comparison to Definition 6 the requirement for T to be symmetric is lifted. However, there is a restriction on the order of G to be 2 modulo 4. The vertex set of the graph G with a blended labeling is decomposed into two equal-sized partite sets V0 , V1 and G can be split into three subgraphs as follows: two subgraphs H0 , H1 induced on the vertices of V0 , V1 , respectively, and a bipartite graph H01 with partite sets V0 , V1 . The blended labeling restricted to the subgraphs H0 , H1 can be viewed as a -labeling (after having omitted the subscripts). Each of them guarantees a cyclic decomposition of a graph K2nC1 into n copies of H0 or H1 , respectively. The labeling of the subgraph H01 is then a bipartite -labeling that allows a bicyclic decomposition of K2nC1;2nC1 into 2n C 1 isomorphic copies of H01 . Hence the following theorem (for a proof see [12]). Theorem 5. Let G with 4n C 1 edges have a blended -labeling. Then there exists a bicyclic decomposition of K4nC2 into 2n C 1 copies of G. Example 9. An example of a blended labeling of R1 is shown in Fig. 7.7.
7
Decompositions and Factorizations of Complete Graphs
Fig. 7.7 Blended labeling of caterpillar R1
179 00
01
10
11
20
21
In a blended labeling all vertices in the “left” partite set V0 are always 00 ; 10 ; : : : ; .2n 1/0 and in the “right” partite set V1 always 01 ; 11 ; : : : ; .2n 1/1 . Therefore we can omit the labels in the figures.
Swapping Labeling Swapping labeling was introduced by Kov´aˇrov´a in her Ph.D. thesis [22]. Unlike blended labeling this labeling guarantees the factorization of complete graphs of order 0 modulo 4. For a proof see [22]. Definition 9. A graph G with 4n1 edges has a swapping blended labeling (briefly swapping labeling) if the following is satisfied. The vertex set V .G/ D V0 [ V1 , V0 \ V1 D ;, and jV0 j D jV1 j D 2n. Let be an injection, W Vi ! f0i ; 1i ; : : : ; .2n 1/i g for i D 0; 1. Suppose the lengths are defined as in Definition 7, then (1) f`i i .xi ; yi /W .xi ; yi / 2 E.G/g D f1; 2; : : : ; ng, for i D 0; 1, (2) there exists an isomorphism ' such that G is isomorphic to G 0 , where V .G 0 / D V .G/ and E.G 0 / D E.G/ n f.k0 ; .k C n/0 /; .l1 ; .l C n/1 /g[ f.k0 ; .l C n/1 /; ..k C n/0 ; l1 /g, (3) f`01 .x0 ; y1 /W .x0 ; y1 / 2 E.G/g D f0; 1; : : : ; 2n 1g n f`01 .k0 ; .l C n/1 /g. Again the vertex set of G with a swapping labeling can be split into three subgraphs: H0 and H1 induced on V0 and V1 , respectively, and a bipartite subgraph H01 with the partite sets V0 and V1 . The labelings of H0 and H1 induced by have all different pure lengths (Condition (1)). The labeling of H01 induced by gives edges of almost all different mixed lengths. Edges of mixed length `01 .k0 ; .l C n/1 / D l C n k .mod 2n/ are missing (Condition (3)) among the first n=2 factors. In the next n=2 factors the longest pure edges are removed from the graphs H0 , H1 and edges of mixed length `01 .k0 ; .l C n/1 / are added to the bipartite graph H01 . Theorem 6. Let G be a graph on 4n vertices with 4n1 edges that has a swapping blended labeling. Then there exists a G-decomposition of K4n into 2n isomorphic copies of G. If G is a spanning tree in K4n with a swapping labeling then by Theorem 6 it factorizes K4n .
180
P. Kov´arˇ
Fig. 7.8 Caterpillar R3 and a swapping labeling of R3
Fig. 7.9 R3 -factorization of K8 based on the swapping labeling
Example 10. The caterpillar R3 in Fig. 7.8 allows a swapping labeling. Figure 7.9 shows the four factors of K8 given by this labeling. Again we omit the vertex labels, since they are implied by the drawing. The switching labeling defined by Fronˇcek and Kubesa in [16] also allows factorizations of K4n into isomorphic spanning trees. In comparison to swapping labeling switching labeling is more restrictive since it requires certain strong automorphisms that exist only for very special classes of trees. 2 n-Cyclic Labeling So far the vertex set of G (as well as K2n ) was decomposed into two sets of size n. For -symmetric labeling there is a strong automorphism required and for blended labeling n has to be odd, for the swapping labeling n has to be even. Kov´aˇrov´a in [22] approached the problem of factorizations of complete graphs into trees with a given diameter by decomposing the vertex set into 2n partite sets Vi of size k. This technique is designed for factorizations into “less dense” graphs with higher diameter. Hence the following definitions. Definition 10. A tree T is called an underlying tree of U if the graph U arises from the tree T by blowing up two vertices r, s of T by Kk and all the remaining vertices by K k D kK1 . Every edge of the tree is replaced by the edges of Kk;k . Definition 11. Let G beSa graph with 2nk 1 edges, for k odd and k; n > 1, and the vertex set V .G/ D i2n1 D0 Vi , where jVi j D k and Vi \ Vj D ; for i 6D j . Let be an injection, W Vi ! f0i ; 1i ; 2i ; : : : ; .k 1/i g, for i D 0; 1; : : : ; 2n 1.
7
Decompositions and Factorizations of Complete Graphs
181
By Hij we denote the bipartite subgraph of G induced on the vertices of the partite sets Vi and Vj with edges of mixed length `ij , and by Hi we denote the subgraph of G induced on the vertices of Vi with edges of pure length `i i . We say that G has a 2n-cyclic blended labeling (2n-cyclic labeling for short) if there exists an underlying tree T on 2n vertices with a -symmetric graceful labeling such that the following hold: (1) For some vertex s 2 T and its symmetric image t D s C n .mod 2n/ we have f`ss .xs ; ys /W .xs ; ys / 2 E.Hs /g D f1; 2; : : : ; .k 1/=2g; and f`t t .xt ; yt /W .xt ; yt / 2 E.Ht /g D f1; 2; : : : ; .k 1/=2g; (2) and for each edge .i; j / 2 E.T / we have f`ij .xi ; yj /W .xi ; yj / 2 E.Hij /g D f0; 1; 2; : : : ; k 1g: Notice that after omitting subscripts the labelings induced on Hs and Ht are -labelings and the labelings induced on all bipartite graphs Hij are bipartite labelings. In [13] the following theorem is proven. Theorem 7. Let G with 2nk 1 edges be a graph that allows a 2n-cyclic blended labeling for k odd and k; n > 1. Then there exists a G-decomposition of K2nk into nk copies of G.
Fixing Labeling By relaxing the condition of having a bipartite -labeling in each Hij (as introduced in the previous paragraph) and requiring that all vertices in one of the partite sets, say Vi , are always of degree one, we obtain fixing labeling as it was introduced by Kov´aˇrov´a in [21]; see Fig. 7.10. Therefore fixing labeling is more general than 2n-cyclic labeling. Definition 12. Let S G be a graph with 2nk 1 edges, for k odd and k; n > 1, and vertex set V .G/ D i2n1 D0 Vi , where jVi j D k and Vi \ Vj D ; for i 6D j . Let be
rotated vertex fixed vertex
Fig. 7.10 Factorizing K5;5 by fixing labeling
182
P. Kov´arˇ
an injection, W Vi ! f0i ; 1i ; 2i ; : : : ; .k 1/i g, for i D 0; 1; : : : ; 2n 1. By Hij we denote the bipartite subgraph of G induced on the vertices of the partite sets Vi and Vj with edges of the mixed length `ij , and by Hi we denote the subgraph of G induced on the vertices of Vi with edges of the pure length `i i . We say that G has a fixing labeling if there exists an underlying tree T on 2n vertices with a -symmetric graceful labeling such that the following hold: (1) For some vertex s 2 T and its symmetric image t D s C n .mod 2n/ we have f`ss .xs ; ys /W .xs ; ys / 2 E.Hs /g D f1; 2; : : : ; .k 1/=2g; and f`t t .xt ; yt /W .xt ; yt / 2 E.Ht /g D f1; 2; : : : ; .k 1/=2g: (2) Let F D fi 2 T W i 6D s; i 6D s C n I deg.xi / D 1 for each xi 2 Hij and j 2 N.i /g, then F is the set of fixable vertices in T for given G, and each vertex i in F is called fixable. Let VF be any independent set of fixable vertices in T called the fixed set. A vertex i 2 VF is called a fixed vertex. Then for every edge .i; j / 2 E.T / i or j is one of the fixed end-vertices or f`ij .xi ; yj /W .xi ; yj / 2 E.Hij /g D f0; 1; 2; : : : ; k 1g: Notice that if neither i nor j is a fixed vertex then the labeling of Hij induced by is a bipartite -labeling. Fixing labeling has been used in several papers (see Sect. 7.3) for spanning tree factorizations of complete graphs based on the next theorem proved in [21]. Theorem 8. Let a graph G with 2nk 1 edges, for k odd and k; n > 1, have a fixing blended labeling. Then there exists a G-decomposition of K2nk into nk copies of G. Example 11. In Fig. 7.11 is shown a symmetric tree T on 10 vertices with a symmetric -labeling (T factorizes K10 ). Fixable vertices and fixed vertices are highlighted in Fig. 7.12. In Fig. 7.13 is a tree on 30 vertices that allows a fixing labeling. By adopting the convention, that the “level” i , 0 i 2, stands for the vertex label and the partite set subscript stands for the label subscript, the labeling is implied by the drawing in Fig. 7.13. Both 2n-cyclic labeling and fixing labeling require the underlying tree to be symmetric and the number of vertices in each partite set Vi to be equal to the same odd number. The second restriction can be relaxed; see Sect. 7.2. 4
1 5
Fig. 7.11 Underlying tree T with a symmetric -labeling
2
3
6
9
8
7
0
7
Decompositions and Factorizations of Complete Graphs
Fig. 7.12 Fixable and fixed vertices in T
183
fixable vertex fixed vertex
Fig. 7.13 Example of a fixing labeling of a tree on 30 vertices
7.2 Advanced Methods There is no necessary and sufficient condition for a T -factorization of a complete graph. Besides constructing additional classes of trees that factorize a complete graph it is natural to give a necessary condition for certain classes of trees. We say that a class of trees is classified if for each tree Tn in this class we know whether it factorizes the corresponding complete graph Kn (by labeling the tree) or it is shown that it cannot factorize Kn (such as paths or symmetric trees mentioned in Sect. 7.1.6). To achieve this classification more elaborate techniques are often needed. We present them here.
7.2.1 N-Z Construction In [14] a recursive construction was used to obtain a classification of all caterpillars of diameter 5. This technique is based on factorizing K2n into highly regular graphs and each of them further factorizing into a tree T . Here we give a short introduction to the method. Definition 13. Let G1 ; G2 ; : : : ; Gn be a G-factorization of K2n induced by the isomorphisms j ; Gj D j .G/ for j D 1; 2; : : : ; n. We call a vertex v semisurjective if there exists a partition V0 , V1 , jV0 j D jV1 j D n, of the vertex set V .K2n / such that either fj .v/W j D 1; 2; : : : ; ng D V0 or V1 . We call the G-factorization of K2n semisurjective if every vertex of G is semisurjective and the G-factorization is called weakly semisurjective if every nonleaf vertex of G is semisurjective. Observe that if G has a blended labeling, then the G-factorization is semisurjective. This follows from the fact that the factorization is bicyclic. Fixing labeling of G gives in general a weakly semisurjective G-factorization. None of the above is
184
P. Kov´arˇ
true in general for swapping labeling, but for certain graphs it is possible to obtain swapping labelings that give weakly semisurjective factorizations. The main idea is to reduce the graph G 0 (a caterpillar or a lobster; see [14,15]) on 2n C 2m vertices into two smaller graphs, one on 2n vertices and the second on 2m vertices, usually both with the same diameter. Let us focus on the first possibility reducing G 0 to G on 2n vertices; the second is done analogously. In the reduction we remove 2m leaves v1 ; v2 ; : : : ; vm and u1 ; u2 ; : : : ; um to obtain a graph on 2n vertices. Suppose we have a semisurjective (or weakly semisurjective) G-factorization of K2n with vertex partition V0 ; V1 , both Vi of size n. Having all the vertices v1 ; v2 ; : : : ; vm in G 0 adjacent to vertices of V0 and all the vertices u1 ; u2 ; : : : ; um adjacent to vertices in V1 we have reduced G 0 to G. To achieve this reduction in general, we define the following. Definition 14. Let N be the graph obtained from P4 with vertices y0 ; x0 ; x1 ; y1 and edges y0 x0 ; x0 x1 ; x1 y1 by blowing up the inner vertices x0 ; x1 by Kn the endvertices y0 ; y1 by K m D mK1 . The edge x0 x1 of P4 is replaced by Kn;n and the edges y0 x0 ; x1 y1 of P4 are replaced by the edges of Km;n and Kn;m , respectively. The vertex set of N is then V .N / D Y0 [ X0 [ X1 [ Y1 , where jX0 j D jX1 j D n, jY0 j D jY1 j D m, and jV .N /j D 2n C 2m. Similarly let Z be the graph obtained from P40 with vertices x0 ; y1 ; y0 ; x1 and edges x0 y1 ; y1 y0 ; y0 x1 by blowing up the inner vertices y0 ; y1 of P40 by Km and the end-vertices x0 ; x1 by K n D nK1 . The edge y1 y0 of P40 is replaced by Km;m and the edges x0 y1 ; y0 x1 of P40 are replaced by the edges of Kn;m and Km;n , respectively. The vertex set of Z is then the same as the vertex set of N , V .Z/ D V .N /. It is easy to observe that the graphs N and Z factorize the complete graph K2nC2m into factors N and Z which may or may not be isomorphic (depending on whether m D n); see Fig. 7.14. We omit the proof. Lemma 1. If a graph G decomposes both graphs N and Z then G decomposes the complete graph K2nC2m . Each of the graphs N and Z can be further factorized into isomorphic factors. The reduction is indeed the key step in a recursive method described in detail in [14]. The inductive step is based on m, therefore we try to keep m as small as possible. To prove the base for the induction a long list of graphs, called starting cases, of relatively small size up to a certain value had to be shown to factorize (weakly) semisurjectively the corresponding complete graph. This required a rather elaborate approach; see [14, 15].
7.2.2 Limitations The use of the method for a G-factorization of complete graphs described in Sect. 7.2.1 is limited. The inductive step goes either by m or by n and naturally
7
Decompositions and Factorizations of Complete Graphs X0
x0
P4
y0
N
185 X1
Y0
Y1
y1
x1 X0
x0
P⬘4
y0
X1 Y1
Z
Y0
y1
x1
Fig. 7.14 Graphs N and Z for n D 5 and m D 3
we choose the smaller value, say m. Depending on the examined class of graphs the list of starting cases can already be, for m D 3 or m D 5, considerably long. For each of these graphs a labeling that guarantees factorization has to be found. Various labelings have to be used for various base graphs; the choice of labeling depends on the parity of n. In Sect. 7.4 we try to propose a unified and a more general approach. Moreover, the recursion described in Sect. 7.2.1 strongly depends on the structure of the graphs N and Z. They are both of diameter 3; this may be a restriction on the structure of G.
7.3 Overview of Known Results Among all graph factorizations we focus on spanning tree factorizations of complete graphs. For other classes of graphs we refer to [3, 6].
7.3.1 Trees The decomposition of complete graphs has attracted attention for more than four decades. This research was definitely inspired by the famous conjecture by Ringel in 1963 saying that every tree with m edges decomposes the complete graph K2mC1 . Kotzig extended this conjecture saying that all trees are graceful; see, e.g., [35]. For an up-to-date survey of results on graceful and -labelings see [17].
186
P. Kov´arˇ
In this chapter we focus not on tree-decompositions in general, but on the special case of tree-factorizations. Decompositions into smaller trees or spanning trees of small diameters but not necessarily isomorphic were examined in [4, 5, 30]. In contrary to the search for graceful labelings of graphs the area of spanning tree factorization remained fairly unexplored, save the well-known Hamiltonian path factorization and the factorization into symmetric double-stars. In 1997, Eldergill [8] in his masters thesis, gave a necessary and sufficient condition for the existence of a cyclic factorization of K2n into symmetric spanning trees (for a definition see page 177). He introduced -symmetric graceful labelings and symmetric graceful labelings and classified all trees of order 10. Another step was made by Fronˇcek [10,12], who introduced blended -labelings. By the method of blended -labelings he found a wider class of trees on 4n C 2 vertices that factorize the corresponding complete graph. In [16] the switching blended labeling was introduced for factorizations of complete graphs on 4n vertices by Fronˇcek and Kubesa. Both switching blended labeling and -symmetric graceful labeling require strong types of automorphisms of the factorizing graph. This narrows down the class of permissible trees. More special classes of spanning trees were shown to factorize K4nC2 in [10,25] using the methods mentioned above. A spanning tree of any diameter that factorizes K4nC2 was found by Fronˇcek in [12]. This result was completed in 2004 for K4n by Kov´aˇrov´a in [20]. Among the most general results so far is the classification of caterpillars with diameter 4 (in a series of papers by Fronˇcek [11], Kubesa [24, 25]) that was completed later by Kov´aˇrov´a [21, 22]. The classification of caterpillars of diameter 5 was proved through the years in a series of papers by Kubesa [23, 24, 26–28] and finally completed in [14] by Fronˇcek et al. The constructions of labelings of caterpillars with diameter 5 become technical; many subclasses need to be considered separately. During the years 2002–2004 the methods (graph labelings) evolved. Fronˇcek and Kov´aˇrov´a defined the 2n-cyclic labeling (in [13]), then Kov´aˇrov´a defined fixing labeling (in [21]) and swapping labeling (in [22]) to cover the various cases. The classification of all trees with at most four nonleaf vertices was completed in [15]. Vetr´ık in [34] found some caterpillars of diameter 6 that factorize the corresponding complete graph. The classification of caterpillars for diameters 3, 4, 5 and lobsters with four nonleaf vertices is complete since structural necessary conditions were proven by Fronˇcek in [11] and by Fronˇcek et al. in [15]. For example, for the trees with at most four nonleaf the following was shown in [15]. Theorem 9. Let T be any tree with exactly four nonleaf vertices v1 , v2 , v3 and v4 such that deg.v1 / deg.v2 / deg.v3 / deg.v4 / 2. If T factorizes K2n then (i) either deg.v1 / D n and deg.v2 / C deg.v3 / C deg.v4 / D n C 2, (ii) or deg.v1 / C deg.v4 / D deg.v2 / C deg.v3 / D n C 1. The problem of spanning tree factorization of complete bipartite graphs Km;n was positively answered by Shibata and Seki in [32] and independently by El-Zanati
7
Decompositions and Factorizations of Complete Graphs
187
and Vanden Eynden in [9]. For all positive integers m; n, where m C n 1 divides mn, there exists a spanning tree factorization of Km;n . The general problem of finding a factorization for a given spanning tree remains far from being solved.
7.3.2 Disproof of Kubesa’s Conjecture Suppose there exists a T -factorization of K2n . The observation that for symmetric graceful labeling, blended labeling, swapping labeling, and fixing labeling in general and for any known example it was always possible to split the vertex set of T into two equal-sized partite sets so that the sum of degrees was the same in each partite set led Kubesa to the conjecture that this is a necessary condition for a T -factorization. This conjecture was disproven by Meszka [29] who found an infinite class of trees factorizing a complete graph but not allowing such a partitioning of the vertex set. The smallest counterexample has 56 vertices. On the other hand Tan [33] showed that the conjecture holds for trees such that: (1) the tree T has at most three different degrees or (2) the maximum degree .T / is at most 4 or at least n 3.
7.3.3 Packings, Coverings, and Orthogonal Double Covers Both G-decompositions and G-factorizations require every edge of the decomposed complete graph to appear in precisely one copy of G. This restriction can be relaxed in two ways. Requiring every edge of K2n to appear in at most one G results in a packing of G into K2n . For a survey of results we refer to [36]. On the other hand if every edge of G has to appear in at least one copy of G we talk about covering K2n by G. Moreover if every edge of Kn is covered by precisely two subgraphs and any two subgraphs share exactly one edge we talk about an orthogonal double cover; see [19]. Usually there are additional requirements on both the coverings or packings. There are a number of results; we refer the reader to [6].
7.4 Recursive Construction In this section we describe a method that generalizes all of the methods for a G-factorization of K2n presented in Sect. 7.1. We start by defining/redefining some terms. Later in this section the method of recursive labeling is presented and in the last part examples are given.
188
P. Kov´arˇ
7.4.1 About the Method First we introduce a few terms to simplify the description. A permutation of a set A is a bijection W A ! A. By we denote the identity permutation and by ˛k the cyclic permutation of the set Vi D f0i ; 1i ; 2i ; : : : ; .k1/i g given by ˛k .ai / D .aC1 .mod k//i for any ai 2 Vi , where i is an integer and 0 a k 1. Definition 15. Given an (underlying) tree T on 2n vertices, two vertices r, s in T , and a positive integer k we can construct the blown-up graph U ŒT I kI r; s . We replace the vertices r, s by Kk , and each vertex i 2 V .T /, i ¤ r; s by K k . Such a blown-up vertex i we denote by Hi . Every edge ij 2 E.T / is replaced by a complete graph Kk;k denoted by Hij . Example 12. In Fig. 7.15 is shown the caterpillar T ' R1 with two vertices r, s chosen. Below is a blown-up graph U ŒT I kI r; s for k D 3. The vertices r, s in the definition cannot be chosen arbitrarily. If T factorizes K2n we require r, s to be mapped to each vertex of K2n throughout the factors. In a bicyclic factorization such pairs of vertices always exist. Definition 16. Let G1 ; G2 ; : : : ; Gn be a G-factorization of K2n induced by the isomorphisms j ; Gj D j .G/ for j D 1; 2; : : : ; n. A pair of vertices x; y 2 G is called a semisurjective pair if fj .x/W j D 1; 2; : : : ; ng D Vx , fj .y/W j D 1; 2; : : : ; ng D Vy , where Vx \ Vy D ;, and Vx [ Vy D V .K2n /. If is a vertex labeling of U ŒT I kI r; s , it will be useful to work with a restriction of to the vertex set of Hi or Hij , respectively. Definition 17. Let be a vertex labeling of U ŒT I kI r; s . We say the labeling i W Hi ! f0i ; 1i ; : : : ; .k 1/i g is induced by if i .v/ D .v/ for all v 2 V .Hi /. Similarly the labeling ij W Hij ! f0i ; 1i ; : : : ; .k 1/i ; 0j ; 1j ; : : : ; .k 1/j g is induced by if ij .v/ D .v/ for all v 2 V .Hij /.
a r
s
b
Fig. 7.15 (a) An underlying tree T ; (b) a blown-up graph U ŒT I kI r; s
7
Decompositions and Factorizations of Complete Graphs
189
The labeling introduced below extends features of the fixing labeling described in Sect. 7.1.6. We rewrite the definition of fixable and fixed vertices of T . By N.v/ we denote the set of vertices adjacent to v. Definition 18. Let T be a tree on 2n vertices; let r; s be distinct vertices in T and k a positive integer. Let G be a subgraph in U ŒT I kI r; s . If F is a set of vertices in T such that ˚ F D i 2 V .T /W i ¤ r; s where degG .xi / D 1 8xi 2 V .Hij / and 8j 2 N.i / ; then F is called a set of fixable vertices in T for a given G. All vertices in F are called fixable. Let VF F be any set of vertices that are independent in T . We call VF a fixed set and all vertices i 2 VF we call fixed vertices. We point out that in comparison to the previous Definition 12, in Definition 18, the requirement of T being symmetric has been lifted. For an example see Fig. 7.16. Now we can define a new labeling that we will use to factorize complete graphs into spanning trees. Definition 19. Suppose T factorizes the complete graph K2n and r, s form a semisurjective pair of vertices in T . Let G be a graph with 2nk 1 edges, n; k > 0, and the vertex set V .G/ D [i2n1 D0 Vi ;
where jVi j D k and Vi \ Vj D ; for i ¤ j :
Let VF be a set of fixed vertices in T for the graph G; VF may be empty.
fixing r
r
a r
s
bip. r
bip.
r
fixing
fixing
bip. r
b fixing
r
swapping
bip.
s
Fig. 7.16 The idea of recursive labeling: (a) for k odd; (b) for k even
r
fixing
190
P. Kov´arˇ
We say G has a recursive labeling if there exists an injection W Vi ! f0i ; 1i ; : : : ; .k 1/i g for all i D 0; 1; : : : ; 2n 1 such that the induced labelings have the following property. For k odd
(1) the labeling ij induced on Hij , for all ij 2 E.T /, is either a bipartite labeling or one of the vertices i , j is a fixed vertex in T (for a nonempty VF ), (2) the labelings r and s induced on Hr and Hs are -labelings. For k even
(1) the labeling ij induced on Hij ; for all ij 2 E.T /, ij ¤ rs, is either a bipartite labeling or one of the vertices i; j is a fixed vertex in T (for a nonempty VF ), (2) the edge rs 2 E.T / and the labeling rs induced on Hrs along with the edges of Hr and Hs is a swapping labeling. For short we denote the graph Hrs along with the edges of Hr and Hs by Hrs [ Hr [ Hs .
7.4.2 The Method of Recursive Labeling To avoid technical details in the proof of the following theorem we use properties of known labelings. First we prove two lemmas. Why we split the proof into lemmas becomes apparent in the last subsection. Lemma 2. Let G be a graph with 2nk 1 edges, n; k > 1, that allows a recursive labeling. Then there exists a G-decomposition of U ŒT I kI r; s into k copies of G. Proof. We have to show that we can find k factors G1 ; G2 ; : : : ; Gk that factorize the graph U ŒT I kI r; s and that they are all isomorphic. Suppose G is a graph with 2nk 1 edges that allows a recursive labeling . Let VF be the set of fixed vertices of T for the recursive labeling . We can construct the graphs G1 ; G2 ; : : : ; Gk in the following way. Take V .Gt / D V .G/, t D 1; 2; : : : ; k, and E.Gt / D fit .xi /jt .yj /W xi 2 Vi and yj 2 Vj and xi yj 2 E.G/g where each i is a bijection on the set f0i ; 1;i ; : : : ; .k 1/i g defined by ( i .xi / D
.x C 1 .mod k//i
if i 62 VF
xi
if i 2 VF
7
Decompositions and Factorizations of Complete Graphs
191
for all i D 0; 1; : : : ; 2n1. Notice that if i 2 VF then i D . The power it denotes the t-th composition i ı i ı : : : ı i . Obviously all graphs Gt for t D 1; 2; : : : ; k are isomorphic to G since it .xi /jt .yj / 2 E.Gt / , xi yj 2 E.G/. To show that G1 ; G2 ; : : : ; Gk form a G-factorization of U ŒT I kI r; s it is enough to show that every edge of U ŒT I kI r; s appears in some copy Gt . By the definition of recursive labeling each ij (the restriction of to a Hij if ij 2 T ) is for k odd either a bipartite labeling if i; j 62 VF or a fixing labeling of a bipartite graph if i 2 VF and j 62 VF . The restrictions r to Hr and s to Hs give a -labeling. The factors are obtained by i ; j as shown in the proofs of Theorems 3, 2, and 8. For k even the reasoning similar is. All edges of Hrs , Hr , and Hs appear in some Gt by Theorem 6. t u We require k > 1 otherwise G ' T and the task is trivial and n > 1 since there have to be at least two partite sets in U ŒT I kI r; s . Lemma 3. Let T be a tree that factorizes K2n and let r; s be a semisurjective pair of vertices in T . Then U ŒT I kI r; s factorizes K2nk into k isomorphic copies of U ŒT I kI r; s . Proof. Let T1 ; T2 ; : : : ; Tn be a T -factorization of K2n . Obviously since T factorizes K2n , the blown-up graph T ŒK k factorizes the complete multipartite graph K2n ŒK k ' Kk;k;:::;k . Now each U ŒTi I kI r; s , i D 1; 2; : : : ; n, contains besides the edges of Ti ŒK k also 2 k2 edges of two Kk in the partite sets Vr and Vs . Since vertices r; s are a semisurjective pair, each partite set Vi for i D 0; 1; : : : ; 2n 1 will be blown up by Kk in exactly one copy of U ŒT I kI r; s . This completes the proof. u t Theorem 10. Let a graph G with 2nk 1 edges, n; k > 1, allow a recursive labeling. Then there exists a G-decomposition of K2nk into nk copies of G such that if x; y is a semisurjective pair of vertices in T with a fixed set VF , then all pairs ix ; jy , ix 2 Vx , jy 2 Vy for i; j D 0; 1; : : : ; k 1 form a semisurjective pair in G for k odd if x; y 62 VF and for k even if x; y 62 .VF [ fr; sg/. Proof. By Lemma 2 the graph G decomposes U ŒT I kI r; s . Let T be the underlying tree of U ŒT I kI r; s . Since T factorizes K2n (by the definition of U ŒT I kI r; s ) then U ŒT I kI r; s factorizes K2nk into k isomorphic copies as shown in Lemma 3. Thus G decomposes K2nk into nk isomorphic copies. Now it remains to examine the semisurjective pairs. Since vertices x; y are a semisurjective pair in T , then by definition Vx D fi .x/W i D 0; 1; : : : ; n 1g, Vy D fi .y/W i D 0; 1; : : : ; n 1g, Vx \ Vy D ;, and jVx j D jVy j D n. Now each vertex x of T , x 62 VF is taken by the permutation x through exactly k vertices 0x ; 1x ; : : : ; .k 1/x in Vx . Thus x is semisurjective and having a semisurjective pair x; y in T , the pairs ix ; jy are semisurjective for all i; j D 0; 1; : : : ; k 1. However, this is not true in general for all vertices in Vr ; Vs for k even when rs induced on Hrs is a swapping labeling. The proof is complete. t u
192
P. Kov´arˇ
Notice that for k even some vertices of G such that rs is a swapping labeling of Hrs [ Hr [ Hs may also be a semisurjective pair. Corollary 1. If the graph G with 2nk 1 edges is a tree, then the G-decomposition becomes a G-factorization of K2nk . Now it should be clear why we call such labeling recursive. If G is a tree it can become an underlying tree T 0 ' G of a larger graph U ŒT 0 I k 0 I r 0 ; s 0 for some integer k 0 and a semisurjective pair r 0 ; s 0 in T 0 . The vertices r 0 ; s 0 exist by Theorem 10.
7.4.3 Examples Example 13. In [14] it was shown that the caterpillar R4 in Fig. 7.17 factorizes the complete graph K8 . R4 has a symmetric -labeling, but it does not have a swapping labeling. A recursive labeling of R4 is given in Fig. 7.18. Both factors of U ŒP4 I 2I r; s are given below. The underlying graph is P4 , which factorizes K4 so that the two nonleaf vertices form a semisurjective pair; see Fig. 7.14. The vertex labels are implied by the drawing by adopting the convention from Example 11 and choosing a fixed set VF containing both leaves of P4 . Example 14. It may seem that the lobster in Fig. 7.19 has a recursive labeling. Indeed the labeling induced on H01 [ H0 [ H1 is a swapping labeling, the labeling induced on H12 is a bipartite -labeling, and we are fixing the vertices in V3 . Also the underlying graph P4 factorizes K4 as in the previous example. But the pair of vertices r (a leaf) and s (nonleaf) of P4 is not a semisurjective pair in P4 . In fact it was shown in [15] that this lobster does not factorize K8 at all. The proof is rather technical and is based on a careful examination of adjacent nonleaf vertices and counting edges among these vertices and adjacent leaves.
Fig. 7.17 Caterpillar R4 and the underlying tree P4
a
V0
V1
V2
r
V3
b
Fig. 7.18 Caterpillar R4 : (a) recursive labeling; (b) two factors
s
7
Decompositions and Factorizations of Complete Graphs
Fig. 7.19 A lobster that does not factorize K8 and its underlying tree
193 r
s
V0
V1
V2
V3
Notice that if T with m edges either decomposes or factorizes K2n then in general it does not necessarily decompose K2nk , since there are m edges in T and m divides n.2n 1/, but there are nk.2nk 1/ edges in K2nk and m does not necessarily divide nk.2nk 1/.
7.4.4 Comparison to Previously Defined Labelings The recursive labeling from Sect. 7.4.1 extends both of the most general methods (fixing and swapping labelings) known so far for spanning tree factorizations of complete graphs. In comparison to fixing labeling the underlying graph T does not have to be symmetric. Taking a symmetric underlying graph and restraining k to odd values the recursive labeling becomes a fixing labeling. Taking n D 1 (two partite set V0 and V1 ) the recursive labeling becomes for k even a swapping labeling and for k odd a blended labeling. Moreover, the pairs of semisurjective vertices are specified. Thus by finding a recursive labeling of some tree G (not a general graph G if we require connectivity) we can easily proceed by blowing it up again and searching for recursive labeling of the blown-up graph as well. Or we can use such a method similarly as in Sect. 7.2 and in certain cases “reduce” a given tree G to smaller trees and search for recursive labeling of the smaller graph. Then G will also have a recursive labeling by the second part of Theorem 10.
7.5 Conclusion The problem of spanning tree factorization of complete graphs has been studied for more than 10 years. No necessary and sufficient condition is known for a tree to allow such factorization and no such easy condition is expected to exist. There are several methods used to find factorizations; in this chapter we gave a more general approach combining most of the previously introduced concepts. Yet a complete classification of all trees whether they do or do not factorize the corresponding complete graph is far from being solved. On the other hand the presented techniques can be used not only for trees, but also for general graphs.
194
P. Kov´arˇ
7.5.1 Further Possible Generalizations There were several assumptions made during the description of recursive labeling, that in some cases can be lifted and still a decomposition or a factorization of the complete graph K2nk will be obtained. We list them here. The permutations i used for cyclic decompositions do not have to be cyclic.
This would lead to a more general statement in Lemma 2 whereas Lemma 3 and Theorem 10 would remain unchanged. The underlying graph T does not have to be a tree. However if T is not spanning, we cannot obtain a G-factorization of K2nk . On the other hand, if T is spanning and contains more then 2n1 edges, then more than two vertices of T have to be replaced by Kk in the process of blowing up. This would result in modification of Lemma 3. Hence also the definition of U ŒT I kI r; s has to be modified and the notion of a semisurjective set has to be introduced. This would lead only to a slight modification of Theorem 10. For carefully picked underlying trees and their copies one can use this method not only for decomposition of complete graphs but also of other graphs. On the other hand, one should not expect this method to give general results.
7.5.2 Further Extensions The firefighters network is usually overdesigned. In idle time we can perform network measuring for each possible connection between two units, and compute and broadcast reliabilities for each connection. Based on this a weighted complete graph can be constructed. The zero weight stands for a connection loss between a pair of units. Now the reliability for each of the precomputed factors can be obtained and among all the factors in the list we can instantly pick the “best.” We can expect that this network will have the longest operational time. Another enhancement may lay in permuting the vertex set prior choosing a particular factor. If it is apparent from the measured data that one unit has a weak connection to many units (this unit may have strained from the group), we can reorder the IDs of the vertices so that this particular vertex forms a leaf in the most reliable factors. Hereby we enforce a more stable network. The proposed method can be used also for large-scale networks, both locally and globally. We can also use various factors on subnets of a larger net, e.g., on a set of relatively close vertices. The main advantage is to control the diameter and a bounded maximal degree. This can be subject to further research. Acknowledgments Supported by the Ministry of Education of the Czech Republic Grant No. MSM6198910027. The author wants to thank the anonymous referees, whose comments helped in improving the quality of this chapter.
7
Decompositions and Factorizations of Complete Graphs
195
References 1. Alspach B, Gavlas H (2001) Cycle decompositions of Kn and Kn I . J Combin Theory B 81:77–99 2. Bloom GS (1979) A chronology of the Ringel-Kotzig conjecture and the continuing quest to call all trees graceful. In: Topics in graph theory. The New York Academy of Sciences 3. Bos´ak J (1986) Decompositions of graphs. VEDA, Bratislava 4. Bos´ak J, Erd¨os P, Rosa A (1972) Decompositions of complete graphs into factors with diameter two. Mat cˇ asopis Slov akad vied 22:14–28 5. Bos´ak J, Rosa A, Zn´am Sˇ (1968) On decompositions of complete graphs into factors with given diameters. In: Theory of Graphs (Proc Colloq Tihany 1966), Akademiai Kiad´o, Budapest, pp 37–56 6. Colbourn CJ, Dinitz JH (eds) (2007) The CRC handbook of combinatorial designs, 2nd edn. Discrete mathematics and its applications. CRC press, Boca Raton 7. Diestel R (2006) Graph theory, 3rd edn. Springer, Berlin Heidelberg 8. Eldergill P (1997) Decompositions of the complete graph with an even number of vertices. M.Sc. thesis, McMaster University, Hamilton 9. El-Zanati S, Vanden Eynden C (1999) Factorizations of Km;n into spanning trees. Graph Combinator 15:287–293 10. Fronˇcek D (2004) Cyclic decompositions of complete graphs into spanning trees. Discuss Math Graph Theory 24(2):345–353 11. Fronˇcek D (2006) Note on factorizations of complete graphs into caterpillars with small diameters. JCMCC 57:179–186 12. Fronˇcek D (2007) Bi-cyclic decompositions of complete graphs into spanning trees. Discrete Math 307:1317–1322 13. Fronˇcek D, Kov´aˇrov´a T (2007) 2n-cyclic blended labeling of graphs. Ars Combinatoria 83:129–144 14. Fronˇcek D, Kov´aˇr P, Kov´arˇov´a T, Kubesa M (2010) Factorizations of complete graphs into caterpillars of diameter 5. Discrete Math 310:537–556 15. Fronˇcek D, Kov´arˇ P, Kubesa M Factorizations of complete graphs into trees with at most four non-leave vertices, (submitted) 16. Fronˇcek D, Kubesa M (2002) Factorizations of complete graphs into spanning trees. Congr Numer 154:125–134 17. Gallian JA (2003) A dynamic survey of graph labeling. Electron J Combinator DS6 18. Golomb SW (1972) How to number a graph, in graph theory and computing. In: Read RC (ed) Academic, New York, pp 23–37 19. Gronau H-DOF, Gr¨utm¨uller M, Hartman S, Leck U, Leck V (2002) On orthogonal double covers of graphs. Design Code Cryptogr 27:49–91 20. Kov´arˇov´a T (2005) Decompositions of complete graphs into isomorphic spanning trees with given diameters. JCMCC 54:67–81 21. Kov´arˇov´a T (2004) Fixing labelings and factorizations of complete graphs into caterpillars with diameter four. Congr Numer 168:33–48 ˇ – 22. Kov´arˇov´a T (2004) Spanning tree factorizations of complete graphs. Ph.D. thesis, VSB Technical University of Ostrava 23. Kubesa M (2004) Factorizations of complete graphs into [n,r,s,2]-caterpillars of diameter 5 with maximum center. AKCE Int J Graph Combinator 1(2):135–147 24. Kubesa M (2004) Factorizations of complete graphs into caterpillars of diameter four and five. ˇ – Technical University of Ostrava Ph.D. thesis, VSB 25. Kubesa M (2005) Spanning tree factorizations of complete graphs. JCMCC 52:33–49 26. Kubesa M (2005) Factorizations of complete graphs into [r,s,2,2]-caterpillars of diameter 5. JCMCC 54:187–193 27. Kubesa M (2006) Factorizations of complete graphs into [n,r,s,2]-caterpillars of diameter 5 with maximum end. AKCE Int J Graph Combinator 3(2):151–161
196
P. Kov´arˇ
28. Kubesa M (2007) Factorizations of complete graphs into [r,s,t,2]-caterpillars of diameter 5. JCMCC 60:181–201 29. Meszka M (2008) Solution to the problem of Kubesa. Discuss Math Graph Theory 28:375–378 30. Palumb´ıny D (1973) On decompositions of complete graphs into factors with equal diameters. Boll Un Mat Ital 7:420–428 31. Rosa A (1967) On certain valuations of the vertices of a graph. In: Theory of graphs (Intl Symp Rome 1966), Gordon and Breach, Dunod, Paris, pp 349–355 32. Shibata Y, Seki Y (1992) The isomorphic factorization of complete bipartite graphs into trees. Ars Combinatoria 33:3–25 33. Tan ND (2008) On a problem of Fronˇcek and Kubesa. Australas J Combinator 40:237–245 34. Vetr´ık T (2006) On factorization of complete graphs into isomorphic caterpillars of diameter 6. Magia 22:17–21 35. West DB (2001) Introduction to graph theory, 2nd edn. Prentice-Hall, Upper Saddle River, NJ 36. Yap HP (1988) Packing of graphs – a survey. Discrete Math 72:395–404
Chapter 8
Geodetic Sets in Graphs Boˇstjan Breˇsar, Matjaˇz Kovˇse, and Aleksandra Tepeh
Abstract Geodetic sets in graphs are briefly surveyed. After an overview of earlier results, we concentrate on recent studies of the geodetic number and related invariants in graphs. Geodetic sets in Cartesian products of graphs and in median graphs are considered in more detail. Algorithmic issues and relations with several other concepts, arising from various convex and interval structures in graphs, are also presented. Keywords Geodetic number Geodetic set Cartesian product Median graph Boundary set MSC2000: Primary 05C12; Secondary 05C99
8.1 Introduction In this chapter by the notion of a graph we usually mean an undirected graph without loops or multiple edges. The only exception is in Sect. 8.6 where directed graphs are also briefly considered. As usual, V .G/ and E.G/ denote the vertex and the edge sets of a graph G, respectively. Unless stated differently n and m denote the number of vertices and number of edges of a graph, respectively. We start by formally defining the most basic concepts. The length of a path is the number of its edges. Let u and v be vertices of a connected graph G. A shortest u; v-path is also called a u; v-geodesic. The (shortest path) distance is defined as the length of a u; v-geodesic in G and is denoted by dG .u; v/, or d.u; v/ for short if the graph is clear from the context. The corresponding metric space is also called graphic metric space, associated with the graph G; see [40]. The eccentricity of a vertex v of a graph G is the maximum distance between v and any other vertex of G. The diameter of G, denoted by diam.G/, is the maximum
A. Tepeh () University of Maribor, FEECS, Smetanova 17, 2000 Maribor, Slovenia e-mail:
[email protected]
M. Dehmer (ed.), Structural Analysis of Complex Networks, c Springer Science+Business Media, LLC 2011 DOI 10.1007/978-0-8176-4789-6 8,
197
198
B. Breˇsar et al.
eccentricity of vertices in G, and the radius is the minimum such eccentricity. The (geodesic) interval I.u; v/ between u and v is the set of all vertices on all shortest u; v-paths. Given a set S V .G/, its geodetic closure I ŒS is the set of all vertices lying on some shortest path joining two vertices of S I that is, I ŒS D fv 2 V .G/ W v 2 I.x; y/; x; y 2 S g D
[
I.x; y/:
x;y2S
A set S V .G/ is called a geodetic set in G if I ŒS D V .G/; that is, every vertex in G lies on some geodesic between two vertices from S . The geodetic number g.G/ of a graph G is the minimum cardinality of a geodetic set in G. See [14] for many aspects of distances in graphs and the Encyclopedia of Distances [40] for a comprehensive collection of different appearances of distances in a variety of areas. The problem of determining the geodetic number of a graph was initiated by Harary, Loukakis, and Tsouros in 1986 and their result appeared as a published paper in 1993, see [52]. It is shown there that finding the geodetic number of a graph is an NP-hard problem with its decision version being the NP-complete problem. They also determined geodetic numbers in some graph classes. Results about the geodetic number appeared in the literature before the publication of the article [52]; see [14, 15]. Even before that closely related two-person games on graphs, called achievement and avoidance games, were introduced and examined in [13]; see [50, 53, 75] for more on this topic. Chartrand et al. [31] proved that for any integer k between 2 and n there exists a graph on n vertices with geodetic number k. Moreover, for positive integers r; d; k 2 with r d 2r, there exists a connected graph G with rad.G/ D r, diam(G/ D d , and g.G/ D k. Several lower and upper bounds for the geodetic number involving different graph parameters have been found. Obviously 2 g.G/ n for any connected graph G. Among graphs on n vertices only complete graphs attain the upper bound, while the family of graphs that attain the lower bound is much richer (see Sects. 8.3 and 8.4 for a discussion on median graphs with g.G/ D 2). In [15] it is shown that g.G/ D 2 if and only if there exist two vertices u and v with d.u; v/ D diam.G/ and every vertex of G lies on a geodesic between vertices u and v. It is also shown there that g.G/ D n1 if and only if G D .Kn1 [Kn2 [ [Knr /˚K1 , where r 2 and n1 ; n2 ; : : : ; nr are positive integers satisfying the equality n1 Cn2 C Cnr D n1 and ˚ denotes the join of graphs (the only vertex not needed in a geodetic set is the cut vertex of G). Chartrand et al. [31] obtained the following general upper bound: g.G/ n diam.G/ C 1. It is attained, for instance, by complete graphs and paths. A vertex is simplicial (also extreme or complete) if its neighborhood induces a complete graph. A simplicial vertex obviously belongs to any geodetic set of a graph, hence, the number of simplicial vertices is a lower bound on the geodetic number [31]. A graph G is an extreme geodesic graph if all simplicial vertices of G already form a geodetic set (which is therefore also unique). Extreme geodesic graphs are therefore those graphs in which every vertex lies on
8
Geodetic Sets in Graphs
199
a geodesic between two simplicial vertices; see [29]. Trees and complete graphs provide typical examples of such graphs, and this implies that the following statement is true: for every pair a; n of integers with 2 a n, there exists a connected extreme geodesic graph G on n vertices with g.G/ D a. Moreover, in [29] it is also shown that for every pair a; b of integers with 0 a b and b > 2, there exists a connected graph G with a simplicial vertices and g.G/ D b. On the other hand, all cut-vertices are clearly excluded from any minimum geodetic set. In addition, for any graph G containing k end-blocks, g.G/ k, see [28], where an end-block of graph G is a block containing only one cut-vertex. Atici and Vince [2] provided a lower bound for the edge geodetic number, denoted by ge .G/. Its definition differs from the definition of the usual geodetic number in that also all edges of a graph G must be included in some geodesic between two vertices from the geodetic set. Clearly ge .G/ g.G/. In [2] the following lower bound is shown: ge .G/ d3 log3 !.G/e, where !.G/ denotes the clique number of graph G. Moreover, for any k there exists a graph G with !.G/ D k that contains an edge geodetic set with d3 log3 ke C vertices, where 2 f0; 1g. Using the probabilistic method together with a random greedy algorithm for obtaining geodetic sets, Chae et al. [23] determined the asymptotic behavior of the geodetic number of random graphs with fixed edge probability. Starting with an empty set S the so-called random greedy algorithm simply adds two nonadjacent vertices at every step and checks whether S is a geodetic set. In [23] it is shown that given a random graph Gn;p on n vertices with a fixed edge probability p, the random greedy geodetic covering algorithm almost surely finds a geodetic set on O.log.n// vertices. A more detailed analysis shows that almost surely g.Gn;p / D 1 .1 C o.1// logb n, where b D 1p . One can also study geodetic sets that are extremal in some way other than having the smallest cardinality. A geodetic set S is called a minimal geodetic set if no proper subset of S is a geodetic set. Of course, every minimum geodetic set is a minimal geodetic set, but the converse is not true as the example in Fig. 8.1 shows. Namely, fu; v; wg is a minimal geodetic set of K2;3 but not its minimum geodetic set (the unique minimum geodetic set is fx; yg). The upper geodetic number of a graph G, denoted by g C .G/, is defined as the maximum cardinality of a minimal geodetic set of G. It is shown in [30] that for a connected graph G on n vertices and gC .G/ D n 1 it follows that g C .G/ D g.G/. Moreover, for every pair a; b of integers with 2 a < b there exists a graph G with g.G/ D a and g C .G/ D b.
Fig. 8.1 A minimal geodetic set of K2;3
200
B. Breˇsar et al.
A graph G is called a minimum geodetic subgraph if there exists a graph H , such that G is an induced subgraph of H and vertices of G form a minimum geodetic set. It is shown in [31] that a nontrivial graph G is a minimum geodetic subgraph if and only if every vertex of G has eccentricity 1 or no vertex of G has eccentricity 1. The subgraph of G induced by the vertices of maximum eccentricity is called the periphery of a graph G, denoted Per.G/. Together with the result by Bielak and Sysło [7] it follows that a nontrivial graph G is a minimum geodetic subgraph if and only if G is the periphery of some connected graph K. Concepts related to geodesics also appear in the social sciences [81]. When members of a social group are represented by vertices, and particular relationships between members by edges of a graph, then the geodetic number can be considered as the smallest number n such that every member of a group is contained in a minimal chain of relationships between chosen n members. Beside this rather straightforward application, there are also related studies [8] where different models of (also social) networks and their properties are based on graph distance. For more results on geodetic number and related concepts that have appeared before 2002 see the survey [32]. The emphasis of this chapter is to present some results about the geodetic number and related concepts that have appeared after [32] was published. They are often connected to graph classes arising in metric graph theory which is not surprising since the geodesic interval is one of the basic notions of this theory. A typical example of an operation suitable for studying graph metrics is the Cartesian product of graphs. The results on geodetic sets concerning this product are presented in Sect. 8.2. In Sect. 8.3 we present relevant results on median graphs which are one of the most important classes in metric graph theory. In Sect. 8.4 we follow with algorithmic issues concerning the geodetic number. In particular we present an efficient algorithm for recognizing median graphs with geodetic number 2. Next, several types of boundary sets have been defined on graphs and were studied with respect to convex properties and geodecity; see Sect. 8.5. In Sect. 8.6 we briefly overview several variations of geodetic sets and geodetic number that were studied intensively in the last 10 years.
8.2 Cartesian Products The Cartesian product is a widely useful operation on graphs that appears in various settings. It is one of the four standard graph products [61], and the most important one in metric graph theory. Several well-known classes of graphs are Cartesian products: square-grids, hypercubes, Hamming graphs, prisms, etc. The Cartesian product G H of graphs G and H is the graph with the vertex set V .G/ V .H / in which vertices .g; h/ and .g 0 ; h0 / are adjacent whenever gg 0 2 E.G/ and h D h0 , or g D g 0 and hh0 2 E.H /. The most basic metric property of the Cartesian product operation is that for any graphs G and H , dG H ..g; h/; .g 0 ; h0 // D dG .g; g 0 / C dH .h; h0 /:
8
Geodetic Sets in Graphs
201
Fig. 8.2 Cartesian products: K2 K2 K2 , K3 K2 K2 and K2 .K4 e/
In addition it is also easy to find the following useful observation about intervals in Cartesian products which is already a part of the folklore. Lemma 1. Let X D G H be the Cartesian product of (connected) graphs G and H and let .g; h/ and .g 0 ; h0 / be vertices of X . Then IX Œ.g; h/; .g 0 ; h0 / D IG Œg; g 0 IH Œh; h0 . Moreover, IX Œ.g; h/; .g 0 ; h0 / D IX Œ.g 0 ; h/; .g; h0 /. The Cartesian product is associative and commutative, and K1 is the unit. Hence, one can define the Cartesian power in a natural way. The simplest nontrivial examples are powers of edge-graphs .K2 /k that are known as k-cubes Qk or hypercubes. Using Lemma 1 and induction on k one quickly finds that g.Qk / D 2; see also [15]. In Fig. 8.2 three examples of Cartesian products are depicted, namely the 3-cube, the Hamming graph K3 K2 K2 , and the product of K2 and the diamond K4 e. We start with general bounds on the geodetic number of the Cartesian product of two graphs, that are expressed in terms of geodetic numbers of factor graphs. Theorem 1. [63] Let G and H be graphs with g.G/ D p g.H / D q 2. Then p g.G H / pq q: These bounds were proved for the first time by Jiang et al. [63], who also constructed infinite families of graphs attaining each of the bounds. We present several classes of graphs that attain the lower bound in Theorem 1. For the upper bound, the following construction was given in [63]. First, graphs Dpt are defined on vertices .ij / .ij / x1 ; : : : ; xp ; z and y1 ; : : : ; yt for all i; j , 1 i < j p (altogether pC1Ct p2 vertices); where each of the vertices y1.ij / ; : : : ; yt.ij / is adjacent exactly to xi ; xj and z, z is adjacent to all vertices in Dpt z, and there are no edges between any xi and xj . It is easy to see that x1 ; : : : ; xp is a geodetic set in Dpt , and in fact g.Dpt / D p. The following result shows that the upper bound in Theorem 1 is attained by products of graphs Dpt with complete graphs. Proposition 1. [63] Let p; q; t be positive integers such that t > pq q. Then g.Dpt Kq / D pq q.
202
B. Breˇsar et al.
The bounds in Theorem 1 are rather far apart and may not be very useful, but they cannot be improved in general. By applying Lemma 1, Breˇsar et al. [12] found a simple proof of the upper bound in Theorem 1. They also looked for better bounds when a graph has a minimum geodetic set with some special structure. Let G be a graph and let S D fx1 ; : : : ; xk g be a geodetic set of G. Then S is a linear geodetic set if for any x 2 V .G/ there exists an index i , 1 i < k, such that x 2 I Œxi ; xi C1 . Theorem 2. [12] Let G and H be graphs on at least two vertices with g.G/ D p and g.H / D q. Suppose that both G and H contain linear minimum geodetic sets. Then j pq k g.G H / : 2 Many graphs admit linear minimum geodetic sets; complete graphs and graphs G with g.G/ D 2 are obvious instances of such graphs. For another example consider complete bipartite graphs Kn;m with n; m 4. It is known [31] and easy to see that g.Kn;m / D 4. Moreover, selecting the first two vertices of a minimum geodetic set from one bipartition set and the last two vertices from the other yields a linear geodetic set. Combining Theorem 2 with the lower bound from Theorem 1 we infer Corollary 1. [12] Let G be a graph on at least two vertices that admits a linear minimum geodetic set and let H be a graph with g.H / D 2. Then g.G H / D g.G/. The above result also implies that the geodetic number of the product of two graphs with geodetic number 2 is also 2. For example, the Cartesian product of an arbitrary finite number of paths has geodetic number 2. In particular, this applies to hypercubes and square-grid graphs. For another class of graphs attaining the lower bound in Theorem 1 the following property of geodetic sets was introduced in [12]. Let G be a graph. If S is a geodetic set of G such that 8u 2 V .G/ n S; 8v; w 2 S W u 2 I Œv; w;
(8.1)
we say that S is a complete geodetic set of G. (Clearly any complete geodetic set is also a linear geodetic set.) Proposition 2. [12] Let G and H be nontrivial graphs both having a complete minimum geodetic set. Then g.G H / D maxfg.G/; g.H /g. Examples of graphs having a complete minimum geodetic set include complete graphs, stars, and graphs with geodetic number 2. Odd cycles are examples of graphs that admit a linear minimum geodetic set but not a complete minimum geodetic set. In several examples that achieve the lower bound in Theorem 1, the class of trees is involved. Note that the unique minimum geodetic set of a tree is the set of its leaves [31]; hence, the geodetic number of a tree is the number of its leaves.
8
Geodetic Sets in Graphs
203
Proposition 3. (i) [12] For any trees T1 and T2 with `1 and `2 leaves, g.T1 T2 / D maxf`1 ; `2 g: (ii) [84] For any tree T with ` leaves and a complete graph Km , g.T Km / D maxf`; mg: Cartesian products of even cycles and complete graphs also attain the best possible lower bound, as follows from Corollary 1. The complete answer for products of complete graphs and cycles was given by Ye et al. [84]: for m 2, m; n even, or n odd and m n g.Cn Km / D m C 1; n odd and m < n. The Cartesian product of the form GK2 is called the prism over G. Geodetic sets of prisms were considered in [31], where the authors observed the inequality g.GK2 / g.G/; and provided a sufficient condition for the appearance of equality. A necessary and sufficient condition for the equality was obtained by Lu [68], and independently also in [10]. To present it, we need the following notation. For S1 ; S2 V .G/, and S1 \ S2 D ;, let I ŒS1 ; S2 D fv 2 V .G/ W v 2 I.x; y/; x 2 S1 ; y 2 S2 g; i.e., the set of vertices that lie on some geodesic between a vertex of S1 and a vertex of S2 . Theorem 3. [10, 68] Let G be a nontrivial connected graph. Then g.GK2 / D g.G/ if and only if G possesses a geodetic set S that can be partitioned into nonempty subsets S1 and S2 such that .I ŒS1 \ I ŒS2 / [ I ŒS1 ; S2 D V .G/. A characterization of the graph G that enjoys g.GK3 / D g.G/ was obtained recently in [84]. It is more complex than the above, and involves a partition of a geodetic set of G into three nonempty subsets enjoying several conditions. These conditions are not in an optimal form, and we present a more brief formulation. In addition, our approach can be applied to Cartesian products with arbitrary complete graphs. Note that the condition in Theorem 3 is equivalent to the conjunction of conditions I ŒS1 [ I ŒS1 ; S2 D V .G/ and I ŒS2 [ I ŒS1 ; S2 D V .G/. We generalize it as follows (for notational convenience I ŒSi ; Si stands for I ŒSi ). Theorem 4. Let G be a nontrivial connected graph. Then g.GKk / D g.G/ if and only if G possesses a geodetic set S that can be partitioned into nonempty subsets S1 ; : : : ; Sk such that for all i D 1; : : : ; k: k [ j D1
I ŒSi ; Sj D V .G/:
204
B. Breˇsar et al.
Proof. Note that vertices of GKk can be written as follows: for any x 2 V .G/, and i 2 f1; : : : ; kg, let xi D .x; i /. Then xi is adjacent to xj for j ¤ i , and also to yi whenever xy 2 E.G/. Suppose that G possesses a geodetic set S that can be partitioned into nonempty S subsets S1 ; : : : ; Sk such that for all i D 1; : : : ; k, kj D1 I ŒSi ; Sj D V .G/: Then let S 0 be the set of vertices in GKk defined as k [
Si fi g:
i D1
Let xi D .x; i / be an arbitrary vertex in GKk . Then by the condition of the theorem, x lies in the interval between two vertices y and z from Si (in which case, xi clearly lies in the interval between yi and zi ), or it lies in I.y; w/, where y 2 Si and w 2 Sj for some j ¤ i . In the latter case we infer by Lemma 1 that xi lies in I.yi ; wj /, where clearly yi ; wj 2 S 0 . Hence, I ŒS 0 D V .GKk /, and obviously jS 0 j D jS j D g.G/. For the converse, let S 0 be a minimum geodetic set of GKk with jS 0 j D g.G/. Let Si0 D S 0 \ .V .G/ fi g/, and note that Si0 ¤ ; for all i D 1; : : : ; k, since S 0 is a geodetic set. Fix i and consider an arbitrary vertex xi . Take any two vertices in S 0 for which xi lies in the interval between them. Clearly, at least one of these vertices ui is in Si0 . Hence, xi 2 I.ui ; vj /, where vj is the other vertex. Let St be the natural projection of St0 on G for all t D 1; : : : ; k. Now, if vj 2 Si , then x 2 I.u; v/ where both u; v 2 Si . Otherwise, x 2 I.u; v/, where u 2 Si ,v 2 Sj . Hence, x 2 I ŒSi or S x 2 I ŒSi ; Sj . Since x was arbitrarily chosen, we infer kj D1 I ŒSi ; Sj D V .G/, and we have proved this for an arbitrary i . The proof is complete.
8.3 Median Graphs One of the most important classes of graphs derived from related metric structures is that of median graphs. They are defined as the graphs in which for every triple of vertices u; v; w 2 V .G/ the intersection I.u; v/ \ I.u; w/ \ I.v; w/ consists of precisely one vertex (which is called the median of the triple u; v; w). Median graphs have been rediscovered several times, and a rich structure theory has been developed, cf. the survey [64] and the book [61]. Applications of median graphs can be found in computer science, phylogenetics, social choice theory, etc.; see, for example, [6, 25, 82]. Geodetic sets and the geodetic number in median graphs were first investigated in [10] and later also in [3, 11]. Breˇsar and Tepeh [10] studied minimum geodetic sets in median graphs with respect to the procedure that involves so-called peripheral subgraphs of a median graph. For a connected graph and an edge xy of G we denote Wxy D fw 2 V .G/ j d.x; w/ < d.y; w/g:
8
Geodetic Sets in Graphs
205
H
Fig. 8.3 Peripheral expansion G of a graph H
For an edge xy of G let Uxy denote the set of vertices u that are in Wxy and have a neighbor in Wyx . If for some edge xy, Wxy D Uxy , we call the set Uxy a peripheral set and a subgraph induced by a peripheral set is a peripheral subgraph (note that this is different from the concept of periphery as defined in Sect. 8.1). A subset S of the vertex set of a graph G is convex if for any two vertices u; v 2 S , I.u; v/ is a subset of S . Bandelt et al. [5] characterized median graphs as connected bipartite graphs in which for every edge ab of G, the sets Uab and Uba are convex. Another very useful characterization of median graphs due to Mulder is based on a special expansion procedure [70, 72]. Let H be a connected graph and P its convex subgraph, meaning the subgraph, induced by a convex subset V .P / of V .H /. Then the peripheral expansion of H along P is the graph G obtained as follows. Take the disjoint union of a copy of H and a copy of P (denoted by P 0 in Fig. 8.3). Join each vertex u in the copy of P with the vertex that corresponds to u in the copy of H (actually in the subgraph P of H ). We say that the resulting graph G is obtained by a (peripheral) expansion from H along P , and denote this operation in symbols by G D pe.H; P /. Mulder [73] characterized median graphs as graphs that can be obtained from K1 by a sequence of peripheral expansions; see also [9]. In [10] the following relation between geodetic numbers of a median graph and its peripheral expansion was obtained. Theorem 5. [10] Let H be a median graph, P its convex subgraph, and G D pe.H; P /. Then g.H / g.G/ g.H / C g.P /. Moreover, it was shown that both bounds are sharp. In fact, by using the structure of minimum geodetic sets in H , situations when g.G/ D g.H / were characterized. Let S and T be two disjoint subsets of V .G/. Then a u; v-geodesic is called a geodesic on S if u; v 2 S and a u; v-geodesic is called a geodesic between S and T if u 2 S and v 2 T . Theorem 6. [10] Let H be a median graph, P its convex subgraph, and G D pe.H; P /. Then g.H / D g.G/ if and only if there exists a minimum geodetic set S of H and its partition S D S1 [ S2 such that S1 ; S2 6D ;, S2 V .P / and for every v 2 V .P / v lies on some geodesic between S1 and S2 , or v lies on some geodesic on S1 and on some geodesic on S2 .
206
B. Breˇsar et al.
Fig. 8.4 A median graph with geodetic number 4
The upper bound in Theorem 5 is attained for an infinite family of median graphs (see [10] for the construction), which also gives the answer to the question of how large the difference can be between g.pe.H; P // and g.H /. Proposition 4. [10] For every k 2 N there exists a median graph G that can be obtained by the peripheral expansion from a median graph H such that g.G/ D g.H / C k. Trees are median graphs in which peripheral subgraphs are precisely the onevertex subgraphs induced by each leaf and the minimum geodetic set of a tree consists of all leaves [31]. But unlike in trees, it may happen that in a median graph a minimum geodetic set contains vertices that are not in a peripheral subgraph; see Fig. 8.4. On the other hand, it was shown in [10] that given a geodetic set S of a median graph, every periphery contains a vertex from S . This was the motivation for introducing the concept of the periphery transversal number pt.G/ as the smallest number of vertices that meet all peripheral subgraphs [3, 11]. Clearly, pt.G/ g.G/ and it turns out that median graphs with geodetic number 2 and those with periphery transversal number 2 coincide. As already mentioned in Sect. 8.1, general graphs with g.G/ D 2 were characterized in [15]. Cagaanan et al. [22] proved that the geodetic number of a join of two connected noncomplete graphs is 2 if and only if both the diameter and the geodetic number of one of the graphs is 2. However, much more is known about median graphs with geodetic number 2. Before we give the complete list of thus far known characterizations of such graphs we need some preliminary notions. A subgraph H of a graph G is isometrically embeddable in G if dH .u; v/ D dG .u; v/ for every u; v 2 V .H /. Edges e D xy and f D uv of a graph G are in the Djokovi´c–Winkler relation if dG .x; u/CdG .y; v/ 6D dG .x; v/CdG .y; u/ [41,83]. Relation is reflexive and symmetric. Winkler [83] proved that it is also transitive in partial cubes (i.e., isometric subgraphs of hypercubes), and so it is an equivalence relation on the edge set of any median graph, since median graphs are partial cubes [71]. By the result of Eppstein [45] every partial cube G can be isometrically embedded into the n-dimensional grid Zn for sufficiently large n. Denote by pi the projection from Zn to a copy of Z, denoted by Zi . Clearly pi .G/ is a discrete interval
8
Geodetic Sets in Graphs
207
Œai ; bi Zi of length di D bi ai . We say that vertices u and v of a graph G which is isometrically embedded in Zn are antipodal if d.u; v/ D d1 C d2 C C dn . A profile D .x1 ; : : : ; xk / on a graph G is a finite sequence of vertices of G. Given a profile on G and a vertex u of G, the remoteness D.u; / see [67] is D.u; / D
X
d.u; x/:
x2
Theorem 7. Let G be a median graph. Then the following assertions are equivalent: (i) g.G/ D 2. (ii) G can be obtained by a sequence of peripheral expansions from K1 such that in each peripheral expansion step the convex subgraph with respect to which the expansion is performed has a nonempty intersection with some minimum geodetic set [10]. (iii) There exist vertices a; b in V .G/ and an a; b-geodesic ˘ such that every -class in G has an edge on ˘ [10]. (iv) G can be isometrically embedded in Zn in such a way that there exist antipodal vertices a and b [10]. (v) pt.G/ D 2 [3]. (vi) D.x; / is constant on G for some profile [3]. Characterizations (iii) and (iv) hold also in the more general case of partial cubes. A geometric interpretation of characterization (iv) is that a partial cube G n has a geodetic set fa; Qnbg if and only if G can be isometrically embedded into Z in such a way that i D1 Œai ; bi contains V .G/. The characterization (vi) answers the following question from location theory: for which median graphs G is their vertex-set the (anti)median set of some profile on G; see [3] for more details. The fifth characterization leads to the question of whether there is a general connection between the geodetic number of a median graph and the structure that is derived from intersecting peripheral subgraphs. For this purpose the periphery graph P .G/ of a median graph G was introduced in [11] as the graph whose vertices are peripheral subgraphs in G and two vertices are adjacent in P .G/ if and only if the peripheral subgraphs intersect. It was proved that there are median graphs whose periphery graph has independence number 2, and have arbitrarily large geodetic number; see also [4].
8.4 Algorithms and Complexity Harary et al. [52] observed that finding the geodetic number of a graph is an NPhard problem with its decision variation being NP-complete. Douthat and Kong showed that the decision problem regarding the geodetic number of a graph remains NP-complete when restricted to the class of chordal graphs [43], and when restricted
208
B. Breˇsar et al.
to the class of bipartite graphs [42]. They also noted that the problem becomes polynomially solvable in the class of split graphs. Atici later showed that the following more general decision problem is NP-complete: given a graph G and an integer k jV .G/j, is there a set S V .G/ with jS j D k such that I ŒS D V .G/ [1]. In [52] an algorithm for finding the geodetic number is also proposed. However, Hansen and van Omme [51] observed that the approach from [52] has a serious mistake and presented an example for which the algorithm fails and does not produce a geodetic set. They proposed another approach by developing a 0–1 integer programming model to find the geodetic number of a graph. We present it next. For each vertex vk 2 V .G/ consider all geodesics passing through vk . This can be easily done once the distance matrix of G is known, by finding pairs of vertices forming the following set Pk D f.vi ; vj / j d.vi ; vk / C d.vk C vj / D d.vi ; vj /; i < j g: Let S denote a minimum geodetic set of G. The idea is then to define binary variables of two types: xk , 1 k jV .G/j, and yij , where .vi ; vj / 2 Pk and it holds that ( 1; if vk 2 S xk D 0; if vk … S and
( yi;j D
1; if vi ; vj 2 S 0; otherwise
The following model then constructs a minimum geodetic set: Minimize
n X
xk
kD1
subject to
X
1 xk
yij ;
vk 2 V .G/;
(8.2)
.vi ;vj /2Pk
yij xi ;
i D 1; : : : ; n;
(8.3)
yij xj ;
j D 1; : : : ; n;
(8.4)
i; j D 1; : : : ; n;
(8.5)
xi C xj 1 yij ;
and all variables are either 0 or 1. In the objective function we want to minimize the size of a geodetic set. The first inequality ensures that I ŒS D V .G/, and inequalities (8.3)–(8.5) force all variables
8
Geodetic Sets in Graphs
209
yij to be 0 or 1, depending on whether vi and vj belong to a minimum geodetic set or not. Finally, we note that in [52] results of some computational experiments were also given. Nonetheless graphs with geodetic number 2 can be recognized in polynomial time. One needs to determine all diametrical vertices and check whether every diametrical vertex has a unique vertex realizing its eccentricity. For all such diametrical pairs, then check whether every other vertex lies on the interval between the pair. Clearly this can be done in polynomial time by using a distance matrix. Median graphs with g.G/ D 2 can be recognized even more efficiently. The fastest recognition algorithm for median graphs is of complexity O..m log n/1:41 / and is due to Imrich and Klavˇzar [61]. The exponent 1:41 stands for 2!=.! C 1/, where ! denotes the exponent of matrix multiplication with its current value 2.376; see [39]. By the result of Imrich et al. [60] the recognition complexity of median graphs is closely related to the recognition complexity of triangle-free graphs. Therefore improving the recognition complexity of median graphs is believed to be very difficult. Some classes of median graphs can be recognized faster. For example, planar median graphs can be recognized in linear time [60] and graphs of acyclic cubical complexes can be recognized in O.m log n/ time; see [59]. We follow with the result from [3] about the recognition of median graphs with g.G/ D 2 in O.m log n/ time. This is possible because of the upper bound on the maximum degree of a median graph with geodetic number two and the fact that every peripheral subgraph meets any geodetic set; see Theorem 7(ii). The mentioned upper bound reads as follows. Lemma 2. [3] If G is a median graph with g.G/ D 2, then .G/ 2 log2 n. Moreover, if .G/ 2 log2 n one can check in O.m log n/ time whether G is a median graph, and determine all -classes and all Uab sets. The next lemma describes all geodetic sets of G D pe.H I P / with regard to H . Lemma 3. [3] Let G D pe.H I P / be a median graph and fx; yg a geodetic set of H , where y 2 P . Then the set fx; zg, where z is the neighbor of y in GnH , is a geodetic set in G. Moreover, all minimum geodetic sets of G are of this form. If fx; yg is a geodetic set in G then this is the only minimum geodetic set containing x, since, by Lemma 3, x is uniquely determined by y and vice versa. Moreover, it also follows that for a median graph G D pe.H I P / with g.G/ D 2, all minimum geodetic sets of G can be obtained from the minimum geodetic sets of H in O.jP j/ time. Therefore if the representation of G as a sequence of peripheral expansions, starting from K1 , is known, then all minimum geodetic sets of G can be obtained in O.n/ time. It remains then to find efficiently the representation of G by a sequence of peripheral expansions starting from K1 . Theorem 8. [3] Let G be a median graph with .G/ 2 log2 n. Then a representation of G by a sequence of peripheral expansions can be found in O.m log n/ time.
210
B. Breˇsar et al.
In the proof of Theorem 8 the following idea is used: the peripheral Uab -sets are characterized by the fact that @Uab consists of jUab j independent edges that meet every vertex of a Uab -set, where @Uab is the set of edges with one endvertex in Uab and the other in G n Uab . In other words, Uab is peripheral if degG .v/ D degUab .v/ C 1; for every v 2 Uab . Clearly degUab .v/ C 1 degG .v/ for v 2 G. Thus, setting exUab .v/ D degG .v/ degUab .v/ 1 it is clear that Uab is peripheral if and only if ex.Uab / D
X
exUab .v/ D 0:
v2Uab
If fx; yg is a geodetic set then a pair x and y is called a geodetic pair. Using the ideas described above an algorithm is presented in [3] that recognizes whether a given graph G is a median graph with g.G/ D 2, and can be implemented to run within the time complexity O.m log n/. In the case where G is a median graph with g.G/ D 2 the algorithm also gives the list of all geodetic pairs of G. The algorithm does the following. First it checks whether the maximum degree of G is bounded by 2 log2 n. If the answer is positive, it checks whether G is also a median graph, and in which case it determines all -classes and all Uab sets. Next it computes the value of ex.Uab / for all Uab sets and then determines a peripheral Uab set and removes it. Until one gets K1 , this dismantling procedure is repeated (at each step a peripheral Uab set is determined and removed). Next we construct G back again starting from K1 by a sequence of peripheral expansions, taking care of all geodetic pairs using Lemma 3. If at any step there are no such pairs, then g.G/ > 2. Otherwise the algorithm also lists all geodetic pairs. As observed above, it can be implemented to run in O.m log n/ time.
8.5 Boundary and Geodetic Sets The study of abstract convexity spread in the early 1950s, and resulted in a purely axiomatic definition of convex sets that generalizes the classical concept of convexity in Euclidean spaces (see a survey on this topic [80], or [17] for a brief introduction to the abstract convexity in graphs). In this section we present results in which problems arising in convexity theory relate to geodetic sets. Recall that a subset W of the vertex set of a graph G is convex if for any two vertices u; v 2 S , I.u; v/ is a subset of S . The smallest convex set containing S is called the convex hull of S and is denoted by CH.S /. The operation of geodetic closure is somewhat similar to the convex hull operation. In fact, the concept of the geodetic set can be regarded as a variation of the following concept introduced
8
Geodetic Sets in Graphs
211
by Everett and Seidman [47]. The set S for which CH.S / D V .G/ is called the hull set of a graph G, and the size of a minimum hull set of G is called the hull number of G, denoted h.G/. Given a set S of vertices in a graph G, it is clear that I ŒS CH.S /. Hence, if S is a geodetic set of G then also CH.S / D V .G/, and so for any graph G, h.G/ g.G/. Much work concerning the hull number of graphs was done by Chartrand and Zhang, see [32] for some additional references on these studies. The hull number of median graphs was considered by Mulder [73], showing that h.G/ D pt.G/ for any median graph G. The hull number of Cartesian products of graphs was studied in Cagaanan and Canoy [20,21], where it was shown that h.GH / D maxfh.G/; h.H /g. Canoy et al. [22] considered the hull and the geodetic number of joins of two graphs. Given a graph G and a convex set S V .G/, a vertex v 2 S is called an extreme vertex of S if S n fvg is also convex. A graph G is called a convex geometry if every convex set of G is the convex hull of its extreme vertices (this property is also called the Minkowski–Krein–Milman property [48, 62, 65]). Graphs with this property are properly contained in the class of distance hereditary graphs [17]. A connected graph G is distance hereditary if for every connected induced subgraph H of G and every two vertices u; v 2 H , dH .u; v/ D dG .u; v/ [57]. A graph is chordal if it contains no induced cycle of length greater than 3 and a chordal graph is called Ptolemaic if it is distance hereditary. Farber and Jamison [48] proved that a graph G is a convex geometry if and only if G is Ptolemaic. Hence, if S is a convex set in a Ptolemaic graph G, then we can rebuild the set S from its extreme vertices using the convex hull operation. This cannot be done with every graph, however, C´aceres et al. [17] extended the set of extreme vertices of S to the contour set, C t.G/, that enables one to rebuild S using the vertices in C t.G/ and the convex hull operation. The contour set C t.G/ of a graph G is defined by Ct.G/ D fv 2 V .G/ j ecc.u/ ecc.v/ ; 8u 2 NG .v/g: Theorem 9. [17] Let G be a graph and S a convex subset of vertices. Then S D CH.C t.S //. In order to find the convex hull of a set S one can start by taking the union of intervals over all pairs of vertices of S . Hence, one may ask whether the geodetic closure of the contour of S equals S . More specifically, when the contour set of a graph is also its geodetic set, we have the following (partial) result. Theorem 10. [17] Let G be a distance hereditary graph. Then C t.G/ is a geodetic set for G. The geodeticity of the contour C t.G/ and other related sets was also studied in [18, 19, 33, 36]. The vertex v is said to be a boundary vertex of u if no neighbor of v is farther away from u than v. By @.u/ we denote the set of all boundary vertices of u. Hernando et al. [55] proved that fug [ @.u/ is a geodetic set for an arbitrary vertex u 2 V .G/. The boundary @.G/ of a graph G is the set of all of its boundary vertices [33].
212
B. Breˇsar et al.
Theorem 11. [18] The boundary @.G/ of any connected graph G is a geodetic set. In fact this result follows from the stronger result that the so-called expanded contour ˝.G/ D C t.G/ [ Ecc.C t.G// of every connected graph G is geodetic [18]. (Recall that eccentricity Ecc.G/ is the set of eccentric vertices of a graph, where a vertex v is called an eccentric vertex of G if no vertex in V .G/ is farther away from some vertex u 2 V .G/ than v.) In [19] the geodeticity of significant subsets of the boundary (periphery, contour set, and eccentricity) was studied for the class of perfect graphs. There are examples of perfect graphs for which neither Per.G/, Ecc.G/, nor Ct.G/ are geodetic sets [16]. However, the contour set of a graph is also geodetic in several perfect graph classes (we have already mentioned that distance hereditary graphs possess this property). In particular, this is true for chordal graphs Theorem 12. [19] The contour set of every chordal graph is a geodetic set. The state of the art on this topic is presented in [19]. The main open problem is still the case of bipartite graphs (namely, whether the contour set of any bipartite graph is a geodetic set). In particular this was conjectured for median graphs [10]. In [18] the question was posed whether the geodetic closure of the contour set I ŒC t.G/ is always a geodetic set. The authors approached this question by trying to prove that for every graph G its expanded contour ˝.G/ is contained in I ŒC t.G/ but this still remains an open problem. However, they obtained a number of conditions under which the contour set of a graph is a geodetic set or at least the geodetic closure of the contour set is geodetic. The following partial results were proved in [18]. Theorem 13. [18] Let G be a connected graph. Then C t.G/ is a geodetic set if one of the following is true: (i) jC t.G/j D 2. (ii) C t.G/ D Per.G/. Theorem 14. [18] For a connected graph G the geodetic closure of C t.G/ is a geodetic set if one of the following conditions is fulfilled: Ecc.C t.G// I ŒC t.G/. C t.G/ n Per.G/ D fy1 ; : : : ; yk g and ecc.yi / D ecc.yj /, for each i; j D 1; : : : ; k. (iii) jC t.G/j D jPer.G/j C 1. (iv) jC t.G/j D 3. (i) (ii)
8.6 Related Concepts Several concepts can be found in the literature that in various ways relate to geodetic sets and the geodetic number. We briefly present some of them without an ambition
8
Geodetic Sets in Graphs
213
to give deeper insights, yet an interested reader is directed to appropriate references. Note that the ideas from convexity theory that are related to geodeticity were presented in Sect. 8.5. The first group of related concepts pertains to variations of intervals that arise from betweenness structures (for the notion of betweenness we refer to [69, 74]), different from the shortest paths. Typical instances of such intervals come from the so-called monophonic (i.e., induced) paths and detour (i.e., longest) paths between two vertices, which also yield the corresponding monophonic convexity [44, 69] and the detour distance in graphs [38]. A set S of vertices in a graph G is called monophonic if for every vertex x 2 V .G/ there exist u; v 2 S such that x lies on an induced (i.e., chordless) path between u and v. It was shown in [56] that the contour set in any connected graph is a monophonic set (as we know from Sect. 8.5 it is not always a geodetic set). Similarly, a set S of vertices in a graph G is called a detour set if for every vertex x 2 V .G/ there exist u; v 2 S such that x lies on a detour (i.e., longest) path between u and v. The size of a minimum detour set in a graph G is called the detour number of G. These concepts were investigated in two papers by Chartrand et al. [35, 37]. Another interval variation (the Steiner interval) is of different flavor since it may apply to more than two vertices. Given a graph G and a set of vertices W V .G/, the Steiner tree of W is a minimum (with respect to the number of edges) connected subgraph that contains all vertices of W (it follows easily from the definition that this subgraph is a tree). The Steiner interval S ŒW of a set W consists of all vertices in G that lie on some Steiner tree of W ; see [66]. A set W V .G/ is called a Steiner set of a graph G, if S ŒW D V .G/, and the Steiner number sn.G/ of G is the size of a smallest Steiner set of G. The first general results about the Steiner number in graphs were obtained by Chartrand and Zhang [28]. For instance, they proved that for any positive integers r, d , and k 2, where r d 2r there exists a graph G with diam.G/ D d , rad.G/ D r, and sn.G/ D k. They also observed that for every pair of integers k and n with 2 k n there exists a graph of order n whose Steiner number is k. Unfortunately, as noted by Pelayo [77], it was erroneously stated (and “proved”) in [28] that every Steiner set in a connected graph is a geodetic set. (In addition, Pelayo [77] constructed a graph G for which g.G/ is greater than sn.G/ [77].) This motivated Hernando et al. [54] to address the problem of characterizing the graphs in which every Steiner set is also a geodetic set. They obtained some partial results on this problem, namely that all connected interval graphs have this property, but not all connected chordal graphs. In addition they investigated relations among geodetic, monophonic, Steiner, and hull sets, and proved that every Steiner set in a connected graph is a monophonic set [54]. In particular this implies that in distance hereditary graphs every Steiner set is a geodetic set [54]. The latter result was independently obtained by Oellermann and Puertas [76] who also showed that g.G/=sn.G/ can be arbitrarily large if G is not a distance hereditary graph [76]. It was recently proved by Eroh and Oellermann that every Steiner set is a geodetic set in the class of 3-Steiner distance hereditary graphs [46]. However, in general this problem remains open.
214
B. Breˇsar et al.
Geodetic sets can be studied in directed graphs as well. Chartrand and Zhang [27] introduced the geodetic number of an oriented graph as follows. Let D be an oriented graph, and S V .D/. Then I ŒS is the set of all vertices that lie on some shortest (directed) u; v-path for u; v 2 S . The minimum size of a set S such that I ŒS D V .D/ is called the geodetic number of an oriented graph D. Recall that given a graph G, an orientation of G is an oriented graph obtained from G by orienting all of its edges to one of the two directions. Now, if G is a graph, then the lower orientable geodetic number g .G/ of G is the minimum geodetic number among all orientations of G, and the upper orientable geodetic number g C .G/ of G is the maximum such geodetic number [27]. It was proved that for every connected C graph G of order at least n3, g .G/ < g .G/, and for every two integers n and m with 1 n 1 m 2 , there exists a connect