Super-simple 2-(v,5,1) directed designs and their smallest defining sets

zbMATH Open1278.05025arXiv1205.6047MaRDI QIDQ2869460FDOQ2869460

Authors: Farzane Amirzade, Nasrin Soltankhah 

Publication date: 3 January 2014

Published in: The Australasian Journal of Combinatorics (Search for Journal in Brave)

Abstract: In this paper we investigate the spectrum of super-simple 2-$(v,5,1)$ directed designs (or simply super-simple 2-$(v,5,1)$DDs) and also the size of their smallest defining sets. We show that for all $vequiv1,5(mmod10)$ except $v=5,15$ there exists a super-simple $(v,5,1)DD$. Also for these parameters, except possibly $v=11,91$, there exists a super-simple 2-$(v,5,1)$DD whose smallest defining sets have at least a half of the blocks.

Full work available at URL: https://arxiv.org/abs/1205.6047

Recommendations

• Smallest defining sets of super-simple 2 - (v, 4,1) directed designs
• Super-simple \((v, 4, 2)\) directed designs and a lower bound for the minimum size of their defining set
• Super-simple (\(v\),\,5,\,2)-designs.
• scientific article; zbMATH DE number 1334631
• Super-simple \((v,5,4)\) designs

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Other designs, configurations (05B30)

Cited In (5)

• Super-simple (\(v\),\,5,\,2)-designs.
• Superpure digraph designs
• Super-simple \((v, 5, 2)\) directed designs and their smallest defining sets with application in LDPC codes
• Smallest defining sets of super-simple 2 - (v, 4,1) directed designs
• Super-simple \((v, 4, 2)\) directed designs and a lower bound for the minimum size of their defining set

This page was built for publication: Super-simple \(2\)-\((v,5,1)\) directed designs and their smallest defining sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2869460)