What people are saying - Write a review
We haven't found any reviews in the usual places.
PART ONE GRAPHS AND DIGRAPHS
12 other sections not shown
adjacency lists adjacency matrix adjacent nodes algorithm automorphism begin bipartite graph Buckley characterized classes of graphs clique complete graphs component concept connected graph convex Corollary cutnode dd(G Determine digraph disconnected Discrete Math disjoint distance degree sequence distance matrix distance-hereditary distance-regular distance-regular graphs distance-transitive distance-transitive graphs eccentric node edges of G endnodes eulerian G contains G is connected geodetic graphs gn(G graph G graph in Figure graph of order Graph Theory hamiltonian cycle hamiltonian graph Harary induced subgraph input integer isomorphic labeled least Let G line graph maximum number minimum n-connected nodes in G nodes of degree nodes of G nonadjacent nodes nontrivial number of edges number of nodes obtained pair of nodes path joining Petersen graph polynomial problem radius regular graphs result set of nodes showed Slater spanning path spanning tree strong digraph strongly regular graph Theorem tournament unique weight