Factors of disconnected graphs and polynomials with nonnegative integer coefficients

DOI10.26493/1855-3974.202.37FMaRDI QIDQ4906180zbMATH OpenOpenAlexWikidataFDO

Authors Christiaan E. van de Woestijne

Publication date 7 February 2013

Published in Ars Mathematica Contemporanea (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1103.0709

zbMATH Keywords

factorisation.monoids

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph operations (line graphs, products, etc.) (05C76) Divisibility and factorizations in commutative rings (13A05) Arithmetic theory of semigroups (20M13)

Abstract: We investigate the uniqueness of factorisation of possibly disconnected finite graphs with respect to the Cartesian, the strong and the direct product. It is proved that if a graph has $n$ connected components, where $n$ is prime, or $n=1,4,8,9$, and satisfies some additional conditions, it factors uniquely under the given products. If, on the contrary, $n=6$ or 10, all cases of nonunique factorisation are described precisely.

Recommendations

• A note on polynomials and \(f\)-factors of graphs
• scientific article; zbMATH DE number 6831925
• scientific article; zbMATH DE number 510330
• Polynomial factorisation and an application to regular directed graphs
• scientific article; zbMATH DE number 5663233
• Connected \([k,k+1]\)-factors of graphs
• Factorizations of and by powers of complete graphs
• Connected \([a,b]\)-factors in graphs
• Factorisation of greedoid polynomials of rooted digraphs
• Factors and factorization of graphs

Cited in

(5)

• Unique prime Cartesian factorization of graphs over finite fields
• A prime factor theorem for bipartite graphs
• Factorizations of polynomials with integral non-negative coefficients
• Arithmetic of semigroup semirings.
• A heuristic technique for decomposing multisets of non-negative integers according to the Minkowski sum

This page was built for publication: Factors of disconnected graphs and polynomials with nonnegative integer coefficients

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