Labeled Graph

A labeled graph is a finite series of Vertices with a set ofEdges of 2-Subsets of . Given a Vertex set, 2, ..., , the number of labeled graphs is given by . Two graphs and withVertices are said to be Isomorphic ifthere is a Permutation of such that is in the set of Edges Iff is in the set of Edges .

References

Cahit, I. ``Homepage for the Graph Labelling Problems and New Results.'' http://193.140.42.134/~cahit/CORDIAL.html.

Gallian, J. A. ``Graph Labelling.'' Elec. J. Combin. DS6, 1-43, Mar. 5, 1998. http://www.combinatorics.org/Surveys/.

• h-Cobordism Theorem
• Heads Minus Tails Distribution
• Heap
• Heapsort
• Heart Surface
• Heat Conduction Equation
• Heat Conduction Equation--Disk
• Heaviside Calculus
• Heaviside Step Function
• Heawood Conjecture
• Hebesphenomegacorona
• Hecke Algebra
• Hecke L-Function
• Hecke Operator
• Hecke Ring
• Hectogon
• Hedgehog
• Heegaard Diagram
• Heegaard Splitting
• Heegner Number
• Heesch Number
• Heesch's Problem
• Height
• Heilbronn Triangle Problem
• Heine-Borel Theorem