Decompositions of regular graphs into \(K^ c_ n \vee 2K_ 2\)
type: Item
instance of: scholarly article
title: Decompositions of regular graphs into \(K^ c_ n \vee 2K_ 2\)
zbMATH Open document ID: 0861.05054
DOI: 10.1016/0012-365X(94)00026-F
author: Yanyan Li
published in: Discrete Mathematics
publication date: 1996-11-13T00:00:00Z
review text: The graph \(K^c_n\vee 2K_2\) is obtained from a set of \(n\) vertices and a graph \(2K_2\), by joining each of the \(n\) vertices to each vertex of \(2K_2\). In the paper a \(\rho\)-valuation of \(K^c_n\vee 2K_2\) is found. This result implies a number of graph decomposition results. For instance, it follows that every graph \(K_{8n+5}\) cyclically decomposes into edge-disjoint copies of \(K^c_n\vee 2K_2\).
Mathematics Subject Classification ID: 05C78
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 932549
zbMATH Keywords: regular graphs
zbMATH Keywords: graceful
zbMATH Keywords: labeling
zbMATH Keywords: graph decomposition
reviewed by: Mirosław Truszczyński
MaRDI profile type: Publication
cites work: The Oberwolfach problem and factors of uniform odd length cycles
cites work: Q3768939
cites work: Q5422499
cites work: Q5543326
cites work: On sequential labelings of graphs
cites work: Decompositions of regular bipartite graphs
cites work: Q4026150
cites work: Q4108366
cites work: Q5589124
description: scientific article; zbMATH DE number 932549