Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Standard view
Full view
of .

1.10.2.Intersection
1.10.3.Sum of two graphs
1.10.4.Ring sum
1.10.5.Product of graphs
1.10.6.Composition
1.10.7.Complement
1.10.8.Fusion
1.11THE PROBLEM OF RAMSEY : 1.4
1.12CONNECTED AND DISCONNECTED GRAPHS
1.12.1.Path graphs and cycle graphs
1.12.2.Rank and nullity
1.13WALKS, PATHS AND CIRCUITS
1.13.3.Circuit
1.13.4.Length
1.14EULERIAN GRAPHS
1.14.1.Euler path
1.14.2.Euler circuit
1.15FLEURY’S ALGORITHM
1.16HAMILTONIAN GRAPHS
1.19PROBLEM OF SEATING ARRANGEMENT 1.109
1.20TRAVELING-SALESMAN PROBLEM
1.21KÖNIGSBERG’S BRIDGE PROBLEM
1.22REPRESENTATION OF GRAPHS
1.22.1.Matrix representation
1.22.2. (a) Representation of undirected graph
1.22.2 (b) Representation of directed graph
1.22.3.Incidence matrix
1.22.3. (a) Representation of undirected graph
1.22.3. (b) Representation of directed graph
Problem Set 1.1
INTRODUCTION
2.1COMBINATORIAL AND GEOMETRIC GRAPHS (REPRESENTATION)
Planar Graphs
2.2PLANAR GRAPHS
2.3KURATOWSKI’S GRAPHS
2.4HOMEOMORPHIC GRAPHS
2.5REGION
2.6MAXIMAL PLANAR GRAPHS
2.7SUBDIVISION GRAPHS
2.8INNER VERTEX SET
2.9OUTER PLANAR GRAPHS
2.9.1.Maximal outer planar graph
2.9.2.Minimally non-outer planar graphs
2.10CROSSING NUMBER
2.11BIPARTITE GRAPH
2.11.1.Complete bipartite graph
2.12EULER’S FORMULA
2.12.2.Kuratowski’s Theorem
2.13DETECTION OF PLANARITY OF A GRAPH :
2.14DUAL OF A PLANAR GRAPH
2.14.1.Uniqueness of the dual
2.14.2.Double dual
2.14.3.Self-dual graphs
2.14.4.Dual of a subgraph
2.14.5.Dual of a homeomorphic graph
2.14.6.Abstract dual
2.14.7.Combinatorial dual
2.16 CHROMATIC POLYNOMIAL
Problem Set 2.1
3.1.1.Acyclic graph
! Trees
3.2 SPANNING TREE
3.2.1.Branch of tree
3.3.1.Co tree
3.4.1.Path length of a binary tree
3.4.2.Binary tree representation of general trees
3.5.COUNTING TREES
3.6.TREE TRAVERSAL
3.6.1.Preorder traversal
3.6.2.Postorder traversal
3.6.3.Inorder traversal
3.7.COMPLETE BINARY TREE
3.7.1.Almost complete binary tree
3.7.2.Representation of algebraic structure of binary trees
3.8.INFIX, PREFIX AND POSTFIX NOTATION OF AN ARITHMETIC EXPRESSION
3.8.1.Infix notation
3.8.2.Prefix notation
3.8.3.Postfix notation
3.8.4.Evaluating prefix and postfix form of an expression
3.9.BINARY SEARCH TREES
3.9.1.Creating a binary search tree
3.10.STORAGE REPRESENTATION OF BINARY TREE
3.10.1.Sequential Representation
3.11.ALGORITHMS FOR CONSTRUCTING SPANNING TREES
3.11.1.BFS algorithm
3.11.2.DFS algorithm
3.12.TREES AND SORTING
3.12.1.Decision trees
3.12.2.The complexity of sorting algorithms
3.12.3.The merge sort algorithms
3.13.WEIGHTED TREES AND PREFIX CODES
3.13.1.Huffman coding
3.14. MORE APPLICATIONS
3.14.1.The minimum connector problem
3.14.2.Enumeration of chemical molecules
3.14.3.Electrical neworks
Problem Set 3.1
4.1SHORTEST PATH ALGORITHMS
4.2DIJKSTRA’S ALGORITHM
" Optimization and Matching
4.2.1.Dijkstra’s algorithm (Improved)
4.2.2.Floyd-Warshall algorithm
4.3.4.Kruskal’s algorithm
4.3.5.Prim’s algorithm
4.3.6.The labeling algorithm
4.3.7.Reachability
4.3.8.Distance and diameter
4.3.9.Cut vertex, cut set and bridge
4.3.10.Connected or weakly connected
4.3.11.Unilaterally connected
4.3.12.Strongly connected
4.3.13.Connectivity
4.3.14.Edge connectivity
Problem Set 5.1
6.15COMPOSITION OF PERMUTATION
6.17CYCLE INDEX OF A PERMUTATION GROUP
6.18CYCLE INDEX OF THE PAIR GROUP
6.19EQUIVALENCE CLASSES OF FUNCTIONS
Theorem 6.14.Power Group Enumeration Theorem
0 of .
Results for:
P. 1
Graph Theory With Applications

# Graph Theory With Applications

Ratings: (0)|Views: 11,730|Likes:

### Availability:

See more
See less

08/15/2013

pdf

text

original

Pages 10 to 170 are not shown in this preview.
Pages 180 to 258 are not shown in this preview.
Pages 268 to 304 are not shown in this preview.
Pages 314 to 424 are not shown in this preview.
Pages 434 to 487 are not shown in this preview.