Register

Recent questions tagged narsingh

1 votes
2 answers
1
Connectivity(4-20) Narsingh Deo
Is every regular graph of degree d(d$\geq$3) non-separable?If not, give a simple regular graph of degree 3 that is separable.
Is every regular graph of degree d(d$\geq$3) non-separable?If not, give a simple regular graph of degree 3 that is separable.
User Avatar
0 votes
0 answers
2
Connectivity(4-10)-Narsingh Deo
Prove that in a connected graph G a vertex v is a cut-vertex if and only if there exist two(or more) edges x and y incident on v such that no circuit in G includes both x and y.
Prove that in a connected graph G a vertex v is a cut-vertex if and only if there exist two(or more) edges x and y incident on v such that no circuit in G includes both x...
User Avatar
1 votes
1 answer
3
Narsingh Deo Problem 2-28
User Avatar
To see more, click for the full list of questions or popular tags.