On maximal independent sets in circulant digraphs

Reference : On maximal independent sets in circulant digraphs


	Document type :	E-prints/Working papers : First made available on ORBilu
	Discipline(s) :	Physical, chemical, mathematical & earth Sciences : Mathematics
	Focus Areas :	Computational Sciences
	To cite this reference:	http://hdl.handle.net/10993/35522

Title :	On maximal independent sets in circulant digraphs
Language :	English
Author, co-author :	Bisdorff, Raymond [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
Publication date :	12-Feb-2007
Edition :	Final version
Number of pages :	11
Peer reviewed :	No
Keywords :	[en] 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 centres :	University of Luxembourg, Applied Mathematics Unit
Target :	Researchers ; Students
Permalink :	http://hdl.handle.net/10993/35522

File(s) associated to this reference

Fulltext file(s):

	File	Commentary	Version	Size	Access
Open access	rb-wp-sma2007Feb12.pdf		Publisher postprint	191.05 kB	View/Open

All documents in ORBi^lu are protected by a user license.