Moore graphs and beyond: a survey of the degree/diameter problem.
Miller, Mirka, Širáň, Jozef (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Score lists of oriented tripartite graphs.”
Moore graphs and beyond: a survey of the degree/diameter problem.
On radially extremal graphs and digraphs, a survey
Ferdinand Gliviak (2000)
Mathematica Bohemica
Similarity:
The paper gives an overview of results for radially minimal, critical, maximal and stable graphs and digraphs.
Antipodal graphs and digraphs.
Johns, Garry, Sleno, Karen (1993)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Some new good characterizations for directed graphs
Pavel Komárek (1984)
Časopis pro pěstování matematiky
Similarity:
A note on constructing large Cayley graphs of given degree and diameter by voltage assignments.
Branković, Ljiljana, Miller, Mirka, Plesník, Ján, Ryan, Joe, Širáň, Jozef (1998)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Products Of Digraphs And Their Competition Graphs
Martin Sonntag, Hanns-Martin Teichert (2016)
Discussiones Mathematicae Graph Theory
Similarity:
If D = (V, A) is a digraph, its competition graph (with loops) CGl(D) has the vertex set V and {u, v} ⊆ V is an edge of CGl(D) if and only if there is a vertex w ∈ V such that (u, w), (v, w) ∈ A. In CGl(D), loops {v} are allowed only if v is the only predecessor of a certain vertex w ∈ V. For several products D1 ⚬ D2 of digraphs D1 and D2, we investigate the relations between the competition graphs of the factors D1, D2 and the competition graph of their product D1 ⚬ D2.