{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

PS01-100121

# PS01-100121 - G Prove that G is connected if there is a...

This preview shows page 1. Sign up to view the full content.

MATH 682 Problem Set #1 This problem set is due at the beginning of class on January 21 . Below, “graph” means “simple finite graph”. 1. (10 points) Prove that if graph G is connected and contains a cycle, then there is an edge e in G such that G - e is still connected. 2. (15 points) Recall that α ( G ), ω ( G ), δ ( G ), and Δ( G ) are the independence number, clique number, minimum degree, and maximum degree of G respectively: (a) (5 points) Prove that ω ( G ) Δ( G ) + 1 and that α ( G ) ≤ | G | - δ ( G ). (b) (5 points) Give a construction mechanism for a graph G where δ ( G ) is arbitrarily large but ω ( G ) = 2. (c) (5 points) Prove that ω ( G ) + α ( G ) ≤ | G | + 1. 3. (10 points) Prove that for any connected graph G such that | G | > Δ( G ) k - 1 Δ( G ) - 1 and vertex u thereof, there is a vertex v G such that d ( u, v ) k . 4. (5 points) Let A be the adjacency matrix of graph
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: G . Prove that G is connected if there is a value of k such that A k has no zero entries; show additionally that the converse is not necessarily true. 5. (5 point bonus) Prove that every tree T has at least Δ( T ) leaves. The origins of graph theory are humble, even frivolous. Whereas many branches of mathematics were motivated by fundamental problems of calculation, motion, and measurement, the problems which led to the development of graph theory were often little more than puzzles, designed to test the ingenuity rather than to stimulate the imagination. —Biggs, Lloyd, and Wilson, Graph Theory: 1736–1936 Page 1 of 1 Due January 21, 2010...
View Full Document

{[ snackBarMessage ]}

Ask a homework question - tutors are online