Reference : On maximal independent sets in circulant digraphs
E-prints/Working papers : First made available on ORBilu
Physical, chemical, mathematical & earth Sciences : Mathematics
Computational Sciences
On maximal independent sets in circulant digraphs
Bisdorff, Raymond mailto [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
Final version
[en] Graph Theory ; Maximal Independent set ; graph automorphism
[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
University of Luxembourg, Applied Mathematics Unit
Researchers ; Students

File(s) associated to this reference

Fulltext file(s):

Open access
rb-wp-sma2007Feb12.pdfPublisher postprint191.05 kBView/Open

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.