Line 10: Line 10:
 
You should consider K1 as bipartite, it is perfectly legal to have one of the sets V1 or V2 to be empty. The definition requires V1 and V2 to be disjoint, but doesn't require them both to be nonempty.<br>
 
You should consider K1 as bipartite, it is perfectly legal to have one of the sets V1 or V2 to be empty. The definition requires V1 and V2 to be disjoint, but doesn't require them both to be nonempty.<br>
 
--[[User:Asuleime|Asuleime]] 22:55, 5 November 2008 (UTC)
 
--[[User:Asuleime|Asuleime]] 22:55, 5 November 2008 (UTC)
 +
 +
----
 +
Can anyone explain the bipartiteness of hypercubes? I can tell <math>Q_1</math>, <math>Q_2</math> and <math>Q_3</math> are bipartite but couldn't figure out how to show that <math>Q_n</math> is.--[[User:Mkorb|Mkorb]] 10:56, 7 November 2008 (UTC)

Revision as of 05:56, 7 November 2008

So this question asks for which valus of n are Kn, Cn, Wn and Qn bipartite.


>>> are we supposed to consider n=0 or are these graphs only defined for n>0?--Tsnowdon 18:18, 1 November 2008 (UTC)

--- n>0, otherwise the graph would have no vertices. rtabchou


Are we supposed to consider n=1 for K1 as bipartite, or do we need at least 2 vertices for a bipartite graph?

I think it's supposed to be n > 1.


You should consider K1 as bipartite, it is perfectly legal to have one of the sets V1 or V2 to be empty. The definition requires V1 and V2 to be disjoint, but doesn't require them both to be nonempty.
--Asuleime 22:55, 5 November 2008 (UTC)


Can anyone explain the bipartiteness of hypercubes? I can tell $ Q_1 $, $ Q_2 $ and $ Q_3 $ are bipartite but couldn't figure out how to show that $ Q_n $ is.--Mkorb 10:56, 7 November 2008 (UTC)

Alumni Liaison

Ph.D. on Applied Mathematics in Aug 2007. Involved on applications of image super-resolution to electron microscopy

Francisco Blanco-Silva