Register

Graphs

372 views

1 Answer

0 votes
0 votes
In polyhyderal degree of each vertice is >=3,

(3R - 6) >= E

here, (3*11-6) !>= 30, hence note polyhyderal, S1 can be verified by taking example.
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
admin asked Mar 30, 2020
2,371 views
NIELIT 2017 DEC Scientist B - Section B: 23
Let $G$ be a complete undirected graph on $8$ vertices. If vertices of $G$ are labelled, then the number of distinct cycles of length $5$ in $G$ is equal to: $15$ $30$ $56$ $60$
Let $G$ be a complete undirected graph on $8$ vertices. If vertices of $G$ are labelled, then the number of distinct cycles of length $5$ in $G$ is equal to:$15$$30$$56$$...
User Avatar
3 votes
3 votes
2 answers
2
smartmeet asked Jan 14, 2017
1,839 views
How many maximum cycles possible in any Complete graph? (Unlabelled nodes)
User Avatar
Link Copied!