Register

Virtual Gate Test Series: Discrete Mathematics - Graph Theory

• edited by
655 views
1 votes
1 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
• edited by
User Avatar

1 Answer

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

2 votes
2 votes
1 answer
1
Prince Sindhiya asked Oct 15, 2018
1,050 views
Virtual Gate Test Series: Discrete Mathematics - Graph Theory
Consider the following two statements$:$ The two graphs $G_{1}$ and $G_{2}$ are isomorphic Each of $G_{1}$ and $G_{2}$ are self-dual. Both $(i)$ and $(ii)$ are true Only $(i)$ is true Only $(ii)$ is true Both $(i)$ and $(ii)$ are false
Consider the following two statements$:$The two graphs $G_{1}$ and $G_{2}$ are isomorphicEach of $G_{1}$ and $G_{2}$ are self-dual. Both $(i)$ and $(ii)$ are trueOnly $(i...
User Avatar
Link Copied!