Convention Need a solution for abstract management? All Academic can help! Contact us today to find out how our system can help your annual meeting. Submission - Custom fields, multiple submission types, tracks, audio visual, multiple upload formats, automatic conversion to pdf. Review - Peer Review, Bulk reviewer assignment, bulk emails, ranking, z-score statistics, and multiple worksheets! Reports - Many standard and custom reports generated while you wait. Print programs with participant indexes, event grids, and more! Scheduling - Flexible and convenient grid scheduling within rooms and buildings. Conflict checking and advanced filtering. Communication - Bulk email tools to help your administrators send reminders and responses. Use form letters, a message center, and much more! Management - Search tools, duplicate people management, editing tools, submission transfers, many tools to manage a variety of conference management headaches! Click here for more information.
Association: Name: The Mathematical Association of America MathFest URL: http://www.maa.org
Citation: URL: http://www.allacademic.com/meta/p377971_index.html Direct Link: HTML Code:

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, Aug 06, 2009 <Not Available>. 2009-08-10 <http://www.allacademic.com/meta/p377971_index.html>

Starr, C. and Laison, J. , 2009-08-06 "2-odd Graphs and Prime Distance Graphs" Paper presented at the annual meeting of the The Mathematical Association of America MathFest <Not Available>. 2009-08-10 from http://www.allacademic.com/meta/p377971_index.html

Publication Type: Conference Paper/Unpublished Manuscript Review Method: Peer Reviewed Abstract: A graph $\$G\$$ is a $\{\backslash bf\; prime-distance\; graph\}$ 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 $\{\backslash bf\; 2-odd\}$ 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.

Learning, Not Priming: Reconsidering the Evidence for the Priming Hypothesis

Pizza Delivery: 2-Stop-Return Distances in Graphs

Distance Properties of Graphs

Exploring Prime Distances With MATHEMATICA and The VOYAGE 200 CAS