Mathematica 9 is now available
THIS IS DOCUMENTATION FOR AN OBSOLETE PRODUCT.
SEE THE DOCUMENTATION CENTER FOR THE LATEST INFORMATION.
Wolfram Mathematica Documentation Center
DOCUMENTATION CENTER SEARCH
New to Mathematica? Find your learning path »
Mathematica > Mathematics and Algorithms > Graphs & Networks > Graph Predicates and Properties > HamiltonianGraphQ >
Mathematica > Visualization and Graphics > Graphs & Networks > Graph Predicates and Properties > HamiltonianGraphQ >
BUILT-IN MATHEMATICA SYMBOLSee Also »|More About »

HamiltonianGraphQ

HamiltonianGraphQ[g]
yields True if the graph g is Hamiltonian, and False otherwise.
MORE INFORMATION
  • A graph is Hamiltonian if it has a cycle that traverses each vertex exactly once.
EXAMPLESCLOSE ALL
Basic Examples   (2)
Test whether a graph is Hamiltonian:
Not all graphs have a Hamiltonian cycle:
Test whether a graph is Hamiltonian:
In[1]:=
Click for copyable input
Out[1]=
In[2]:=
Click for copyable input
Out[2]=
 
Not all graphs have a Hamiltonian cycle:
In[1]:=
Click for copyable input
Out[1]=
In[2]:=
Click for copyable input
Out[2]=
Scope   (3)
HamiltonianGraphQ works with undirected graphs:
HamiltonianGraphQ gives False for expressions that are not graphs:
Works with large graphs:
New in 8
Ask a question about this page  |  Suggest an improvement  |  Leave a message for the team
Format:   HTML  |  CDF