A Graph Polynomial Approach to Primitivity

DOI10.1007/978-3-642-37064-9_15MaRDI QIDQ4910454zbMATH OpenOpenAlexFDO

Authors M. Bodnar, Nathan Fox, Joe Hidakatsu, F. Blanchet-Sadri

Publication date 18 March 2013

Published in Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-37064-9_15

Mathematics Subject Classification ID

Graph polynomials (05C31) Combinatorics on words (68R15)

Recommendations

• A result on polynomials derived via graph theory
• scientific article; zbMATH DE number 861331
• scientific article; zbMATH DE number 4185668
• scientific article; zbMATH DE number 3916315
• The graph polynomials and their equivalence
• Computing the Hosoya polynomial of graphs from primary subgraphs
• Polynomial graph invariants and linear hierarchies
• scientific article; zbMATH DE number 7310072
• A graph-theoretic approach to Jacobsthal polynomials
• scientific article; zbMATH DE number 1998285

Cited in

(7)

• Note on the subgraph component polynomial
• Squares and primitivity in partial words
• Meshfree methods for simulation fluid-structure interactions
• An abstraction of Whitney's broken circuit theorem
• Border correlations, lattices, and the subgraph component polynomial
• Computing primitively-rooted squares and runs in partial words
• Orbit polynomial graphs of prime order

This page was built for publication: A Graph Polynomial Approach to Primitivity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4910454)