scientific article; zbMATH DE number 1109416

MaRDI QIDQ4374728zbMATH OpenFDO

Authors T. Gangopadhyay

Publication date 25 January 1998

zbMATH Keywords

decomposition of graphsself-complementary graphsstable complementary permutation

Mathematics Subject Classification ID

Other designs, configurations (05B30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Review text

The paper deals with the problem of the decomposition of a complete graph into isomorphic factors. This problem is introduced as a generalization of a self-complementary graph, and called a {\(t\)-sc graph} (\(t\) is the number of factors). A \(t\)-sc graph has a {stable self-complementing permutation} \(\pi \) if all its factors are obtained by iterating \(\pi \) on the first one, and also \(\pi ^t=\) id. Some sufficient conditions for a graph to have a stable complementing permutation are proved and several counterexamples to possible improvements are constructed.

Recommendations

• scientific article; zbMATH DE number 734478
• A note on \(t\)-complementing permutations for graphs
• On k-complementing permutations of cyclically k-complementary graphs
• Complementation in T-perfect graphs
• Stability for t-intersecting families of permutations
• scientific article; zbMATH DE number 3900817
• scientific article; zbMATH DE number 3919840
• scientific article; zbMATH DE number 1457239
• Self-complementing permutations of k-uniform hypergraphs
• scientific article; zbMATH DE number 21737

Cited in

(3)

• On k-complementing permutations of cyclically k-complementary graphs
• scientific article; zbMATH DE number 734478 (Why is no real title available?)
• A note on \(t\)-complementing permutations for graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4374728)