(New page: 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...) |
|||
| Line 2: | Line 2: | ||
---->>> are we supposed to consider n=0 or are these graphs only defined for n>0?--[[User:Tsnowdon|Tsnowdon]] 18:18, 1 November 2008 (UTC) | ---->>> are we supposed to consider n=0 or are these graphs only defined for n>0?--[[User:Tsnowdon|Tsnowdon]] 18:18, 1 November 2008 (UTC) | ||
--- n>0, otherwise the graph would have no vertices. [[User:rtabchou|rtabchou]] | --- n>0, otherwise the graph would have no vertices. [[User:rtabchou|rtabchou]] | ||
| + | ------------ | ||
| + | Are we supposed to consider n=1 for K1 as bipartite, or do we need at least 2 vertices for a bipartite graph? | ||
Revision as of 17:04, 5 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?
