Learning reinforcement math 11324, Cheat Sheet of Mathematics

vLearning reinforcement math 1141245

Typology: Cheat Sheet

2014/2015

Uploaded on 12/21/2021

mark-g-3
mark-g-3 🇵🇭

4.3

(3)

3 documents

1 / 2

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
d
Learning Reinforcement 7
Directions: Write your solutions and answers on a clean sheet of
paper, or you may print this page and answer there. Submit the
image of your HANDWRITTEN SOLUTIONS as a single pdf file in the
submission bin for this activity in the Classroom. You may use
image scanning apps on your phone (CamScanner or Tap
Scanner) to save several images into one pdf file, or place your
images in a document and save them as a pdf file.
1. Graph G shown below:
a b
y d
x c e
f g
Identify the following:
a. V(G)
b. vertices incident to x
c. edges incident to a
d. vertices adjacent to d
e. edges adjacent to y
f. p
g. E(G)
h. shortest path from b to g
2. Is the graph an Euler graph?Why or why not?If yes, find an Euler tour.
Property of and for the exclusive use of SLU. Reproduction, storing in a retrieval system, distributing, uploading or posting online, or transmitting in any form or by any
means, electronic, mechanical, photocopying, recording, or otherwise of any part of this document, without the prior written permission of SLU, is strictly prohibited. 1
Answer
pf2

Partial preview of the text

Download Learning reinforcement math 11324 and more Cheat Sheet Mathematics in PDF only on Docsity!

d

Learning Reinforcement 7

Directions: Write your solutions and answers on a clean sheet of paper, or you may print this page and answer there. Submit the image of your HANDWRITTEN SOLUTIONS as a single pdf file in the submission bin for this activity in the Classroom. You may use image scanning apps on your phone (CamScanner or Tap Scanner) to save several images into one pdf file, or place your images in a document and save them as a pdf file.

  1. Graph G shown below: a b y (^) d x c e f g Identify the following: a. V(G) b. vertices incident to x c. edges incident to a d. vertices adjacent to d e. edges adjacent to y f. p g. E(G) h. shortest path from b to g
  2. Is the graph an Euler graph?Why or why not?If yes, find an Euler tour. Property of and for the exclusive use of SLU. Reproduction, storing in a retrieval system, distributing, uploading or posting online, or transmitting in any form or by any

means, electronic, mechanical, photocopying, recording, or otherwise of any part of this document, without the prior written permission of SLU, is strictly prohibited.^1

Answer

d a d

b C b (!

G H

  1. Given the graphs shown below, determine which graph is Hamiltonian and for such graph, find a Hamilton cycle: