Paper Info
Title
Factors of disconnected graphs and polynomials with nonnegative integer coefficients
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 natural conditions, it factors uniquely under the given products. If, on the contrary, n = 6 or 10, all cases of nonunique factorisation are described precisely.
Year
DOI
Venue
2012
10.26493/1855-3974.202.37f
ARS MATHEMATICA CONTEMPORANEA
Keywords
Field
DocType
Graphs,monoids,factorisation
Prime (order theory),Integer,Uniqueness,Discrete mathematics,Combinatorics,Direct product,Polynomial,Monoid,Factorization,Mathematics,Cartesian coordinate system
Journal
Volume
Issue
ISSN
5
2
1855-3966
Citations 
PageRank 
References 
0
0.34
0
Authors
1
Name
Order
Citations
PageRank
Christiaan Van De Woestijne1132.33