Recently, Tittmann et al. introduced the subgraph component polynomial and showed that its power for distinguishing graphs is quite different from the power of other graph polynomials that appear in the literature such as the matching polynomial, the Tutte polynomial, the characteristic polynomial, the chromatic polynomial, etc. The subgraph component polynomial enumerates vertex induced subgraphs in a given undirected graph with respect to the number of components. We show the use of the subgraph component polynomial to count the number of primitive partial words of a given length over an alphabet of a fixed size, which leads to a method for enumerating such partial words. © 2013 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Blanchet-Sadri, F., Bodnar, M., Fox, N., & Hidakatsu, J. (2013). A graph polynomial approach to primitivity. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7810 LNCS, pp. 153–164). Springer Verlag. https://doi.org/10.1007/978-3-642-37064-9_15
Mendeley helps you to discover research relevant for your work.