## Abstract

A graph has a representation modulo n if there exists an injective map f: {V(G)} -> {0, 1, ... , n @ 1} such that vertices u and v are adjacent if and only if |f(u)@f(v)| is relatively prime to n. The representation number is the smallest n such that G has a representation modulo n. We seek the maximum value for the representation number over graphs of a fixed order. Erdos and Evans provided an upper bound in their proof that every finite graph can be represented modulo some positive integer. In this note we improve this bound and show that the new bound is best possible (Refer to PDF file for exact formulas).

## Publication Date

2003

## Document Type

Article

## Department, Program, or Center

School of Mathematical Sciences (COS)

## Recommended Citation

D. Narayan, An upper bound for the representation number of graphs with fixed order, Integers 3 (2003) #A12. http://math.colgate.edu/~integers/vol3.html

## Campus

RIT – Main Campus

## Comments

Copyright 2003 The Author

The author is indebted to a referee for many valuable suggestions, including an improved presentation of the proof of Theorem 3. This work was partially supported by a RIT College of Science Dean's Summer Research Fellowship Grant and a Reidler Foundation Grant. Thanks to Anthony Evans and Garth Isaak for useful discussions. Finally the author thanks Dustin Sheffield, now an undergraduate at Virginia Tech, for preliminary computer simulations.

Note: imported from RIT’s Digital Media Library running on DSpace to RIT Scholar Works in February 2014.