| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4648194 | Discrete Mathematics | 2012 | 7 Pages |
Abstract
We study the representation number for some special sparse graphs. For graphs with a single edge and for complete binary trees we give an exact formula, and for hypercubes we improve the known lower bound. We also study the prime factorization of the representation number of graphs with one edge.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Reza Akhtar,