TY - JOUR
T1 - Prime vertex labelings of several families of graphs
AU - Diefenderfer, Nathan
AU - Ernst, Dana C.
AU - Hastings, Michael G.
AU - Heath, Levi N.
AU - Prawzinsky, Hannah
AU - Preston, Briahna
AU - Rushall, Jeff
AU - White, Emily
AU - Whittemore, Alyssa
N1 - Publisher Copyright:
© 2016, Mathematical Sciences Publishers. All rights reserved.
PY - 2016
Y1 - 2016
N2 - A simple and connected n-vertex graph has a prime vertex labeling if the vertices can be injectively labeled with the integers 1, 2, 3, …, n such that adjacent vertices have relatively prime labels. We will present previously unknown prime vertex labelings for new families of graphs, including cycle pendant stars, cycle chains, prisms, and generalized books.
AB - A simple and connected n-vertex graph has a prime vertex labeling if the vertices can be injectively labeled with the integers 1, 2, 3, …, n such that adjacent vertices have relatively prime labels. We will present previously unknown prime vertex labelings for new families of graphs, including cycle pendant stars, cycle chains, prisms, and generalized books.
KW - graph labeling
KW - prime graphs
KW - prime vertex labeling
UR - http://www.scopus.com/inward/record.url?scp=85056189355&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85056189355&partnerID=8YFLogxK
U2 - 10.2140/involve.2016.9.667
DO - 10.2140/involve.2016.9.667
M3 - Article
AN - SCOPUS:85056189355
SN - 1944-4176
VL - 9
SP - 667
EP - 688
JO - Involve
JF - Involve
IS - 4
ER -