A note on t-complementing permutations for graphs

作者：Adamus Lech^*; Orchel Beata; Szymanski Artur; Wojda A Pawel; Zwonek Malgorzata

来源：Information Processing Letters, 2009, 110(2): 44-45.

DOI：10.1016/j.ipl.2009.10.004

• Self-complementary graph
• Self-complementing permutation
• Combinatorial problems
• Graph algorithms

In this note we present a necessary and sufficient condition for a permutation to be t-complementing which is a natural generalization of the well-known result concerning self-complementing permutations.

• 出版日期2009-12-16