 # Math Graph theory - tree question Anonymous
account_balance_wallet \$5

### Question Description

hi I have a math question about graph theory - Tree.
If you regard the capital letters "A, E, F, H, I, K, L, M, N, T, V, X, Y, Z" to be graphs, which of them is NOT a Tree?

Khali R
School: Boston College   A graph consists of two finite sets, V and E. Each element of V is called a vertex (plural vertices). The elements of E, called edges, are unordered pairs of vertices. For instance, the set V might be {a, b, c, d, e, f, g, h}, and E might be {{a, d}, {a,e},{b,c},{b,e},{b,g},{c,f},{d,f},{d,g},{g,h}}.Together,V andE are a graph G.

Graphs have natural visual representations. Look at the diagram in Figure 1.2. Notice that each element of V is represented by a small circle and that each ele- ment of E is represented by a line drawn between the corresponding two elements of V .

flag Report DMCA  Review Anonymous
awesome work thanks Brown University

1271 Tutors California Institute of Technology

2131 Tutors Carnegie Mellon University

982 Tutors Columbia University

1256 Tutors Dartmouth University

2113 Tutors Emory University

2279 Tutors Harvard University

599 Tutors Massachusetts Institute of Technology

2319 Tutors New York University

1645 Tutors Notre Dam University

1911 Tutors Oklahoma University

2122 Tutors Pennsylvania State University

932 Tutors Princeton University

1211 Tutors Stanford University

983 Tutors University of California

1282 Tutors Oxford University

123 Tutors Yale University

2325 Tutors