On the existence of (d,k)-digraphs

DOI10.1016/S0012-365X(99)90087-0zbMATH Open0927.05035OpenAlexW4210749045MaRDI QIDQ1292845FDOQ1292845

Joan Gimbert

Publication date: 5 December 1999

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(99)90087-0

Recommendations

• Combinatorial Geometry and Graph Theory
• On the structure of digraphs with order close to the Moore bound
• Structure of repeat cycles in almost Moore digrpahs with selfrepeats and diameter 3
• On (4, 2)-digraphs containing a cycle of length 2

zbMATH Keywords

diameterspectrumdigraphdegreeMoore boundalmost Moore digraph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Distance in graphs (05C12) Paths and cycles (05C38) Structural characterization of families of graphs (05C75)

Cites Work

• Title not available (Why is that?)
• Line Digraph Iterations and the (d, k) Digraph Problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the impossibility of directed Moore graphs
• On the structure of digraphs with order close to the Moore bound
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Digraphs of degree 3 and order close to the moore bound
• Minimum Diameter of Diregular Digraphs of Degree 2
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (14)

• On diregular digraphs with degree two and excess three
• Multipartite Moore digraphs
• Title not available (Why is that?)
• Enumerations of vertex orders of almost Moore digraphs with selfrepeats
• On digraphs of excess one
• Nonexistence of almost Moore digraphs of degrees 4 and 5 with self-repeats
• On the nonexistence of almost Moore digraphs of degree four and five
• \(k\)-distinct in- and out-branchings in digraphs
• On mixed Moore graphs
• On the nonexistence of almost Moore digraphs
• On the contractibility of a digraph onto \(K_ 4^*\)
• A note on constructing digraphs with prescribed properties
• On (4, 2)-digraphs containing a cycle of length 2
• On the non-existence of families of \((d,k, \delta)\)-digraphs containing only selfrepeat vertices

This page was built for publication: On the existence of \((d,k)\)-digraphs

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