Discrete Mathematics with Applications 4th Edition

Published by Cengage Learning
ISBN 10: 0-49539-132-8
ISBN 13: 978-0-49539-132-6

Chapter 10 - Graphs and Trees - Exercise Set 10.1: 2

Answer

1. V(G) = {v1, v2, v3, v4}, E(G) = {e1, e2, e3,e4,e5} Edge-endpoint function: Edge Endpoints e1 {v1, v2} e2 {v2, v3} e3 {v2, v3} e4 {v2, v4} e5 {v5}

Work Step by Step

1. V(G) = {v1, v2, v3, v4}, E(G) = {e1, e2, e3,e4,e5} Edge-endpoint function: Edge Endpoints e1 {v1, v2} e2 {v2, v3} e3 {v2, v3} e4 {v2, v4} e5 {v5}
Update this answer!

You can help us out by revising, improving and updating this answer.

Update this answer

After you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.