2n-Cyclic blended labeling of graphs

Dalibor Fronček; Tereza Kovářová

2n-Cyclic blended labeling of graphs

Dalibor Fronček, Tereza Kovářová

Mathematics & Statistics

Research output: Contribution to journal › Article › peer-review

2 Scopus citations

Abstract

We develop a new type of a vertex labeling of graphs, namely 2n-cyclic blended labeling, which is a generalization of some previously known labelings. We prove that a graph with this labeling factorizes the complete graph on 2nk vertices, where k is odd and n, k > 1.

Original language	English (US)
Pages (from-to)	129-144
Number of pages	16
Journal	Ars Combinatoria
Volume	83
State	Published - Apr 2007

OpenUrl availability

Full text

Cite this

@article{520b99e896db434097b934d0d24abca0,

title = "2n-Cyclic blended labeling of graphs",

abstract = "We develop a new type of a vertex labeling of graphs, namely 2n-cyclic blended labeling, which is a generalization of some previously known labelings. We prove that a graph with this labeling factorizes the complete graph on 2nk vertices, where k is odd and n, k > 1.",

author = "Dalibor Fron{\v c}ek and Tereza Kov{\'a}{\v r}ov{\'a}",

year = "2007",

month = apr,

language = "English (US)",

volume = "83",

pages = "129--144",

journal = "Ars Combinatoria",

issn = "0381-7032",

publisher = "Charles Babbage Research Centre",

}

TY - JOUR

T1 - 2n-Cyclic blended labeling of graphs

AU - Fronček, Dalibor

AU - Kovářová, Tereza

PY - 2007/4

Y1 - 2007/4

N2 - We develop a new type of a vertex labeling of graphs, namely 2n-cyclic blended labeling, which is a generalization of some previously known labelings. We prove that a graph with this labeling factorizes the complete graph on 2nk vertices, where k is odd and n, k > 1.

AB - We develop a new type of a vertex labeling of graphs, namely 2n-cyclic blended labeling, which is a generalization of some previously known labelings. We prove that a graph with this labeling factorizes the complete graph on 2nk vertices, where k is odd and n, k > 1.

UR - http://www.scopus.com/inward/record.url?scp=34248510067&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=34248510067&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:34248510067

SN - 0381-7032

VL - 83

SP - 129

EP - 144

JO - Ars Combinatoria

JF - Ars Combinatoria

ER -

2n-Cyclic blended labeling of graphs

Abstract

OpenUrl availability

Other files and links

Fingerprint

Cite this