in Graph Theory recategorized by
1,726 views
0 votes
0 votes

Consider complete graphs K5  and K6 . Let X5 and X6 are number of perfect matching of K5 and K6 respectively. Then X5 + X6 = ________.

in Graph Theory recategorized by
1.7k views

6 Comments

15??
0
0
Yes it is 15.

X5 = 0 and X6 =15
0
0
For K6 = (6-1)(6-3)(6-5) = 5.3.1 = 15

For K5 = (5-1)(5-3)(5-5) = 0 (Not possible for odd no of vertices)

Hence 15 is correct answer
0
0

@Ashwani Kumar 2 is it some kind of formula for k6?

0
0
0
0

K2n=( 2n! ) / ( 2^n  *  n! ) 

0
0

Please log in or register to answer this question.

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