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:
Branković, Ljiljana, Miller, Mirka, Plesník, Ján, Ryan, Joe, Širáň, Jozef (1998)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Exoo, Geoffrey, Jajcay, Robert (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Gvozdjak, P., Širáň, J. (1994)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
Gliviak, Ferdinand, Kyš, P. (1997)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
Jeongmi Park, Yoshio Sano (2014)
Discussiones Mathematicae Graph Theory
Similarity:
The niche graph of a digraph D is the (simple undirected) graph which has the same vertex set as D and has an edge between two distinct vertices x and y if and only if N+D(x) ∩ N+D(y) ≠ ∅ or N−D(x) ∩ N−D(y) ≠ ∅, where N+D(x) (resp. N−D(x)) is the set of out-neighbors (resp. in-neighbors) of x in D. A digraph D = (V,A) is called a semiorder (or a unit interval order ) if there exist a real-valued function f : V → R on the set V and a positive real number δ ∈ R such that (x, y) ∈ A if...
Mohsen Ghasemi (2014)
Discussiones Mathematicae Graph Theory
Similarity:
Let s be a positive integer. A graph is s-transitive if its automorphism group is transitive on s-arcs but not on (s + 1)-arcs. Let p be a prime. In this article a complete classification of tetravalent s-transitive graphs of order 3p2 is given
Pavel Tomasta, Eliška Tomová (1988)
Czechoslovak Mathematical Journal
Similarity:
Halina Bielak (1983)
Časopis pro pěstování matematiky
Similarity: