Distant learning course. This is a self-taught open-book test. I

have read the book over & over, I even found a PDF version and

searched it. I've combed the net and found some good resources like

NIST.gov. After my other tests I have asked the on-line instructor

for references, or even the correct anwser to what I missed. She has

proved useless.I have a few here I would like some opinions on, i have

tried on my own, but would like some tutoring .

1. A cyclic graph has:

a. a shape like a unicycle

b. a graph that cycles from vertices to edges

c. a cycle of two or more nodes

d. a cycle of three or more nodes

e. None of the above

I'd say d, because a cycle graph consists of a single cycle (some

number of vertices connected in a closed chain)

2. A(n) _______________________ graph is a graph in which each vertex

has a connection to every other vertex.

a. directed

b. cyclic

c. acyclic

d. fully connected

e. None of the above

I'd say e, because I belive it should be either a connected graph or a

strongly connected graph, depending on where you read about it. Fully

connected sounds close, but I can't find a single reference to that.

3. A(n) ____________________ is a graph in which each connection has

two directions.

a. undirected graph

b. bigraph

c. bidirectional graph

d. TS graph

e. None of the above

I'd say e, I've found no graph that has an edge going both ways