Independent sets on path-schemes

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

Full text not available in this repository.Request a copy from the Strathclyde author

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.

Author(s):Kitaev, Sergey
Item type:Article
ID code:49792
Keywords:independent sets, path-schemes, generating functions, string avoidance, Electronic computers. Computer science, Discrete Mathematics and Combinatorics
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:03 Jan 2019 14:07
Related URLs:
URI:https://strathprints.strath.ac.uk/id/eprint/49792
Export data:
CORE (COnnecting REpositories)