Dark Mode

Recent questions tagged deo

1 vote

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.

Ayush Upadhyaya asked in Graph Theory Jun 2, 2018

by Ayush Upadhyaya

1.6k views

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.

Ayush Upadhyaya asked in Graph Theory Jun 2, 2018

by Ayush Upadhyaya

672 views

1 vote

1 answer

3

Narsingh Deo Problem 2-28

ankitgupta.1729 asked in Graph Theory Apr 15, 2018

by ankitgupta.1729

1.1k views

1 vote

2 answers

4

Show that the two graphs are isomorphic (Narsingh Deo)
Show that the two graphs are isomorphic

Mk Utkarsh asked in Graph Theory Apr 15, 2018

5.5k views

To see more, click for the full list of questions or popular tags.

Recent questions tagged deo