dc.contributor.author | Fronček, Dalibor | |
dc.contributor.author | Kovářová, Tereza | |
dc.date.accessioned | 2007-06-25T10:52:10Z | |
dc.date.available | 2007-06-25T10:52:10Z | |
dc.date.issued | 2007 | |
dc.identifier.citation | Ars Combinatoria. 2007, vol. 83, April, p. 129-144. | en |
dc.identifier.issn | 0381-7032 | |
dc.identifier.uri | http://hdl.handle.net/10084/60685 | |
dc.language.iso | en | en |
dc.publisher | Charles Babbage Research Centre | en |
dc.relation.ispartofseries | Ars Combinatoria | en |
dc.title | 2n-cyclic blended labeling of graphs | en |
dc.type | article | en |
dc.identifier.location | Není ve fondu ÚK | en |
dc.description.abstract-en | We develop a new type of it vertex labeling of graphs, namely 2n-cyclic blended labeling, which is a generalization of some previously known labelings. We prove that a grapth with this labeling factorizes the complete graph on 2-nk vertices, where k is odd and n, k > 1. | en |
dc.identifier.wos | 000246072500008 | |