Let be a graph. The line graph of is a new graph whose vertices are the edges of ; two vertices of are adjacent if, as edges of , they share a common end point. In symbols:
Prove or disprove the following statements about the relationship between a graph and its line graph : a. If is Eulerian, then is also Eulerian. b. If has a Hamiltonian cycle, then is Eulerian. (See Exercise 50.16 for the definition of a Hamiltonian cycle.) c. If is Eulerian, then is also Eulerian. d. If is Eulerian, then has a Hamiltonian cycle.
Solution
VerifiedDEFINITIONS
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 if contains an Eulerian tour.
A 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•ISBN: 9780073383095 (9 more)Kenneth Rosen
Advanced Mathematics: Precalculus with Discrete Mathematics and Data Analysis
ISBN: 9780395551899Brown
Discrete Mathematics and Its Applications
8th Edition•ISBN: 9781259676512Kenneth Rosen
Mathematics: A Discrete Introduction
3rd Edition•ISBN: 9781285402062 (1 more)Edward A. ScheinermanMore related questions
- computer science
- computer science
- computer science
- computer science
- computer science
1/4
- computer science
- computer science
- computer science
- computer science
- computer science
1/7