Bipartite graphs as polynomials and polynomials as bipartite graphs

DOI10.1142/S0219498821500833zbMath1477.05091MaRDI QIDQ5162789

Andrey Grinblat, Viktor Lopatkin

Publication date: 5 November 2021

Published in: Journal of Algebra and Its Applications (Search for Journal in Brave)

zbMATH Keywords

polynomialsPetri netsZariski topologybipartite graphsdividing in semiringsWinskel's morphisms

Mathematics Subject Classification ID

Graph polynomials (05C31) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Parallel algorithms in computer science (68W10) Polynomials over commutative rings (13B25) Polynomials (irreducibility, etc.) (11R09) Semirings (16Y60) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Two remarks on the adjoint polynomial
• The interlace polynomial of a graph
• Petri nets, algebras, morphisms, and compositionality
• A note on the values of independence polynomials at \(-1\)
• Graph-Theoretic Concepts in Computer Science
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item