Independent sets on path-schemes

Kitaev, Sergey (2006) Independent sets on path-schemes. Journal of Integer Sequences, 9. 06.2.2.

Abstract

We give the generating function for the number of independent sets on the class of well-based path-schemes (a kind of regularly structured graph), which generalizes the known result in this direction.

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:	49792
  Dates:	Date Event 2006 Published
  Subjects:	Science > Mathematics > Electronic computers. Computer science
  Department:	Faculty of Science > Computer and Information Sciences
  Depositing user:	Pure Administrator
  Date deposited:	14 Oct 2014 13:32
  Last modified:	11 Nov 2024 10:48
  Related URLs:	https://cs.uwaterloo.ca/journals/JIS/VOL...
  URI:	https://strathprints.strath.ac.uk/id/eprint/49792