Register

Regular polyhedra

266 views

1 Answer

0 votes
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
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
Dknights asked Dec 12, 2023
416 views
Regular and complete graph
which of the following statements is true: a complete graph is $(N-1)$ regular a $(N-1)$ regular is a complete graph
which of the following statements is true:a complete graph is $(N-1)$ regulara $(N-1)$ regular is a complete graph
User Avatar
0 votes
0 votes
0 answers
2
dan31 asked Nov 6, 2018
1,243 views
Regular graph coloring
If G is a connected k-regular graph with chromatic number k+1, then find the number of edges in G?
If G is a connected k-regular graph with chromatic number k+1, then find the number of edges in G?
User Avatar
0 votes
0 votes
0 answers
3
dan31 asked Nov 6, 2018
901 views
Regular Graph
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 connected S4: Every component of G is an even cycle Options- A) S1,S2 B)S2,S4 C)S3,S4 D)S1,S4
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...
User Avatar
2 votes
2 votes
1 answer
4
Akriti sood asked Nov 28, 2016
3,114 views
Let G be a K-regular bipartite graph with k ≥ 2. Then G has no cut edge
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
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
User Avatar
Link Copied!