## Sequential Graph

A Connected Graph having Edges is said to be sequential if it is possible to label the nodes 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.