Unformatted text preview: no edges, and H to be the subgraph of G that consists of one of those vertices. Then & ( H ) = 1 < 2 = & ( G ) . 4. Construct a graph G and a subgraph H of G so that & ( H ) > & ( G ) and ! ( H ) < ! ( G ) . What are the numbers & ( H ) , & ( G ) and ! ( H ) for your example ? The simplest example is to take G to be a graph with two vertices and one edge between them, and H to be the subgraph of G with the same vertices but no edges. Then & ( H ) = 2 > 1 = & ( G ) while ! ( H ) = 1 < 2 = ! ( G ) ....
View Full Document
- Spring '08
- Glossary of graph theory, vertices, Adam Copeland, subgraph