Displaying similar documents to “Closed walks in coset graphs and vertex-transitive non-Cayley graphs.”

Dynamic cage survey.

Exoo, Geoffrey, Jajcay, Robert (2008)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

The niche graphs of interval orders

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...

Tetravalent Arc-Transitive Graphs of Order 3p 2

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

On H -closed graphs

Pavel Tomasta, Eliška Tomová (1988)

Czechoslovak Mathematical Journal

Similarity: