{"id":{"repo_id":"mcmaster","oai_identifier":"oai:macsphere.mcmaster.ca:11375/19666"},"canonical_url":"https://search.ndltd.org/etd/mcmaster/oai:macsphere.mcmaster.ca:11375/19666","repository":{"repo_id":"mcmaster","name":"McMaster University","base_url":"https://macsphere.mcmaster.ca/server/oai/request"},"display":{"title":"Products and Factorizations of Graphs","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.","abstract_html":"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.","abstract_has_math":false,"creators":["Miller, Donald J."],"institution":null,"degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Mathematics","school":null,"contributors":[],"advisors":["Sabidussi, G."],"committee_chairs":[],"committee_members":[],"year":1967,"date_issued":"1967-05","date_published":"1967-05","updated_at":"2026-11-18T19:32:33Z","subjects":["products, factorizations, graphs, prime, isomorphisms"],"languages":["en_US"],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://doi.org/10.71548/12243"],"render_values":[{"text":"https://doi.org/10.71548/12243","href":"https://doi.org/10.71548/12243","code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/11375/19666","outbound_label":"Handle","outbound_source":"dc:identifier.uri","record_url":"http://hdl.handle.net/11375/19666","record_label":"Repository record","record_kind":"handle","record_source":"dc:identifier.uri","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://macsphere.mcmaster.ca/server/oai/request?verb=GetRecord&metadataPrefix=dim&identifier=oai%3Amacsphere.mcmaster.ca%3A11375%2F19666","prefix":"dim"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Sabidussi, G."]},{"key":"dc:contributor.department","label":"Department","values":["Mathematics"]},{"key":"dc:creator","label":"Author","values":["Miller, Donald J."]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2016-06-28T16:33:27Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2016-06-28T16:33:27Z"]},{"key":"dc:date.issued","label":"Date","values":["1967-05"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["products, factorizations, graphs, prime, isomorphisms"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en_US"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/11375/19666","https://doi.org/10.71548/12243"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["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."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["Doctor of Philosophy (PhD)"]},{"key":"dc:title","label":"Title","values":["Products and Factorizations of Graphs"]},{"key":"others:access_status","label":"Others Access Status","values":["open.access"]}]}],"canonical_facts":{"dc:contributor.advisor":["Sabidussi, G."],"dc:contributor.department":["Mathematics"],"dc:creator":["Miller, Donald J."],"dc:date.accessioned":["2016-06-28T16:33:27Z"],"dc:date.available":["2016-06-28T16:33:27Z"],"dc:date.issued":["1967-05"],"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."],"dc:description.degree":["Doctor of Philosophy (PhD)"],"dc:identifier.uri":["http://hdl.handle.net/11375/19666","https://doi.org/10.71548/12243"],"dc:language.iso":["en_US"],"dc:subject":["products, factorizations, graphs, prime, isomorphisms"],"dc:title":["Products and Factorizations of Graphs"],"dc:type":["Thesis"],"others:access_status":["open.access"]},"updated_at":"2026-11-18T19:32:33Z"}