scientific article; zbMATH DE number 3987327
From MaRDI portal
Publication:3751616
[For the entire collection see Zbl 0608.00005.] A polygraph is a generalization of the chemical notion of polymers. The matching polynomials of fasciagraphs and rotagraphs, which are the important special cases of a polygraph, are studied here. Explicit linear recurrence relations for the matching polynomials of fasciagraphs and rotagraphs are presented. They are calculated and discussed for a series of fasciagraphs and rotagraphs.
Recommendations
- scientific article; zbMATH DE number 6831925
- Deriving formulas for domination numbers of fasciagraphs and rotagraphs
- scientific article; zbMATH DE number 5688299
- Fubini numbers and polynomials of graphs
- Algebraic approach to fasciagraphs and rotagraphs
- Recurrence relations for graph polynomials on bi-iterative families of graphs
- On the matching and permanental polynomials of graphs
- scientific article; zbMATH DE number 4051682
- Tutte polynomials for two recursive families of graphs
Cited in
(4)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3751616)