edited by
648 views
3 votes
3 votes

Let G be a graph with 10 vertices, and d(v) be the degree of a vertex v. The following conditions are holds for Graph G.

  1. 3 $\leq$ d (v) $\leq$ 5 for each vertex v in G.
  2. Not every vertex degree is even
  3. No two odd degree vertices are of the same degree

Let X be the number of edges, Y be the vertices having even degree and Z be the vertices having odd degree in G. Find the value of X+10Y+100Z?

edited by

1 Answer

Best answer
4 votes
4 votes
available degree of any vertex is 3,4,5 any one of them

now not all vertices are even means not all of them are 4 .. means there is either a 3 or 5  ..and there can be only one of 3 or 5 as no two odd vertices can be same here.

 noe say 9 vertices with deg 4 and 1 vertex of degree 3

then summation of degree 4*9 +3=39 but summation of degree should always even(theorem)

so only possibility is 8 vertces with 4 degree 1 with 3 and 1 with 5 .

 

and  by theorwm no of edes= (total degree/2)=(4*8+3+5=40)/2=20

edge=20 =X  vertices of even degree=8=Y  vertices of odd degree=2

X+10Y+100Z=20+80+200=300

300 should be the answer
selected by

Related questions

1 votes
1 votes
1 answer
1
0 votes
0 votes
1 answer
2
gagan55 asked Jun 30, 2023
198 views
Number of hamiltonian cycles for a graph K 5, 5( bipartite graph ) ??
0 votes
0 votes
1 answer
3
Dhiraj_777 asked May 4, 2023
532 views
In a Connected Planar Bipartite Graph of order 10 atmost how many edges be present ?
0 votes
0 votes
1 answer
4
Sahil_Lather asked Apr 15, 2023
487 views
Graph G is obtained by adding vertex s to $K_{3,4}$ and making s adjacent to every vertex of $K_{3,4}$ .The find the minimum number of colours required ot edge-colour is ...