A note on t-complementing permutations for graphs

Authors:
Lech Adamus;Beata Orchel;Artur Szymański;A. Paweł Wojda;Małgorzata Zwonek
Affiliations:
Faculty of Applied Mathematics, AGH University of Science and Technology, Al. Mickiewicza 30, 30-059 Kraków, Poland;Faculty of Applied Mathematics, AGH University of Science and Technology, Al. Mickiewicza 30, 30-059 Kraków, Poland;Faculty of Applied Mathematics, AGH University of Science and Technology, Al. Mickiewicza 30, 30-059 Kraków, Poland;Faculty of Applied Mathematics, AGH University of Science and Technology, Al. Mickiewicza 30, 30-059 Kraków, Poland;Faculty of Applied Mathematics, AGH University of Science and Technology, Al. Mickiewicza 30, 30-059 Kraków, Poland
Venue:
Information Processing Letters
Year:
2009

Citing 3
Cited 1

On cyclically K-complementary graphs

Discrete Mathematics - Special issue on graph theory and applications
On k-complementing permutations of cyclically k-complementary graphs

Discrete Mathematics - Special issue on graph theory and combinatorics
Graphs and Hypergraphs

Graphs and Hypergraphs

Cyclically t-complementary uniform hypergraphs

European Journal of Combinatorics

Quantified Score

Hi-index	0.89

Visualization

Abstract

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.