214 views
0 votes
0 votes

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
1
Gate Fever asked Jan 8, 2019
474 views
Assume G is a connected planar graph that has 12 vertices and 17 regions.all interior regions are bounded by a cycle of length 3(ie 3 edge).find the number of edges bound...
0 votes
0 votes
0 answers
3
Gate Fever asked Jan 8, 2019
332 views
Let G be a graph with 100 vertices numbered from 1 to 100. Two vertices i and j are adjacent if $\left | i-j \right |=8 $ or $\left | i-j \right |=12$the number of conn...
0 votes
0 votes
0 answers
4