Edge Rewrite
// HTMLRewriter · presentation

This page was redesigned at the edge.

Cloudflare fetched the original article and streamed it through HTMLRewriter to apply an entirely new visual system without rebuilding the source page.

Jump to content

Talk:Wheel graph

Page contents not supported in other languages.
Add topic
From Wikipedia, the free encyclopedia
Latest comment: 13 years ago by Healyp

I usually prefer to think about W_n as the wheel with n spokes, rather than the wheel with n vertices as this article implies. It'll require a lot of work to clean this up, though... Does anyone else have an opinion on this? Wandrer2 (talk) 02:45, 5 October 2009 (UTC)Reply

Both notations are used and exist. I have no personal preference. Koko90 (talk) 11:15, 6 October 2009 (UTC)Reply

It looks like the number of edges is 2n not 2(n-1) 128.82.4.231 (talk) 23:23, 17 November 2010 (UTC)Reply

It depends on the notation. In this article the notation  is used for a wheel graph with  vertices in all (counting the central vertex), so the number of edges is . Other authors use the notation  to mean a wheel graph with  vertices in the outer cycle (hence  vertices in all), so the number of edges is . This difference of notation is mentioned in the first paragraph of the article. —Bkell (talk) 11:43, 18 November 2010 (UTC)Reply

I think the spectrum given (in the right hand panel) is for the wheel graph W_{n+1}. For example W_4, which according to teh notation used here is 3-regular and so its spectrum should be \{ -1, -1, -1, 3\} but this will certainly not be the spectrum yielded by what is in the panel. I am new to editing Wikipedia pages so am not sure of the correct protocol. Thanks, P. Healy. — Preceding unsigned comment added by Healyp (talkcontribs) 18:18, 5 November 2012 (UTC)Reply