On minimal regular digraphs with given girth
Mehdi Behzad, Gary Chartrand, Curtiss Wall (1970)
Fundamenta Mathematicae
Similarity:
Displaying similar documents to “The complete product of annihilatingly unique digraphs.”
On minimal regular digraphs with given girth
Randomly Eulerian digraphs
Gary Chartrand, Don R. Lick (1971)
Czechoslovak Mathematical Journal
Similarity:
On (4, 2)-digraphs containing a cycle of length 2.
Iswadi, Hazrul, Baskoro, Edy Tri (2000)
Bulletin of the Malaysian Mathematical Sciences Society. Second Series
Similarity:
On digraphs with non-derogatory adjacency matrix.
Deng, C.L., Gan, C.S. (1998)
Bulletin of the Malaysian Mathematical Society. Second Series
Similarity:
Some remarks about digraphs with nonisomorphic - or -neighbourhoods
Halina Bielak, Elżbieta Soczewińska (1983)
Časopis pro pěstování matematiky
Similarity:
New proofs of the uniqueness of extremal noneven digraphs.
Lim, Chjan C., Van Patten, Gregory K. (2001)
Bulletin of the Malaysian Mathematical Sciences Society. Second Series
Similarity:
Every connected acyclic digraph of height 1 is neighbourhood-realizable
Bohdan Zelinka (1991)
Archivum Mathematicum
Similarity: