Abstract

A graph is said to be representable modulo n if its vertices can be labelled with distinct integers between 0 and n - 1 inclusive such that two vertices are adjacent if and only if their labels are relatively prime to n. The representation number of graph G is the smallest n representing G. We review known results and investigate representation numbers for several new classes. In particular, we relate the representation number of the disjoint union of complete graphs to the existence of complete families of mutually orthogonal Latin squares.

Publication Date

1994

Comments

Copyright 1994 John Wiley & Sons, Ltd. All rights reserved. ISSN:0364-9024 Note: imported from RIT’s Digital Media Library running on DSpace to RIT Scholar Works in February 2014.

Document Type

Article

Department, Program, or Center

School of Mathematical Sciences (COS)

Campus

RIT – Main Campus

Share

COinS