Name
Abstract | ||
|---|---|---|
To calculate the genus polynomials for a recursively specifiable sequence of graphs, the set of cellular imbeddings in oriented surfaces for each of the graphs is usually partitioned into imbedding-types. The effects of a recursively applied graph operation tau on each imbedding-type are represented by a production matrix. When the operation tau amounts to constructing the next member of the sequence by attaching a copy of a fixed graph H to the previous member, Stahl called the resulting sequence of graphs an H -linear family. We demonstrate herein how representing the imbedding types by strings and the operation tau by string operations enables us to automate the calculation of the production matrices, a task requiring time proportional to the square of the number of imbedding-types. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.26493/1855-3974.939.77d | ARS MATHEMATICA CONTEMPORANEA |
Keywords | Field | DocType |
Graph imbedding,genus polynomial,production matrix,transfer matrix method | Graph,Combinatorics,Polynomial,Matrix (mathematics),Mathematics,Recursion,String operations | Journal |
Volume | Issue | ISSN |
15 | 2 | 1855-3966 |
Citations | PageRank | References |
1 | 0.35 | 7 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jonathan L. Gross | 1 | 458 | 268.73 |
| Imran F. Khan | 2 | 36 | 4.37 |
| Toufik Mansour | 3 | 423 | 87.76 |
| Thomas W. Tucker | 4 | 191 | 130.07 |