Advanced Search
Home > Journals > Involve > Volume 3 > Issue 2 > Article
Open Access
2010 Minimal $k$-rankings for prism graphs
Juan Ortiz, Andrew Zemke, Hala King, Darren Narayan, Mirko Horňák
Involve 3(2): 183-190 (2010). DOI: 10.2140/involve.2010.3.183

Abstract

We determine rank numbers for the prism graph P2×Cn (P2 being the connected two-node graph and Cn a cycle of length n) and for the square of an even cycle.

Citation

Download Citation

Juan Ortiz. Andrew Zemke. Hala King. Darren Narayan. Mirko Horňák. "Minimal $k$-rankings for prism graphs." Involve 3 (2) 183 - 190, 2010. https://doi.org/10.2140/involve.2010.3.183

Information

Received: 25 March 2009; Revised: 15 April 2010; Accepted: 15 April 2010; Published: 2010
First available in Project Euclid: 20 December 2017

zbMATH: 1221.05159
MathSciNet: MR2718876
Digital Object Identifier: 10.2140/involve.2010.3.183

Subjects:
Primary: 05C15 , 05C78
Secondary: 05C35 , 05C69

Keywords: $k$-rankings , prism graphs , vertex coloring

Rights: Copyright © 2010 Mathematical Sciences Publishers

JOURNAL ARTICLE
 8 PAGES
DOWNLOAD PDF + SAVE TO MY LIBRARY
GET CITATION
< Previous Article
|
Next Article >
Vol.3 • No. 2 • 2010
MSP
Subscribe to Project Euclid
Receive erratum alerts for this article
Back to Top