Graph theory Q1 (basic)

Let G G be a k k -regular connected graph with 24 edges. Let n n be the number of vertices of G G .

Find is the sum of all possible value of n n .


The answer is 60.

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

1 solution

Chan Lye Lee
Jun 30, 2019

From hand-shaking Lemma, k n = 2 ( 24 ) = 48 kn=2(24)=48 and 1 < k n 1 1<k\le n-1 as G G is a connected graph. The possible values of ( k , n ) = ( 2 , 24 ) , ( 3 , 16 ) , ( 4 , 12 ) , ( 6 , 8 ) (k,n)=(2,24),(3,16), (4, 12), (6,8) . Then the answer is 24 + 16 + 12 + 8 = 60 24+16+12+8=60 .

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...