1 votes 1 votes Graph having every pair of vertices connected is called Cycle graph Complete graph Peterson graph Is a Tree Graph Theory graph-theory + – shivani2010 asked Jun 12, 2016 • edited Oct 11, 2016 by go_editor shivani2010 1.5k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 6 votes 6 votes If every vertices is connected to every vertices, Then its called Complete Graph. Hence Option B) Complete Graph rude answered Jun 12, 2016 • selected Jun 12, 2016 by shivani2010 rude comment Share Follow See 1 comment See all 1 1 comment reply Aryan Asrafi commented Jun 13, 2016 reply Follow Share complete graph 0 votes 0 votes Please log in or register to add a comment.
