Enumerations of vertex orders of almost Moore digraphs with selfrepeats
From MaRDI portal
Publication:2463473
DOI10.1016/J.DISC.2007.03.035zbMATH Open1133.05038OpenAlexW1964289883MaRDI QIDQ2463473FDOQ2463473
Authors: Yus Mochamad Cholily, Mirka Miller, E. T. Baskoro 
Publication date: 12 December 2007
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2007.03.035
Recommendations
- Enumeration of almost Moore digraphs of diameter two
- On the structure of digraphs with order close to the Moore bound
- scientific article; zbMATH DE number 3319305
- Divisibility conditions in almost Moore digraphs with selfrepeats
- scientific article; zbMATH DE number 1792622
- Nonexistence of almost Moore digraphs of degrees 4 and 5 with self-repeats
- Enumeration problems for classes of self-similar graphs
- Digraphs of degree 3 and order close to the moore bound
- An alternative enumeration of self-complementary graphs
- A conjecture on the existence of almost Moore digraphs
Cites Work
- On the impossibility of directed Moore graphs
- On the structure of digraphs with order close to the Moore bound
- Almost Moore digraphs are diregular
- Title not available (Why is that?)
- Enumeration of almost Moore digraphs of diameter two
- On the existence of \((d,k)\)-digraphs
- Minimum Diameter of Diregular Digraphs of Degree 2
- Title not available (Why is that?)
- Title not available (Why is that?)
- Complete characterization of almost Moore digraphs of degree three
- Combinatorial Geometry and Graph Theory
- Structure of repeat cycles in almost Moore digrpahs with selfrepeats and diameter 3
Cited In (6)
- Nonexistence of almost Moore digraphs of degrees 4 and 5 with self-repeats
- Divisibility conditions in almost Moore digraphs with selfrepeats
- On the nonexistence of almost Moore digraphs
- Ideal basis in constructions defined by directed graphs
- Subdigraphs of almost Moore digraphs induced by fixpoints of an automorphism
- Distances of centroid sets in a graph-based construction for information security applications
This page was built for publication: Enumerations of vertex orders of almost Moore digraphs with selfrepeats
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2463473)
