Publication:
Resolvable 3-star designs

Thumbnail Image

Departments

School / College / Institute

Program

KU Authors

Co-Authors

Lo Faro, Giovanni
Milici, Salvatore
Tripodi, Antoinette

Editor & Affiliation

Compiler & Affiliation

Translator

Other Contributor

Date

Language

Embargo Status

NO

Journal Title

Journal ISSN

Volume Title

Alternative Title

Abstract

Let K-v be the complete graph of order v and F be a set of 1-factors of K-v. In this article we study the existence of a resolvable decomposition of K-v - F into 3-stars when F has the minimum number of 1-factors. We completely solve the case in which F has the minimum number of 1-factors, with the possible exception of v is an element of {40, 44, 52, 76, 92, 100, 280, 284, 328, 332, 428, 472, 476, 572}.

Source

Publisher

Elsevier

Subject

Applied mathematics, Mathematics

Citation

Has Part

Source

Discrete Mathematics

Book Series Title

Edition

DOI

10.1016/j.disc.2014.11.013

item.page.datauri

Link

Rights

Copyrights Note

Endorsement

Review

Supplemented By

Referenced By

Related Goal

Thumbnail Image
GoalOpen Access
16 - Peace, Justice and Strong Institutions
Compassion and a strong moral compass is essential to every democratic society.Yet, persecution, injustice and abuse still runs rampant and is tearing at the very fabric of civilization. We must ensure that we have strong institutions, global standards of justice, and a commitment to peace everywhere.

0

Views

12

Downloads

View PlumX Details