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)
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.
|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:||07 Jan 2017 04:17|