Publication: Uniformly resolvable (C-4, K-1,K-3)-designs of index 2
Loading...
Program
KU-Authors
Organization Authors
Co-Authors
Gionfriddo, Mario
Milici, Salvatore
Date
Language
Type
Embargo Status
N/A
Journal Title
Journal ISSN
Volume Title
Alternative Title
Abstract
In this paper we consider the uniformly resolvable decompositions of the complete graph lambda K-v into subgraphs where each resolution class contains only blocks isomorphic to the same graph. We consider the cases in which all the resolution classes are either C-4 or K-1,K-3. We prove that this type of system does not exist for lambda odd and determine completely the spectrum for lambda = 2.
Source
Publisher
University of Calgary
Subject
Citation
item.page.haspartof
Source
Contributions to Discrete Mathematics
item.page.ispartofseries
item.page.edition
DOI
item.page.datauri
item.page.link
Rights
N/A
Copyrights Note
Rights and licensing
N/A
Collections
Endorsement
Review
Supplemented By
Referenced By
Google Scholar
Scholar'da Ara ↗ Bu yayında DOI yok — Altmetric/Dimensions/PlumX/BIP! rozetleri DOI gerektirir.
