Homework for Maple Class of Oct. 16, 2023

VERSION OF Oct. 16, 2023 (thanks to Howard Luo)

Please mail TWO files (as attachments) to ShaloshBEkhad@gmail.com by
DUE Oct. 25, 10:00pm

FIRST FILE named hwMapleFirstLast.jpg that contains the picture of the tree whose Pruefer Code is your RUID number
(change all the 0's into 1's)

SECOND FILE:  named hwMapleFirstLast.txt that contains the input output (in plain Text of the following assignments)

1. Define a random graph   with 10 vertices and 20 edges, call it G. Write the Maple command


2. Copy-and-paste into hwMapleFirstLast.txt the set of edges of G.

3. Write the Maple command to generate a random CONNECTED weighted  graph, call it G, with 12 vertices, 18 edges, and random weights between 1 and 15

4. Copy and paste into the .txt file the set of edges of G

5. Use Maple to find a minimal spanning tree of the above mentioned G, call it T, 
copy-and-paste into the .txt file the set of edges of G

6. Write the Maple command to generate a random tree with 14 vertices, call it T. 

a. copy-and-paste the set of edges

b. copy-and-paste the Pruefer code

c. write the command to draw T (do not send me the picture), and draw it

d. Verify that no endpoints of T shows up in the Pruefer code, and that the number of times an integer i shows
up in the Pruefer code equals to its degree minus 1