Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

QUESTION 2 a) Kuala Lumpur, Johor Bahru, Penang, Kota Kinabalu, and Kuching airport among the busiest airport in Malaysia There are direct flights connecting each

image text in transcribed
QUESTION 2 a) Kuala Lumpur, Johor Bahru, Penang, Kota Kinabalu, and Kuching airport among the busiest airport in Malaysia There are direct flights connecting each city to another 11 Draw an undirected graph model representing this flight connection. Label all edges and vertices Determine the degree of each of vertex in the graph Is the graph draw in () is a complete graph? Explain Due to the OOVID 19 pandemic the flight connection is reviewed. There is no rect flight to Kota Kinabalu from Penang and Johor Bahru and no direct flight to Kuching from Penang is the graph also as your answer in ()? Explain IV b) Ahmad works at ED delivery Services company He wants to deliver 8 parcels to 8 different addresses in one housing area Each of these houses is connected to each other via several different lanes as can be viewed in Figurel 12 10 2 8 8 E 11 i Figure 1 Is that possible for Ahmad by passing through each address (label as A, B. C.D.E.F. G. H) exactly once? If so, exhibits one and explan 1 After completing his work, Ahmad decided to look wound the area Is it possible to tour the house area by passing by the lane (label as 1.2.3.4.5. 6.7.8.9,10,11,12) exactly once? If so, which address he must begin and end the tour and if not explain

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Modern Database Management

Authors: Jeffrey A. Hoffer Fred R. McFadden

4th Edition

0805360476, 978-0805360479

Students also viewed these Databases questions