Question

Let GG be a graph. The line graph of GG is a new graph L(G)L(G) whose vertices are the edges of GG; two vertices of L(G)L(G) are adjacent if, as edges of GG, they share a common end point. In symbols:

V[L(G)]=E(G) and E[L(G)]={e1e2:e1e2=2}V[L(G)]=E(G)\text{ and }E[L(G)]=\{e_1e_2:|e_1\cap e_2|=2\}

Prove or disprove the following statements about the relationship between a graph and its line graph : a. If GG is Eulerian, then L(G)L(G) is also Eulerian. b. If GG has a Hamiltonian cycle, then L(G)L(G) is Eulerian. (See Exercise 50.16 for the definition of a Hamiltonian cycle.) c. If L(G)L(G) is Eulerian, then GG is also Eulerian. d. If L(G)L(G) is Eulerian, then GG has a Hamiltonian cycle.

Solution

Verified
Step 1
1 of 6

DEFINITIONS

An Eulerian trial is a walk in a graph that contains all edges in the graph exactly once.

An Eulerian tour is an Eulerian trial that beings and ends at the same vertex.

A graph is Eulerian\textbf{Eulerian} if GG contains an Eulerian tour.

A Hamilton cycle\textbf{Hamilton cycle} is a cycle that passes through every vertex exactly once.

Create an account to view solutions

Create an account to view solutions

Recommended textbook solutions

Discrete Mathematics and Its Applications 7th Edition by Kenneth Rosen

Discrete Mathematics and Its Applications

7th EditionISBN: 9780073383095 (9 more)Kenneth Rosen
4,283 solutions
Discrete Mathematics and Its Applications 8th Edition by Kenneth Rosen

Discrete Mathematics and Its Applications

8th EditionISBN: 9781259676512Kenneth Rosen
4,397 solutions
Mathematics: A Discrete Introduction 3rd Edition by Edward A. Scheinerman

Mathematics: A Discrete Introduction

3rd EditionISBN: 9781285402062 (1 more)Edward A. Scheinerman
1,133 solutions

More related questions

1/4

1/7