Showing 1 through 1 of 1 records.
| 1. Starr, Colin. and Laison, Josh. "2-odd Graphs and Prime Distance Graphs" Paper presented at the annual meeting of the The Mathematical Association of America MathFest, Portland Marriott Downtown Waterfront, Portland, OR, Aug 06, 2009 <Not Available>. 2009-11-28 <http://www.allacademic.com/meta/p377971_index.html>Publication Type: Conference Paper/Unpublished Manuscript
Review Method: Peer Reviewed
Abstract: A graph is a if the vertices can be labeled with distinct integers in such a way that the differences between the labels on adjacent vertices are all prime. A graph is if the differences are either exactly 2 or odd. We present a characterization of 2-odd graphs and a family of 2-odd circulant graphs. We also offer a conjecture relating prime distance graphs and 2-odd graphs. |
|
