They contain an introduction to basic concepts and results in graph theory, with a special emphasis put on the networktheoretic. Maximum independent vertex set a maximal independent vertex set of g with maximum number of vertices is called as the maximum independent vertex set. Berge includes a treatment of the fractional matching number and the fractional edge. Connected a graph is connected if there is a path from any vertex. Each edge may act like an ordered pair in a directed graph or an unordered. A graph g is an ordered pair v, e, where v is a finite set and graph, g e. Among the fields covered by discrete mathematics are graph and hypergraph theory, network theory, enumeration, coding theory, block designs, the combinatorics of. Notes on extremal graph theory iowa state university.
Show that if every component of a graph is bipartite, then the graph is bipartite. A set is independent if and only if it is a clique in the graphs complement, so the two concepts are complementary. All graphs in these notes are simple, unless stated otherwise. A simple graph is a nite undirected graph without loops and multiple edges. This is a list of graph theory topics, by wikipedia page see glossary of graph theory terms for basic terminology. Clique, independent set in a graph, a set of pairwise adjacent vertices is called a clique.
S1 e s2 e, f s3 a, g, c s4 e, d s2 and s3 are maximal independent vertex sets of g. Graph theory 121 circuit a circuit is a path that begins and ends at the same vertex. Notes on graph theory james aspnes december, 2010 a graph is a structure in which pairs of vertices are connected by edges. Prove that if a graph has exactly two vertices of odd degrees, then they are connected by a path. Equivalently, each edge in the graph has at most one endpoint in. Independent set graph theory in graph theory, an independent set or stable set is a set of vertices in a graph, no two of which are adjacent. The number of independent sets of tricyclic graphs. That is, it is a set of vertices such that for every two vertices in, there is no edge connecting the two. One of the basic problems in graph theory is to select a minimum set sof vertices in such a way that each vertex in the graph is uniquely determined by its distances to the chosen vertices. Again, everything is discussed at an elementary level, but such that in the end students indeed have the feeling that they. Example consider the following subsets from the above graph.
Graph theory, branch of mathematics concerned with networks of points connected by lines. However l 1 is not an independent line set, as for making an independent line set, there should be at least two edges. Eigenvalues of graphs is an eigenvalue of a graph, is an eigenvalue of the adjacency matrix,ax xfor. Graph theory history francis guthrie auguste demorgan four colors of maps. In an undirected graph, an edge is an unordered pair of vertices. A graph g is an ordered pair vg, eg, where vg is a set of vertices, eg is a set of. The subject of graph theory had its beginnings in recreational math problems see number game, but it has grown. In the figure below, the vertices are the numbered circles, and the edges join the. Berges fractional graph theory is based on his lectures delivered at the indian statistical institute twenty years ago. The following is a list of basic graph notions and notations. As regards nvertex unicyclic graphs, the maximum number of independent sets is attained for the graph that results from attaching n. The size of an independent set is the number of vertices it contains. A graph g is a pair of sets v and e together with a function f.
Fractional graph theory applied mathematics and statistics. The notes form the base text for the course mat62756 graph theory. I want to talk about two independent sets and two covers. This book is intended to be an introductory text for graph theory. Free graph theory books download ebooks online textbooks. A complete graph is a simple graph whose vertices are. Graph is a mathematical representation of a network and it describes the relationship between lines and points. A circuit starting and ending at vertex a is shown below. A graph is rpartite if its vertex set can be partitioned into rclasses so no edge lies within a class. In recent years, graph theory has established itself as an important mathematical tool in a wide variety of subjects, ranging from operational research and chemistry to. If the components are divided into sets a1 and b1, a2 and b2, et cetera, then let a iaiand b ibi. In mathematics, graph theory is the study of graphs, which are mathematical structures used to model pairwise relations between objects.
In graph theory, an independent set, stable set, coclique or anticlique is a set of vertices in a graph, no two of which are adjacent. Basic concepts in graph theory the notation pkv stands for the set of all kelement subsets of the set v. The size of a maximum clique in gis called the clique number of gand is denoted. In recent years, graph theory has established itself as an important mathematical tool in a wide variety of subjects, ranging from operational research and chemistry to genetics and linguistics, and from electrical engineering and geography to sociology and architecture. The novel feature of this book lies in its motivating discussions of the theorems and definitions. An independent line set is said to be the maximal independent line set of a graph g if no other edge of g can be added to l. The set v is called the set of vertex, edgevertices. I guarantee no accuracy with respect to these notes and i certainly do not guarantee completeness or proper attribution. Consider the following subsets from the above graphs. Have learned how to read and understand the basic mathematics related to graph. Notation to formalize our discussion of graph theory, well need to introduce some terminology. Reinhard diestel graph theory 5th electronic edition 2016 c reinhard diestel this is the 5th ebook edition of the above springer book, from their series graduate texts in mathematics, vol. A graph in this context is made up of vertices also called nodes or.
A graph consists of some points and lines between them. There are two special types of graphs which play a central role in graph theory, they are the complete graphs and the complete bipartite graphs. Graph theory is the study of mathematical objects known as graphs, which consist of vertices or nodes connected by edges. We know that contains at least two pendant vertices. Chartlands other book on graph theory has great examples and applications, however, this book has fewer but provides better instruction. A first course in graph theory dover books on mathematics. This is a great selfstudy, especially if you had graph theory in. This settles a conjecture of alon in 1991 and kahn in 2001. Shown below, we see it consists of an inner and an. This concept was introduced by slater 29 who called such a set as a locating set.
371 859 349 430 943 301 982 1570 1610 906 1377 426 1142 119 1106 773 778 341 1329 662 675 193 478 876 920 143 1116 628 865