Glossary of Notation Non- Iphabetie notation adjacency relation successor relation (digraph) {isomorphism relation relation floor of number ceiling of number (en) absolute value of number size of set Ix: PCe)} set description infinity subgraph subgraph of G induced by $ complement of graph or set (planar) dus! th power of graph set of &-tuples from $ edge cut souree-sink cut deletion of vertex deletion of edge contraction of edge G+H disjoint union of graphs GVH join of graphs Gon cartesian product of graphs symmetric difference vertex duplication ‘vertex multiplication AxB cartesian product of sets difference of ets binomial oofeient ("..) multinomial coefficient 1 reveetor with all entries 1 vix Conditional variable or event Roman alphabet Ayo. oty a. dato) awd) D Dx) alu) diam G deta EG) EW) ec) Fur £08) Ponts) adjacency matrix adjugate matrix bandwidth bases of matroid circuits of matroid ‘gele with n vertices power of a eyele number of components circumference (Hamiltonian) closure cost or capacity capacity ofa cut degree sequence Aogroe of vertox outedegree, indegree digraph distance sum distance from u tov diameter determinant edge set expeetod value size (number of edges) {otal exiting flow total entering flow function, low umber of faces iraph (or digraph) random graph in Model A Harary graph independent sets of matroid identity matrix matrix of ali U's ‘complete graph complete bipartite graph line graph lower bound on flow continued on inside back cover Introduction to Graph Theory Second Edition Douglas B, West University of Illincis — Urbana‘The author and publisher of this book have used their best forts in preparing this book. These efforts include the development, research, and testing ofthe theores and programs to determine their effectiveness, The author and publisher make no warranty af any kind, expressed or implied, with regard to these programs or the documentation contained inthis boos. The author and publisher shall not be lable in any event for incidental or consequential damages in connection with, or arising out of, the furnishing, performance, or use ofthese programs. Copyright © 2001 by Pearson Education, Inc. ‘This edition is published by arrangement with Pearson Education, Inc. All rights reserved. No part of this publication may be reproduced, stored in a database or retrieval system, fr transmitted in any form or by auy means, electronic, mechanical, photocopying, recording, or otherwise, ‘without the prior written permission of the publisher. ISBN 81-7808-830-4 First Indian Reprint, 2002 This edition is manufactured in India and is authorized for sale only in India, Bangladesh, Pakistan, ‘Nepal, Sri Lanka and the Maldives. Published by Pearson Education (Singapore) Pte. Ld, Indian Branch, 482 F-LE. Patparganj, Delhi 110 092, India Printed in India by Rashtriya Printers For my dear wife Ching and for all lovers of graph theoryContents Preface Chapter 1 Fundamental Concepts 1.1. What Is a Graph? ‘The Definition, 1 Graphs as Models, 3 Matrices and Isomorphism, 6 ‘Decomposition and Special Graphs, 11 Exercises, 14 12. Paths, Cycles, and Trails Connection in Graphs, 20 Bipartite Graphs, 24 Bulerian Cireuits, 26 Exercises, 31 1.3. Vertex Degrees and Counting Counting and Bijections, 35 Extremal Problems, 38 Graphic Sequences, 44 Exercises, 47 14 Directed Graphs Definitions and Examples, 53 ‘Vertex Degrees, 58 Eulerian Digraphs, 60 Orientations and Tournaments, 61 Exercises, 63 19