On several classes of monographs

Kiki Ariyanti, J. Ryan

Research output: Contribution to journalArticlepeer-review

4 Citations (Scopus)


Let G = (V, E) be a finite (non-empty) graph. A monograph is a graph in which all vertices are assigned distinct real number labels so that the positive difference of the end-vertices of every edge is also a vertex label. In this paper we study the properties of monographs and construct signatures for several classes of graph, such as cycles, cycles with chord, fan graphs Fn, kite graphs, chains of monographs and necklaces of monographs.

Original languageEnglish
Pages (from-to)277-284
Number of pages8
JournalAustralasian Journal of Combinatorics
Publication statusPublished - 1 Dec 2007

Fingerprint Dive into the research topics of 'On several classes of monographs'. Together they form a unique fingerprint.

Cite this