We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 2
MAIN CAMPUS
WTW624'
UNIVERSITY OF THE FREE STATE
EXAMINATION: JUNE 2010
ASSESSOR: Dr. 8. Dorfling
MODERATOR: Prof. E. Jonck (UJ)
TIME: 3 hours MARKS: 100
MOTIVATE ALL ANSWERS!
PART A [50)
1, Prove that for every graph G and every integer r > A(G), there exists an r-regular graph
containing G as an induced subgraph.
2. Prove that a graph G is the periphery of some connected graph iff every vertex of G has
eccentricity 1 or no vertex of G has eccentricity 1
3. State and prove a characterization for an edge ¢ in a graph G to be a bridge of G.
4, Prove that all disconnected graphs of order at least 3 are reconstructible.
5. State and prove a characterization of trees.
6. State and prove Menger’s Theorem.
7. Prove that: a nontrivial connected graph G is eulerian if and only if every vertex in G is
even.
PART B [50]
1. Prove that every graph of order n > 2 has at least two vertices with the same degree.
2. Prove that if G is a connected graph of order n > 2 that contains a bridge, then either n = 2
or G contains a cut-vertex.
3. Let G be a graph of order 12 and size 14 with D(G) = {2,3}. How many vertices of degree
2 does G have?
4, Let a and 6 be any integers such that b < a. Show that there exists a graph G of order a+b
with A(G) =a+6—1, (G) = band KG) =1
5. Give an cxample of a tree with Priifer sequence (1,2,2,3,3,4,4,5) and another with Priifer
sequence (2,8,8,3,5,4).
6. Let G = Koy x Ps. Find rad G, diam G, per G, cen G, «(G), «1(G) and a(G)
(3)
(7
(5)
{8}
5]
[15]
i)
B]
{5}
[3]
{5}
(4)
fio] 9.
10.
7.1 A connected graph G has degree sequence 8,8,7,7,6,6,6,5,4,4,3. How many edges
inust. be removed from G to produce a spanning tree of G? [3]
7.2 Prove that if G is a connected graph of order n with the property that every subgraph
of size n—1 is a spanning tree, then G is a tree or a cycle. 6]
Reconstruct the graph G from the following subgraphs of G:
G—u,=5,UP,U Ky (for i=1,...,0),
= = C,U(N-KU Ky,
G =v; = Sp-1UCgU Kp (for j= +2,...,2n),
G = ty = S,UCyU Kyat (for k = 2n-+1,...,3n) fal
Let k be a positive integer and G a k-regular graph of odd order n. Can G possibly contain
a bridge? [5]
Prove or disprove that if G is a graph satisfying x(G) = 6(G), then G has diameter 2. [2]
