Eprint first made available on ORBilu (E-prints, Working papers and Research blog)
On maximal independent sets in circulant digraphs
Bisdorff, Raymond
2007
 

Files


Full Text
rb-wp-sma2007Feb12.pdf
Publisher postprint (195.64 kB)
Download

All documents in ORBilu are protected by a user license.

Send to



Details



Keywords :
Graph Theory; Maximal Independent set; graph automorphism
Abstract :
[en] In this research note we introduce St-Nicolas graphs, i.e. circulant digraphs showing exactly n maximal independent sets, isomorph under the digraph’s automorphisms group. This class of digraphs represent a generalisation of Andrásfai graphs with interesting links to finite group theory.
Research center :
University of Luxembourg, Applied Mathematics Unit
Disciplines :
Mathematics
Author, co-author :
Bisdorff, Raymond ;  University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC)
Language :
English
Title :
On maximal independent sets in circulant digraphs
Publication date :
12 February 2007
Version :
Final version
Number of pages :
11
Focus Area :
Computational Sciences
Available on ORBilu :
since 24 April 2018

Statistics


Number of views
39 (3 by Unilu)
Number of downloads
43 (0 by Unilu)

Bibliography


Similar publications



Contact ORBilu