search
Log In
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
0 votes
127 views

in Graph Theory 127 views
0
b?

1 Answer

0 votes
Is answer C?

Related questions

0 votes
1 answer
1
325 views
Please explain how did they get that equation in E and V.
asked Jan 5, 2016 in Graph Theory shikharV 325 views
1 vote
1 answer
2
267 views
Consider a graph $G$ with $2^{n}$ vertices where the level of each vertex is a $n$ bit binary string represented as $a_{0},a_{1},a_{2},.............,a_{n-1}$, where each $a_{i}$ is $0$ or $1$ ... $x$ and $y$ denote the degree of a vertex $G$ and number of connected component of $G$ for $n=8.$ The value of $x+10y$ is_____________
asked May 23, 2019 in Graph Theory srestha 267 views
0 votes
0 answers
3
154 views
If G is a connected simple graph with 10 vertices in which degree of every vertex is 2 then number of cut edges in G is ?
asked Jan 19, 2019 in Graph Theory Na462 154 views
1 vote
1 answer
4
286 views
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 only 2 only Both 1 and 2 Neither 1 nor 2
asked Jan 9, 2019 in Graph Theory pps121 286 views
...