By R. Balakrishnan, K. Ranganathan

Graph conception skilled a huge progress within the twentieth century. one of many major purposes for this phenomenon is the applicability of graph thought in different disciplines comparable to physics, chemistry, psychology, sociology, and theoretical computing device technology. This textbook offers a high-quality historical past within the uncomplicated issues of graph conception, and is meant for a complicated undergraduate or starting graduate direction in graph theory.

This moment version comprises new chapters: one on domination in graphs and the opposite at the spectral homes of graphs, the latter together with a dialogue on graph power. The bankruptcy on graph hues has been enlarged, protecting extra issues comparable to homomorphisms and colors and the distinctiveness of the Mycielskian as much as isomorphism. This publication additionally introduces numerous attention-grabbing issues resembling Dirac's theorem on k-connected graphs, Harary-Nashwilliam's theorem at the hamiltonicity of line graphs, Toida-McKee's characterization of Eulerian graphs, the Tutte matrix of a graph, Fournier's evidence of Kuratowski's theorem on planar graphs, the evidence of the nonhamiltonicity of the Tutte graph on forty six vertices, and a concrete program of triangulated graphs.

**Read Online or Download A Textbook of Graph Theory PDF**

**Similar graph theory books**

This quantity bargains with numerous difficulties concerning cycles in graphs and circuits in digraphs. prime researchers during this quarter current the following three survey papers and forty two papers containing new effects. there's additionally a suite of unsolved difficulties.

**Proceedings of the International Conference on Finite Geometries and Combinatorial Structures**

The ebook claims to be a successor of Prof. Bollobas' e-book of an identical name. in contrast to Prof. Bollobas' e-book, i don't imagine this one is an excellent textbook: The proofs of many theorems are usually not given, however the reader is directed to a few resource; those theorems are usually not of a few unrelated topic, yet their subject is random graphs.

- Geometry processing for design and manufacturing
- Algebraic Graph Theory: Morphisms, Monoids and Matrices
- Pancyclic and Bipancyclic Graphs
- Graph Theory and Its Applications to Problems of Society

**Extra resources for A Textbook of Graph Theory**

**Sample text**

Show that the automorphism group of Kn (or Knc ) is isomorphic to the symmetric group Sn of degree n: In contrast to the complete graphs for which the automorphism group consists of every bijection of the vertex set, there are graphs whose automorphism groups consist of just the identity permutation. Such graphs are called identity graphs. 4. The graph G shown in Fig. 21 is an identity graph. Proof. v/ D d. 1). 6 Automorphism of a Simple Graph 19 Fig. u7 / D u7 on degree consideration. 2. 3. 4.

1. 2. 1. The line graph of a simple graph G is a path if and only if G is a path. Proof. Let G be the path Pn on n vertices. G/ is the path Pn 1 on n 1 vertices. G/ be a path. G/ with at least three vertices. Hence, G must be either a cycle or a path. But G cannot be a cycle, because the line graph of a cycle is again a cycle. 3. H / if G is the graph of Fig. 22. 4. v/ 2 may not be valid if G has a loop. 5 shows. 5. Prove that a simple connected graph G is isomorphic to its line graph if and only if it is a cycle.

95]. Further, a comprehensive account of applications of graph theory to chemistry is given in Refs. [176, 177]. 4* is due to H. Whitney [193], and the proof given in this chapter is due to J¨ung [118]. 1 Introduction Directed graphs arise in a natural way in many applications of graph theory. The street map of a city, an abstract representation of computer programs, and network flows can be represented only by directed graphs rather than by graphs. Directed graphs are also used in the study of sequential machines and system analysis in control theory.