Register

Graphs

553 views

1 Answer

0 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.
Voting & Accepting an answer helps improve the community
← Previous · GATE Overflow | Data...Next → · Internal fragmentati...
← Previous in category · UGC NET CSE | August...Next in category → · Graph connectivity
Position:
Show:

Related questions

0 0 votes
1 1 answer
3.3k
3.3k views
admin asked Mar 30, 2020
3,299 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$$...
0 0 votes
0 0 answers
420
420 views
sudharshan asked Jan 8, 2019
420 views
General
What is the difference between wheel and cycle in GRAPH THEORY
3 3 votes
2 answers 2 answers
3.5k
3.5k views
smartmeet asked Jan 14, 2017
3,513 views
How many maximum cycles possible in any Complete graph? (Unlabelled nodes)