{"id":{"repo_id":"mcmaster","oai_identifier":"oai:macsphere.mcmaster.ca:11375/8743"},"canonical_url":"https://search.ndltd.org/etd/mcmaster/oai:macsphere.mcmaster.ca:11375/8743","repository":{"repo_id":"mcmaster","name":"McMaster University","base_url":"https://macsphere.mcmaster.ca/server/oai/request"},"display":{"title":"Decompositions of complete multipartite graphs and group divisible designs into isomorphic factors","abstract":"<p>A multipartite graph Km₁, m₂, ..., mr (group divisible design GDD) is (t,d)-decomposable if it can be decomposed into t factors with the same diameter d. The graph Km₁, m₂, ..., mr (design GDD) is (t,d)-isodecomposable if the factors are moreover isomorphic. Km₁, m₂, ..., mr (GDD) is admissible for a given t if its number of edges (or blocks) is divisible by t. fr(t,d) or gr(t,d), respectively, is the minimum number of vertices of a (t,d)-decomposable or (t,d)-isodecomposable complete r-partite graph, respectively. gr(t,d) is the minimum number such that for every p ≥ gr(t,d) there exists a (t,d)-isodecomposable r-partite graph with p vertices, and hr(t,d) is the minimum number such that all admissible r-partite graphs with p ≥ hr (t,d) vertices are (t,d)-isodecomposable.</p> <p>We completely determine the spectrum of all bipartite and tripartite (2,d)-isodecomposable graphs. We show that f₂(2,d) = g₂(2,d) = g₂(2,d) =h₂(2,d) and f₃(2,d) = g₃(2,d) = g₃(2,d) for each d, that is possible, while h₃(2,2) = ∞ (i.e., for any given p, there is an admissible graph with more than p vertices which is not (2,2)-isodecomposable), h₃(2,3) = g₃(2,3) +2, h₃(2,4) = g₃(2,4) and h₃(2,5) = g₃(2,5) + 1.</p> <p>For complete four-partite graphs we completely determine the spectrum of (2, d)-isodecomposable graphs with at most one odd part. For the remaining admissible graphs, namely for those with all odd parts, we show that there is no such (2,5)-isodecomposable graph. For d = 2,3,4 we solve the problem in this class completely for the graphs Kn,n,n,m and Kn,n,m,m.</p> <p>For all r ≥ 5 we determine smallest (2,d)-isodecomposable r-partite graphs for all possible diameters and show that also in these cases always gr(2,d) = gr'(2,d). Some values of hr(2,d) are also determined.</p> <p>We furthermore prove that if a GDD with r ≥ 3 groups is (2,d)-isodecomposable, then d ≤ 4 or d = ∞. We show that for every admissible n there exists a (2,3)- and (2,4)-isodecomposable 3 - GDD(n,3), i.e., a GDD with 3 groups of cardinality n and block size 3.</p> <p>Finally, we determine the spectrum of the designs 3 - GDD(n,3) which are decomposable into unicyclic factors.</p>","abstract_html":"&lt;p&gt;A multipartite graph Km₁, m₂, ..., mr (group divisible design GDD) is (t,d)-decomposable if it can be decomposed into t factors with the same diameter d. The graph Km₁, m₂, ..., mr (design GDD) is (t,d)-isodecomposable if the factors are moreover isomorphic. Km₁, m₂, ..., mr (GDD) is admissible for a given t if its number of edges (or blocks) is divisible by t. fr(t,d) or gr(t,d), respectively, is the minimum number of vertices of a (t,d)-decomposable or (t,d)-isodecomposable complete r-partite graph, respectively. gr(t,d) is the minimum number such that for every p ≥ gr(t,d) there exists a (t,d)-isodecomposable r-partite graph with p vertices, and hr(t,d) is the minimum number such that all admissible r-partite graphs with p ≥ hr (t,d) vertices are (t,d)-isodecomposable.&lt;/p&gt; &lt;p&gt;We completely determine the spectrum of all bipartite and tripartite (2,d)-isodecomposable graphs. We show that f₂(2,d) = g₂(2,d) = g₂(2,d) =h₂(2,d) and f₃(2,d) = g₃(2,d) = g₃(2,d) for each d, that is possible, while h₃(2,2) = ∞ (i.e., for any given p, there is an admissible graph with more than p vertices which is not (2,2)-isodecomposable), h₃(2,3) = g₃(2,3) +2, h₃(2,4) = g₃(2,4) and h₃(2,5) = g₃(2,5) + 1.&lt;/p&gt; &lt;p&gt;For complete four-partite graphs we completely determine the spectrum of (2, d)-isodecomposable graphs with at most one odd part. For the remaining admissible graphs, namely for those with all odd parts, we show that there is no such (2,5)-isodecomposable graph. For d = 2,3,4 we solve the problem in this class completely for the graphs Kn,n,n,m and Kn,n,m,m.&lt;/p&gt; &lt;p&gt;For all r ≥ 5 we determine smallest (2,d)-isodecomposable r-partite graphs for all possible diameters and show that also in these cases always gr(2,d) = gr&#x27;(2,d). Some values of hr(2,d) are also determined.&lt;/p&gt; &lt;p&gt;We furthermore prove that if a GDD with r ≥ 3 groups is (2,d)-isodecomposable, then d ≤ 4 or d = ∞. We show that for every admissible n there exists a (2,3)- and (2,4)-isodecomposable 3 - GDD(n,3), i.e., a GDD with 3 groups of cardinality n and block size 3.&lt;/p&gt; &lt;p&gt;Finally, we determine the spectrum of the designs 3 - GDD(n,3) which are decomposable into unicyclic factors.&lt;/p&gt;","abstract_has_math":false,"creators":["Fronček, Dalibor"],"institution":null,"degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Mathematics","school":null,"contributors":[],"advisors":["Rosa, Alexander"],"committee_chairs":[],"committee_members":[],"year":1994,"date_issued":"1994-04","date_published":"1994-04","updated_at":"2026-11-18T19:34:00Z","subjects":["Mathematics"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://doi.org/10.71548/15593"],"render_values":[{"text":"https://doi.org/10.71548/15593","href":"https://doi.org/10.71548/15593","code":true}]},{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["opendissertations/3922","4939","1794691"],"render_values":[{"text":"opendissertations/3922","href":null,"code":true},{"text":"4939","href":null,"code":true},{"text":"1794691","href":null,"code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/11375/8743","outbound_label":"Handle","outbound_source":"dc:identifier.uri","record_url":"http://hdl.handle.net/11375/8743","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%2F8743","prefix":"dim"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Rosa, Alexander"]},{"key":"dc:contributor.department","label":"Department","values":["Mathematics"]},{"key":"dc:creator","label":"Author","values":["Fronček, Dalibor"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2014-06-18T16:43:51Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2014-06-18T16:43:51Z"]},{"key":"dc:date.created","label":"Dc Date Created","values":["2011-02-17"]},{"key":"dc:date.issued","label":"Date","values":["1994-04"]},{"key":"dc:type","label":"Dc Type","values":["thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Mathematics"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["opendissertations/3922","4939","1794691"]},{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/11375/8743","https://doi.org/10.71548/15593"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["<p>A multipartite graph Km₁, m₂, ..., mr (group divisible design GDD) is (t,d)-decomposable if it can be decomposed into t factors with the same diameter d. The graph Km₁, m₂, ..., mr (design GDD) is (t,d)-isodecomposable if the factors are moreover isomorphic. Km₁, m₂, ..., mr (GDD) is admissible for a given t if its number of edges (or blocks) is divisible by t. fr(t,d) or gr(t,d), respectively, is the minimum number of vertices of a (t,d)-decomposable or (t,d)-isodecomposable complete r-partite graph, respectively. gr(t,d) is the minimum number such that for every p ≥ gr(t,d) there exists a (t,d)-isodecomposable r-partite graph with p vertices, and hr(t,d) is the minimum number such that all admissible r-partite graphs with p ≥ hr (t,d) vertices are (t,d)-isodecomposable.</p> <p>We completely determine the spectrum of all bipartite and tripartite (2,d)-isodecomposable graphs. We show that f₂(2,d) = g₂(2,d) = g₂(2,d) =h₂(2,d) and f₃(2,d) = g₃(2,d) = g₃(2,d) for each d, that is possible, while h₃(2,2) = ∞ (i.e., for any given p, there is an admissible graph with more than p vertices which is not (2,2)-isodecomposable), h₃(2,3) = g₃(2,3) +2, h₃(2,4) = g₃(2,4) and h₃(2,5) = g₃(2,5) + 1.</p> <p>For complete four-partite graphs we completely determine the spectrum of (2, d)-isodecomposable graphs with at most one odd part. For the remaining admissible graphs, namely for those with all odd parts, we show that there is no such (2,5)-isodecomposable graph. For d = 2,3,4 we solve the problem in this class completely for the graphs Kn,n,n,m and Kn,n,m,m.</p> <p>For all r ≥ 5 we determine smallest (2,d)-isodecomposable r-partite graphs for all possible diameters and show that also in these cases always gr(2,d) = gr'(2,d). Some values of hr(2,d) are also determined.</p> <p>We furthermore prove that if a GDD with r ≥ 3 groups is (2,d)-isodecomposable, then d ≤ 4 or d = ∞. We show that for every admissible n there exists a (2,3)- and (2,4)-isodecomposable 3 - GDD(n,3), i.e., a GDD with 3 groups of cardinality n and block size 3.</p> <p>Finally, we determine the spectrum of the designs 3 - GDD(n,3) which are decomposable into unicyclic factors.</p>"]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["Doctor of Philosophy (PhD)"]},{"key":"dc:title","label":"Title","values":["Decompositions of complete multipartite graphs and group divisible designs into isomorphic factors"]},{"key":"others:access_status","label":"Others Access Status","values":["open.access"]}]}],"canonical_facts":{"dc:contributor.advisor":["Rosa, Alexander"],"dc:contributor.department":["Mathematics"],"dc:creator":["Fronček, Dalibor"],"dc:date.accessioned":["2014-06-18T16:43:51Z"],"dc:date.available":["2014-06-18T16:43:51Z"],"dc:date.created":["2011-02-17"],"dc:date.issued":["1994-04"],"dc:description.abstract":["<p>A multipartite graph Km₁, m₂, ..., mr (group divisible design GDD) is (t,d)-decomposable if it can be decomposed into t factors with the same diameter d. The graph Km₁, m₂, ..., mr (design GDD) is (t,d)-isodecomposable if the factors are moreover isomorphic. Km₁, m₂, ..., mr (GDD) is admissible for a given t if its number of edges (or blocks) is divisible by t. fr(t,d) or gr(t,d), respectively, is the minimum number of vertices of a (t,d)-decomposable or (t,d)-isodecomposable complete r-partite graph, respectively. gr(t,d) is the minimum number such that for every p ≥ gr(t,d) there exists a (t,d)-isodecomposable r-partite graph with p vertices, and hr(t,d) is the minimum number such that all admissible r-partite graphs with p ≥ hr (t,d) vertices are (t,d)-isodecomposable.</p> <p>We completely determine the spectrum of all bipartite and tripartite (2,d)-isodecomposable graphs. We show that f₂(2,d) = g₂(2,d) = g₂(2,d) =h₂(2,d) and f₃(2,d) = g₃(2,d) = g₃(2,d) for each d, that is possible, while h₃(2,2) = ∞ (i.e., for any given p, there is an admissible graph with more than p vertices which is not (2,2)-isodecomposable), h₃(2,3) = g₃(2,3) +2, h₃(2,4) = g₃(2,4) and h₃(2,5) = g₃(2,5) + 1.</p> <p>For complete four-partite graphs we completely determine the spectrum of (2, d)-isodecomposable graphs with at most one odd part. For the remaining admissible graphs, namely for those with all odd parts, we show that there is no such (2,5)-isodecomposable graph. For d = 2,3,4 we solve the problem in this class completely for the graphs Kn,n,n,m and Kn,n,m,m.</p> <p>For all r ≥ 5 we determine smallest (2,d)-isodecomposable r-partite graphs for all possible diameters and show that also in these cases always gr(2,d) = gr'(2,d). Some values of hr(2,d) are also determined.</p> <p>We furthermore prove that if a GDD with r ≥ 3 groups is (2,d)-isodecomposable, then d ≤ 4 or d = ∞. We show that for every admissible n there exists a (2,3)- and (2,4)-isodecomposable 3 - GDD(n,3), i.e., a GDD with 3 groups of cardinality n and block size 3.</p> <p>Finally, we determine the spectrum of the designs 3 - GDD(n,3) which are decomposable into unicyclic factors.</p>"],"dc:description.degree":["Doctor of Philosophy (PhD)"],"dc:identifier.other":["opendissertations/3922","4939","1794691"],"dc:identifier.uri":["http://hdl.handle.net/11375/8743","https://doi.org/10.71548/15593"],"dc:subject":["Mathematics"],"dc:title":["Decompositions of complete multipartite graphs and group divisible designs into isomorphic factors"],"dc:type":["thesis"],"others:access_status":["open.access"]},"updated_at":"2026-11-18T19:34:00Z"}