File:Petersen-as-Moore.png

From Wikimedia Commons, the free media repository
Jump to navigation Jump to search

Petersen-as-Moore.png(298 × 258 pixels, file size: 5 KB, MIME type: image/png)

Captions

Captions

Add a one-line explanation of what this file represents
File:Petersen-as-Moore.svg is a vector version of this file. It should be used in place of this PNG file when not inferior.

File:Petersen-as-Moore.png → File:Petersen-as-Moore.svg

For more information, see Help:SVG.

In other languages
Alemannisch  Bahasa Indonesia  Bahasa Melayu  British English  català  čeština  dansk  Deutsch  eesti  English  español  Esperanto  euskara  français  Frysk  galego  hrvatski  Ido  italiano  lietuvių  magyar  Nederlands  norsk bokmål  norsk nynorsk  occitan  Plattdüütsch  polski  português  português do Brasil  română  Scots  sicilianu  slovenčina  slovenščina  suomi  svenska  Tiếng Việt  Türkçe  vèneto  Ελληνικά  беларуская (тарашкевіца)  български  македонски  нохчийн  русский  српски / srpski  татарча/tatarça  українська  ქართული  հայերեն  বাংলা  தமிழ்  മലയാളം  ไทย  한국어  日本語  简体中文  繁體中文  עברית  العربية  فارسی  +/−
New SVG image

Transwiki approved by: w:en:User:Sopoforic

This image was copied from wikipedia:en. The original description was:

Summary[edit]

The Petersen graph as a Moore graph: any breadth first search tree has d(d-1)i vertices in its ith level.

Licensing[edit]

Public domain I, the copyright holder of this work, release this work into the public domain. This applies worldwide.
In some countries this may not be legally possible; if so:
I grant anyone the right to use this work for any purpose, without any conditions, unless such conditions are required by law.

Original upload log[edit]

date/time username resolution size edit summary
22:26, 1 October 2006 David Eppstein 298×258 4,627 (The <a href="/wiki/Petersen_graph" title="Petersen graph">Petersen graph</a> as a <a href="/wiki/Moore_graph" title="Moore graph">Moore graph</a>: any <a href="/w/index.php?title=Breadth_first_search_tree&action=edit" class="new" title="Breadth first search tree">breadth first search tree</a> has ''d''(''d''-1)<sup>''i''</sup> vertices in its ''i''th level.)

page history[edit]

oldid date/time username edit summary
86763942 10:49, 18 August 2007 Sopoforic
86763942 18:40, 9 November 2006 David Eppstein
78949961 22:27, 1 October 2006 David Eppstein
78949911 22:26, 1 October 2006 David Eppstein (The <a href="/wiki/Petersen_graph" title="Petersen graph">Petersen graph</a> as a <a href="/wiki/Moore_graph" title="Moore graph">Moore graph</a>: any <a href="/w/index.php?title=Breadth_first_search_tree&action=edit" class="new" title="Breadth first search tree">breadth first search tree</a> has ''d''(''d''-1)<sup>''i''</sup> vertices in its ''i''th level.)

File history

Click on a date/time to view the file as it appeared at that time.

Date/TimeThumbnailDimensionsUserComment
current11:09, 18 August 2007Thumbnail for version as of 11:09, 18 August 2007298 × 258 (5 KB)BetacommandBot (talk | contribs)Transwiki approved by: w:en:User:Sopoforic This image was copied from wikipedia:en. The original description was: == Summary == The Petersen graph as a Moore graph: any breadth first search tree has ''d''(''d''-1)<sup>''i''</sup> vertice

There are no pages that use this file.