Categorical constructions in graph theory.
Bumby, Richard T., Latch, Dana May (1986)
International Journal of Mathematics and Mathematical Sciences
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.
Bumby, Richard T., Latch, Dana May (1986)
International Journal of Mathematics and Mathematical Sciences
Similarity:
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.
Pavel Komárek (1984)
Časopis pro pěstování matematiky
Similarity:
Johns, Garry, Sleno, Karen (1993)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Richard H. Hammack (2013)
Discussiones Mathematicae Graph Theory
Similarity:
To every graph (or digraph) A, there is an associated automorphism group Aut(A). Frucht’s theorem asserts the converse association; that for any finite group G there is a graph (or digraph) A for which Aut(A) ∼= G. A new operation on digraphs was introduced recently as an aid in solving certain questions regarding cancellation over the direct product of digraphs. Given a digraph A, its factorial A! is certain digraph whose vertex set is the permutations of V (A). The arc set E(A!) forms...
Bohdan Zelinka (1987)
Mathematica Slovaca
Similarity:
Maryam Atapour, Seyyed Sheikholeslami, Rana Hajypory, Lutz Volkmann (2010)
Open Mathematics
Similarity:
Miller, Mirka, Širáň, Jozef (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity: