The Gateway to Computer Science Excellence
0 votes

Let $G$ be a graph on $n$ vertices with $4n-16$ edges.Consider the following:
1. There is a vertex of degree smaller than $8$ in $G.$

2. There is a vertex such that there are less than $16$ vertices at a distance exactly $2$ from it.

Which of the following is TRUE:

  1.  1 only
  2. 2 only
  3.  Both 1 and 2
  4.  Neither 1 nor 2
in Graph Theory by Active (1.5k points)
edited by | 108 views
I think only 1 is true..
Is it option a?
Yes. Please explain. Unable to understand the given 2nd statement.
please elaborate its solution..

Please log in or register to answer this question.

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,666 questions
56,170 answers
94,047 users