what is min degree ?

MIRIYALA JEEVAN KUMA asked Jan 21, 2018

389 views

See all

Please log in or register to answer this question.

Related questions

0 votes

0 answers

Anand. asked Dec 31, 2016

590 views

A graph $G$ is Eulerian path iff degree of each vertex is even with atmost one trivial component
For this proof ,proving $\Rightarrow$ If Graph $G$ is eulerian then degree of each vertex is even with atmost one trivial component. As $G$ is Eulerian ,it means it **must not** repeat Edges but can repeat ... $C,F =3$ contradictory.... help me out where i am wrong

For this proof ,proving$\Rightarrow$ If Graph $G$ is eulerian then degree of each vertex is even with atmost one trivial component.As $G$ is Eulerian ,it means it must n...

Anand.

590 views

Anand. asked Dec 31, 2016

0 votes

0 answers

Prince Sindhiya asked Jan 2, 2019

708 views

Zeal Test Series 2019: Graph Theory - Degree Of Graph
A simple graph is one in which there are no self loops and each pair of distinct vertices is connected by at most one edge. Let G be a simple graph on 8 vertices such that there is a vertex of degree 1, a vertex of degree 2, a ... a vertex of degree 6 and a vertex of degree 7. Which of the following can be the degree of the last vertex ____ ?

A simple graph is one in which there are no self loops and each pair of distinct vertices is connected by at most one edge. Let G be a simple graph on 8 vertices such tha...

Prince Sindhiya

708 views

Prince Sindhiya asked Jan 2, 2019

2 votes

3 answers

Lakshman Bhaiya asked Oct 10, 2018

1,154 views

Degree of vertices
Consider an undirected graph with $n$ vertices, vertex $1$ has degree $1$,while each vertex $2,3,.............,n-1$ has degree $4$.The degree of vertex $n$ is unknown. Which of the following statement must be true? Vertex $n$ has degree $1$ Graph is connected There is a path from vertex $1$ to vertex $n$ Spanning tree will include edge connecting vertex $1$ and vertex $n$

Consider an undirected graph with $n$ vertices, vertex $1$ has degree $1$,while each vertex $2,3,.............,n-1$ has degree $4$.The degree of vertex $n$ is unknown. Wh...

Lakshman Bhaiya

1.2k views

Lakshman Bhaiya asked Oct 10, 2018

1 votes

1 answer

venkatesh456 asked Sep 14, 2018

1,015 views

Degree Sequence
$<2, 2, 2, 1, 1>$ degree sequence is NOT graphic for simple graphs$?$

$<2, 2, 2, 1, 1>$ degree sequence is NOT graphic for simple graphs$?$

venkatesh456

1.0k views

venkatesh456 asked Sep 14, 2018

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

what is min degree ?

Please log in or register to add a comment.

Please log in or register to answer this question.

0 Answers

Related questions

1 1 comment reply

Please log in or register to add a comment.

Please log in or register to answer this question.

0 Answers

Related questions

1 1 comment