$$\lambda $$ -numbers of several classes of snarks

Dengju Ma (), Hengfeng Zhu and Jianbao He
Additional contact information
Dengju Ma: Nantong University
Hengfeng Zhu: Nantong University
Jianbao He: Nantong University

Journal of Combinatorial Optimization, 2014, vol. 28, issue 4, No 6, 787-799

Abstract: Abstract In the paper we study $$\lambda $$ -numbers of several classes of snarks. We show that the $$\lambda $$ -number of each Blanu $$\breve{s}$$ a snark, Flower snark and Goldberg snark is $$6$$ . For $$n\ge 2$$ , we show that there is a dot product of $$n$$ Petersen graphs such that its $$\lambda $$ -number is 6.

Keywords: L(2; 1)-labeling; $$\lambda $$ -number; Snark; 05C78 (search for similar items in EconPapers)
Date: 2014
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-012-9589-1 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:28:y:2014:i:4:d:10.1007_s10878-012-9589-1

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-012-9589-1

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().