Counting independent sets in certain classes of (almost) regular graphs

Burstein, Alexander and Kitaev, Sergey and Mansour, Toufik (2008) Counting independent sets in certain classes of (almost) regular graphs. Pure Mathematics and Applications, 19 (2-3). pp. 17-26. ISSN 1218-4586

Abstract

We enumerate the independent sets of several classes of regular and almost regular graphs and compute the corresponding generating functions. We also note the relations between these graphs and other combinatorial objects and, in some cases, construct the corresponding bijections.

ORCID iDs

Kitaev, Sergey ORCID: https://orcid.org/0000-0003-3324-1647

• Share and Export
  

  RDF+XMLBibTeXRIOXX2 XMLRDF+N-TriplesJSONDublin CoreAtomSimple MetadataReferMETSHTML CitationASCII CitationOpenURL ContextObjectEndNoteOpenURL ContextObject in SpanMODSMPEG-21 DIDLEP3 XMLData Cite XMLRIS (EndNote Online, Zotero, Ref manager, etc)RDF+N3Multiline CSV
• Item metadata

  Item type:	Article
  ID code:	49909
  Dates:	Date Event 2008 Published
  Subjects:	Science > Mathematics
  Department:	Faculty of Science > Computer and Information Sciences
  Depositing user:	Pure Administrator
  Date deposited:	21 Oct 2014 10:30
  Last modified:	11 Nov 2024 10:49
  Related URLs:	https://personal.cis.strath.ac.uk/sergey... Journal or Publication
  URI:	https://strathprints.strath.ac.uk/id/eprint/49909