• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1
  • Tagged with
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Grafos, a fórmula de Euler e os poliedros regulares

BRITO, Adriana Priscila de 08 August 2014 (has links)
Submitted by (lucia.rodrigues@ufrpe.br) on 2017-03-28T12:41:18Z No. of bitstreams: 1 Adriana Priscila de Brito.pdf: 1439366 bytes, checksum: 6c39b441ca6cf64e146c11f1a5822457 (MD5) / Made available in DSpace on 2017-03-28T12:41:18Z (GMT). No. of bitstreams: 1 Adriana Priscila de Brito.pdf: 1439366 bytes, checksum: 6c39b441ca6cf64e146c11f1a5822457 (MD5) Previous issue date: 2014-08-08 / This presentation provides an introduction to graph theory, making the connection between some of its concepts and the and characterization of Regular Polyhedra. Special emphasis will be given to the study of Eulerian graphs, Euler's Formula, Graphs and Planar Graphs Platonic. Finally, a proposed instructional sequence that focuses on introducing the concept of the graph elementary school students, making connections with the regular polyhedra is presented. / O presente trabalho tem como objetivo principal apresentar uma introdução à Teoria dos Grafos, fazendo a ligação entre alguns dos seus conceitos e a caracterização dos Poliedros Regulares. Será dada uma ênfase especial ao estudo dos Grafos Eulerianos, da Fórmula de Euler, dos Grafos Planares e dos Grafos Platônicos. Por fim, será apresentada uma proposta de sequência didática que tem como foco introduzir o conceito de grafo a alunos do ensino básico, fazendo ligações com os Poliedros Regulares.

Page generated in 0.0684 seconds