Search

Question 1 of 8

No calculator

Consider the following unweighted network. The vertices name sites, and the edges represent cable links between office areas

Unweighted network. Vertices in listed order: [Archive | Studio | Design | Meeting | Server]. Full edge list: Studio–Archive; Studio–Design; Design–Archive; Meeting–Archive; Archive–Server; Server–Meeting.ArchiveStudioDesignMeetingServer
(a)1 mark

Determine the number of vertices whose degree is odd

(b)1 mark

Select the statement justified by connectedness and vertex parity