### 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 1 2007 |

## Fingerprint Dive into the research topics of '2n-Cyclic blended labeling of graphs'. Together they form a unique fingerprint.

## Cite this

Fronček, D., & Kovářová, T. (2007). 2n-Cyclic blended labeling of graphs.

*Ars Combinatoria*,*83*, 129-144.