Representations of graphs modulo n

Show full item record

Title: Representations of graphs modulo n
Author: Evans, Anthony; Isaak, Garth; Narayan, Darren
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.
Description: Copyright 1994 John Wiley & Sons, Ltd. All rights reserved.
Record URI: http://hdl.handle.net/1850/4708
Date: 1994

Files in this item

Files Size Format View
DNarayanArticle12-1994.pdf 177.2Kb PDF View/Open

The following license files are associated with this item:

This item appears in the following Collection(s)

Show full item record

Search RIT DML


Advanced Search

Browse