On cyclically \(K\)-complementary graphs
type: Item
instance of: scholarly article
title: On cyclically \(K\)-complementary graphs
zbMATH Open document ID: 0795.05134
DOI: 10.1016/0012-365X(92)00467-6
author: Jose M. Bernaldez
published in: Discrete Mathematics
publication date: 1994-09-07T00:00:00Z
review text: As a generalization of the concept of self-complementary graph, the author introduces the concept of cyclically \(k\)-complementary graph. Let \(K_ n\) be complete graph of order \(n\), and \(\{H_ i:i = 1,2, \dots, k\}\) be an isomorphic factorization of \(K_ n\). A graph isomorphic to \(H_ i\) is called cyclically \(k\)-complementary, if there is a permutation \(\beta\) of \(V(K_ n)\) such that \(\beta\) is an isomorphism from \(H_ i\) to \(H_{i+1}\) for each \(i\). The paper investigates conditions for the existence of cyclically \(k\)-complementary graphs.
Mathematics Subject Classification ID: 05C99
Mathematics Subject Classification ID: 05C60
zbMATH DE Number: 562619
zbMATH Keywords: self-complementary graphs
zbMATH Keywords: isomorphism
reviewed by: László A. Székely
MaRDI profile type: Publication
cites work: The divisibility theorem for isomorphic factorizations of complete graphs
cites work: Selbstkomplementäre Graphen
cites work: Q5730676
description: scientific article; zbMATH DE number 562619