Representations of Split Graphs, Their Complements, Stars, and Hypercubes

@inproceedings{Narayan2007RepresentationsOS,
  title={Representations of Split Graphs, Their Complements, Stars, and Hypercubes},
  author={Darren A. Narayan and Jim Urick},
  year={2007}
}
A graph G has a representation modulo n if there exists an injective map f : V (G) → {0, 1, . . . , n} such that vertices u and v are adjacent if and only if |f(u) − f(v)| is relatively prime to n. The representation number rep(G) is the smallest n such that G has a representation modulo n. We present new results involving representation numbers for stars, split graphs, complements of split graphs, and hypercubes. 

References

Publications referenced by this paper.
Showing 1-10 of 11 references

Problem 380

  • D. Narayan
  • Representations of graphs modulo n, Discrete Math…
  • 2002
1 Excerpt

Representations of graphs modulo n

  • J. Urick
  • Discrete Math
  • 2000

Similar Papers

Loading similar papers…