The spectrum problem for digraphs of order 4 and size 5

DOI10.7494/OPMATH.2018.38.1.15zbMATH Open1402.05086OpenAlexW2767295428MaRDI QIDQ4554802FDOQ4554802

Authors:

Publication date: 9 November 2018

Published in: Opuscula Mathematica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7494/opmath.2018.38.1.15

Recommendations

• The spectrum problem for some digraphs of order 4 and size 6
• scientific article; zbMATH DE number 7085093
• On the \(\lambda\)-fold spectra of tripartite multigraphs of order 4 and size 5.
• On decomposing the complete symmetric digraph into orientations of \(K_4 - e\)
• Decompositions of complete digraphs into small tripartite digraphs

zbMATH Keywords

digraph decompositionsspectrum problem

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph designs and isomorphic decomposition (05C51)

Cites Work

• The CRC handbook of combinatorial designs
• On the spectra of bipartite directed subgraphs of \(K^\ast_4\)
• Title not available (Why is that?)
• A survey on the existence ofG-Designs
• Title not available (Why is that?)
• \(G\)-decomposition of \(K_n\), where G has four vertices or less
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Decompositions of complete digraphs into small tripartite digraphs
• A Complete Solution to Spectrum Problem for Five‐Vertex Graphs with Application to Traffic Grooming in Optical Networks

Cited In (1)

• The spectrum problem for some digraphs of order 4 and size 6

This page was built for publication: The spectrum problem for digraphs of order 4 and size 5

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