Sequential Graph

A Connected Graph having Edges is said to be sequential if it is possible to label thenodes with distinct Integers in such that when Edge is labeled , the set of Edge labels is a block of consecutive integers(Grace 1983, Gallian 1990). No Harmonious Graph is known which cannot also be labeled sequentially.

References

Gallian, J. A. ``Open Problems in Grid Labeling.'' Amer. Math. Monthly 97, 133-135, 1990.

Grace, T. ``On Sequential Labelings of Graphs.'' J. Graph Th. 7, 195-201, 1983.

• Area Principle
• Arf Invariant
• Argand Diagram
• Argand Plane
• Argoh's Conjecture
• Argument Addition Relation
• Argument (Complex Number)
• Argument (Elliptic Integral)
• Argument (Function)
• Argument Multiplication Relation
• Argument Principle
• Argument Variation
• Aristotle's Wheel Paradox
• Arithmetic
• Arithmetic-Geometric Mean
• Arithmetic Geometry
• Arithmetic-Harmonic Mean
• Arithmetic-Logarithmic-Geometric Mean Inequality
• Arithmetic Mean
• Arithmetic Progression
• Arithmetic Sequence
• Arithmetic Series
• Armstrong Number
• Arnold Diffusion
• Arnold's Cat Map