| Found in Collection(s): | Click on the collection logo for more information.
 Close this window
| Collection Name: | Wolfram MathWorld
|
|---|
| Collection Description: | MathWorld is a comprehensive and interactive mathematics encyclopedia intended for educators, students, engineers, researchers, and math enthusiasts. It contains more than 11,000 detailed entries covering virtually all areas of mathematics. MathWorld is a free service for the mathematical community provided by Wolfram Research, makers of Mathematica. It has been assembled by Eric W. Weisstein of Wolfram Research, with assistance from thousands of contributors. |
|---|
Collection Information:
| Author |
Eric Weisstein
|
|---|
| Date Published |
1999
|
|---|
| Grade Level |
General Public
High School
Higher Education
Informal Education
Middle School
|
|---|
| Intended Audience |
Educator
General Public
Learner
Professional/Practitioner
Researcher
|
|---|
| Link |
Http://mathworld.wolfram.com/
|
|---|
| Publisher / Resource Provider |
Wolfram Research, Inc.
|
|---|
| Resource Type |
Audio/Visual
Collection
Demonstration
Glossary/Index
Illustration
Instructional Material
Interactive Simulation
InteractiveResource
Movie/Animation
Nonfiction Reference
Reference Material
Text
|
|---|
| Rights Information |
Copyright 1999-2008 Wolfram Research, Inc. See Http://mathworld.wolfram.com/terms.html For A Full Terms Of Use Statement.
|
|---|
| Subject Keyword(s) |
Algebra
Applied Mathematics
Calculus and Analysis
Discrete Mathematics
Foundations Of Mathematics
Geometry
Mathematical History and Terminology
Mathematics--Encyclopedias
Number Theory
Probability and Statistics
Recreational Mathematics
Topology
|
|---|
Close this window
|
|---|
| Resource Title: | Hamiltonian Circuit -- from MathWorld
|
|---|
| Description: | A Hamiltonian circuit, also called a Hamiltonian cycle, Hamilton circuit, or Hamilton cycle, is a graph cycle (i.e., closed loop) through a graph that visits each node exactly once (Skiena 1990, p. 196). By convention, the trivial graph on a single node is considered to posses a Hamiltonian circuit, but the connected graph on two nodes is not. A graph possessing a Hamiltonian circuit is said to be a Hamiltonian graph. The Hamiltonian circuit is named after Sir William Rowan Hamilton, who... |
|---|
Additional Resource Information
| Author |
Weisstein, Eric W.
|
|---|
| Language |
En
|
|---|
| Publisher / Resource Provider |
Wolfram Research, Inc.
|
|---|
| Resource Format |
Text/html
|
|---|
| Resource Type |
Text
|
|---|
| Rights Information |
Copyright 1999 CRC Press LLC, Copyright 1999-2005 Wolfram Research, Inc. See Http://mathworld.wolfram.com/terms.html For A Full Terms Of Use Statement.
|
|---|
| Subject Keyword(s) |
05C38
Discrete Mathematics
Mathematics
Mathematics:Discrete Mathematics:Graph Theory:Circuits
Mathematics:Recreational Mathematics:Mathematical Art:LiveGraphics3D Applets
|
|---|
|
