Work

Monoidne algebre in grafovski produkti

Year: 2025

Type: article

Abstract: In this note, we extend results about unique n^th roots and cancellation of finite disconnected graphs with respect to the Cartesian, the strong and the direct product, to the rooted hierarchical products, and to a modified lexicographic product. We show that these results also hold for graphs with countably many finite connected components, as long as every connected component appears only finitely often (up to isomorphism). The proofs are via monoid algebras and generalized power series rings.

Source: Repository of the University of Primorsk (University of Primorska)

Authors: Imrich, Wilfried, Klep, Igor, Smertnig, Daniel

Language: English

Topic: Rings, Modules, and Algebras

Subfield: Algebra and Number Theory

Field: Mathematics

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W7115287058

FWCI:

Cites:

Cited by:

Related to: