1 1 vote 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. Graph Theory graph-theory narsingh-deo + – Ayush Upadhyaya 2.2k views answer comment Share Follow Print 0 reply Please log in or register to add a comment.
Best answer 4 4 votes The idea is to start off with a bridge or something and then build it up. Anyways this is the counter you need. You can delete either of the vertices that lie on the blue edge (bridge). Lakshay Kakkar answered Jun 8, 2018 • selected Jun 8, 2018 by Ayush Upadhyaya Lakshay Kakkar comment Share Follow See 1 comment 1 1 comment reply Ayush Upadhyaya commented Jun 8, 2018 reply Follow flag Nice 1 1 replyShare Please log in or register to add a comment.
1 1 vote Assume K5 and K5 which are not connected ===> it is regular graph with degree 4 but not connected Shaik Masthan answered Jun 2, 2018 Shaik Masthan comment Share Follow 0 reply Please log in or register to add a comment.
