Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 1

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: digraph decompositions

Sortuj według:

Ogranicz wyniki do:

The spectrum problem for digraphs of order 4 and size 5

Bunge R. C., DeShong S, El-Zanati S. I., Fischer A., Roberts D. P., Teng L.

Opuscula Mathematica

2018

Vol. 38, no. 1

15--30

The paw graph consists of a triangle with a pendant edge attached to one of the three vertices. We obtain a multigraph by adding exactly one repeated edge to the paw. Now, let D be a directed graph obtained by orientating the edges of that multigraph. For 12 of the 18 possibilities for D, we establish necessary and sufficient conditions on n for the existence of a [formula] design. Partial results are given for the remaining 6 possibilities for D.