Severity: Warning
Message: fopen(/home/answnniz/solutionspile.com/system/sessions/ci_session7980fc22a04f9529a6133ae1639b9c48c93a74c5): failed to open stream: Disk quota exceeded
Filename: drivers/Session_files_driver.php
Line Number: 176
Backtrace:
File: /home/answnniz/solutionspile.com/index.php
Line: 367
Function: require_once
Severity: Warning
Message: session_start(): Failed to read session data: user (path: /home/answnniz/solutionspile.com/system/sessions)
Filename: Session/Session.php
Line Number: 143
Backtrace:
File: /home/answnniz/solutionspile.com/index.php
Line: 367
Function: require_once
Please solve this graph theory problems Question 1 (a) Define what is meant by the degree sequence of a graph and by a sequence of integers being graphical. (b) State the Havel-Hakimi Theorem of graphical sequences. (No proof is required.) (c) Determine if the following sequences are graphical. For each graphical sequence construct a graph having this sequence as a degree sequence: (i)
4,4,2,2,1,1, (ii)
5,5,4,3,2,1. Question 2 (a) Use the adjacency matrix of the graph below to determine the number of walks of length 4 from
v_(1)to
v_(3). (b) Explain how the powers of the adjacency matrix can be used to determine if a graph is connected.
