Isomorphic Graphs
Two Graphs which contain the same number of Vertices connected in thesame way are said to be isomorphic. Formally, two graphs 
and 
with Vertices 
are said to be isomorphic if there is a Permutation 
of 
such that 
is in the set ofEdges 
Iff 
is in the set of Edges 
.
References
Chartrand, G. ``Isomorphic Graphs.'' §2.2 in Introductory Graph Theory. New York: Dover, pp. 32-40, 1985.
- Integer Relation
- Integer Sequence
- Integrable
- Integral
- Integral Brick
- Integral Calculus
- Integral Cuboid
- Integral Current
- Integral Curvature
- Integral Domain
- Integral Drawing
- Integral Equation
- Integral of Motion
- Integral Sign
- Integral Test
- Integral Transform
- Integrand
- Integrating Factor
- Integration
- Integration by Parts
- Integration Lattice
- Intension
- Interchange Graph
- Interest
- Interior