607 views

1 Answer

0 0 votes
No there is nothing like polyhedra as far i know. I have gone through most of the question in graph asked previous year and no such question is asked
Position:
Show:

Related questions

0 0 votes
1 1 answer
2.5k
2.5k views
Dknights asked Dec 12, 2023
2,500 views
which of the following statements is true:a complete graph is $(N-1)$ regulara $(N-1)$ regular is a complete graph
0 0 votes
0 0 answers
2.3k
2.3k views
dan31 asked Nov 6, 2018
2,257 views
If G is a connected k-regular graph with chromatic number k+1, then find the number of edges in G?
0 0 votes
0 0 answers
1.8k
1.8k views
dan31 asked Nov 6, 2018
1,781 views
If a 2-regular graph G has a perfect matching then which of the following is/are true? S1: G is a cycle of even length S2: Chromatic number of G is 2 S3: G is co...
2 2 votes
1 answers 1 answer
4.8k
4.8k views
Akriti sood asked Nov 28, 2016
4,764 views
how is this statement correct..can some one give an example??Let G be a K-regular bipartite graph with k ≥ 2. Then G has no cut edge