Back to search

McMaster University

Products and Factorizations of Graphs

Abstract

dc:description.abstract

It is shown that the cardinal product of graphs does not satisfy unique prime factorization even for a very restrictive class of graphs. It is also proved that every connected graph has a decomposition as a weak cartesian product into indecomposable factors and that this decomposition is unique to within isomorphisms. This latter result is established by considering a certain class of equivalence relations on the edge set of a graph and proving that this collection is a principal filter in the lattice of all equivalences. The least element of this filter is then used to decompose the graph into a weak cartesian product of prime graphs that is unique to within isomorphisms.

Degree

thesis:*
Department dc:contributor.department
Mathematics
Year dc:date.issued
1967

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Miller, Donald J.
Advisor dc:contributor.advisor
  • Sabidussi, G.

Subjects

dc:subject × 1

Rights

Language dc:language.iso
en_US

Identifiers

dc:identifier.*

Chain of custody

source
Harvested from
McMaster University
Base URL
macsphere.mcmaster.ca/server/oai/request
Last updated
2026-11-18
Source record
OAI-PMH GetRecord
citation

Miller, Donald J.. Products and Factorizations of Graphs. 1967. http://hdl.handle.net/11375/19666