Search Results for ""

The Doro graph is a distance-transitive and Distance-Regular Graph on 68 vertices and with valency 12. It is the unique automorphic graph having intersection array ...

A graph that can be reduced to another graph with the same degree sequence by edge-switching is known as a switchable graph. Conversely, a graph that cannot be reduced to ...

A connected labeled graph with n graph edges in which all graph vertices can be labeled with distinct integers (mod n) so that the sums of the pairs of numbers at the ends of ...

A line graph L(G) (also called an adjoint, conjugate, covering, derivative, derived, edge, edge-to-vertex dual, interchange, representative, or theta-obrazom graph) of a ...

A function f is topologically transitive if, given any two intervals U and V, there is some positive integer k such that f^k(U) intersection V!=emptyset. Vaguely, this means ...

The m×n rook complement graph K_m square K_n^_ is the graph complement of the m×n rook graph. It has vertex count mn and edge count 2(m; 2)(n; 2), where (n; k) is a binomial ...

The term in rigidity theory for the edges of a graph.

The Sims graph is a distance-transitive graph on 352 vertices (Brouwer et al. 1989, p. 370).

Several differing definitions of almost planar (as well as nearly planar) have been used in the literature (cf. Lipton et al. 2016). For example, Gubser (1996) defines an ...

A graph is said to be unswitchable if it cannot be reduced to another graph with the same degree sequence by edge-switching. Conversely, a graph that can be reduced to ...