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.

• Lagrange Number (Diophantine Equation)
• Lagrange Number (Rational Approximation)
• Lagrange Polynomial
• Lagrange Remainder
• Lagrange Resolvent
• Lagrange's Continued Fraction Theorem
• Lagrange's Equation
• Lagrange's Four-Square Theorem
• Lagrange's Group Theorem
• Lagrange's Identity
• Lagrange's Interpolating Fundamental Polynomial
• Lagrange's Lemma
• Lagrange Spectrum
• Lagrangian Coefficient
• Lagrangian Derivative
• Laguerre Differential Equation
• Laguerre-Gauss Quadrature
• Laguerre Polynomial
• Laguerre Quadrature
• Laguerre's Method
• Laguerre's Repeated Fraction
• Laisant's Recurrence Formula
• Lakshmi Star
• Lal's Constant
• Laman's Theorem