You are in the accessibility menu

Please use this identifier to cite or link to this item: http://acervodigital.unesp.br/handle/unesp/360895
Title: 
Beraha's conjecture, wheels, and cyclic graphs
Author(s): 
Zizi, Jacqueline
Language: 
eng
Description: 
  • Polygons
  • A graph coloring assigns colors to the vertices of a graph in such a way that a pair of vertices joined by an edge do not get the same color. The chromatic polynomial of a graph gives the number of ways of coloring the graph with x colors. Beraha's numbers are B(n)=4*cos^2(pi/n). Tutte conjectured that there is a link between Beraha's numbers and some classes of graphs. This Demonstration shows that for a small number of vertices, it is not obvious what the connection is between the roots of the chromatic polynomial of a cyclic graph (green), the roots of the chromatic polynomial of the corresponding wheel graph (purple), and Beraha's numbers (red). However, taking more vertices clearly shows a relationship between these three sets of numbers
  • Componente Curricular::Ensino Médio::Matemática
Issue Date: 
  • 2008
  • 15-Sep-2008
  • 15-Sep-2008
  • 15-Sep-2008
  • 13-Sep-2008
Keywords: 
  • Polygons
  • Combinatorics
  • Complex Numbers
  • Discrete Mathematics
  • Golden Ratio
  • Educação Básica::Ensino Médio::Matemática::Geometria
Notes: 
Shows Beraha's conjecture
Credits: 
This demonstration needs the "MathematicaPlayer.exe" to run. Found in http://objetoseducacionais2.mec.gov.br/handle/mec/4737
Source: 
http://objetoseducacionais2.mec.gov.br/handle/mec/5359
URI: 
http://acervodigital.unesp.br/handle/unesp/360895
Rights: 
Demonstration freeware using Mathematica Player
Type: 
outro
Appears in Collections:MEC - Objetos Educacionais (BIOE) - OE

There are no files associated with this item.
 

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.