Math question

Pls see attached

Math question

pls see attached

Spanning Trees and Graphs

Does every graph have a spanning tree? If not, then can you tell from the number of nodes and the number of edges a graph has whether it has a spanning tree, or do you need more information?

Spanning Tree Graph

If you were required by a professor to find a spanning tree of the movie collaboration graph (where each node corresponds to an actor with finite Kevin Bacon number, and two nodes are connected by an edge if the corresponding actors have been in a movie together), how would you do it? Why would you choose your method over other ...continues

Tile a plane with n-gons

Is it possible to tile a plane with (a) regular 5-gons and regular 6-gons? (B) regular 5-gons, regular 6-gons, and triangles? (c) regular 5-gons, regular 6-gons, and regular triangles?

Discrete Math

See attachment

Discrete Math

See attachment #7 only

Discrete Math

The following is is meant to have some assumptions made (like "n"). I have been up all night trying to figure this out. It can't be Euler because the vertices can't be >1. It might be Hamilton if I assume that E of G(V,E) is infinte..but how would I get my answer? I would just have sets (e1, e2,...) Could this be a straight ...continues

Discrete Math

Please help me with this one! 1. Let G be an undirected graph with n vertices. If G is isomorphic to its own compliment , how many edges must G have?

second posting of a graph theory problem

This is my second attempt at trying to gain some clarity on the following problem: 1. A contractor for a Paradise city on the XYZ planet has to order traffic lights for the city. All streets in the city are straight and infinitely long in both directions. No matter how many streets have the same crossing, there ...continues