In geometry, a polytope (for example, a polygon or a polyhedron), or a tiling, is isotoxal or edge-transitive if its symmetries act transitively on… (More)

Semantic Scholar uses AI to extract papers important to this topic.

2016

2016

- David Coudert, Guillaume Ducoffe
- Theor. Comput. Sci.
- 2016

Topologies for data center interconnection networks have been proposed in the literature through various graph classes and… (More)

Is this relevant?

Highly Cited

2009

Highly Cited

2009

- Stephen P. Boyd, Persi Diaconis, Pablo A. Parrilo, Lin Xiao
- SIAM Journal on Optimization
- 2009

We show how to exploit symmetries of a graph to efficiently compute the fastest mixing Markov chain on the graph (choose the… (More)

Is this relevant?

2009

2009

- István Kovács, Aleksander Malnic, Dragan Marusic, Stefko Miklavic
- Eur. J. Comb.
- 2009

A bi-Cayley graph is a graph which admits a semiregular group of automorphisms with two orbits (of equal size), and is a… (More)

Is this relevant?

2008

2008

- Primoz Sparl
- J. Comb. Theory, Ser. B
- 2008

A graph is said to be half-arc-transitive if its automorphism group acts transitively on the set of its vertices and edges but… (More)

Is this relevant?

2007

2007

- Primoz Potocnik, Steve Wilson
- J. Comb. Theory, Ser. B
- 2007

This is the first in the series of articles stemming from a systematical investigation of finite edge-transitive tetravalent… (More)

Is this relevant?

2002

2002

- Jun-Ming Xu, Ke-Li Xu
- Discrete Mathematics
- 2002

This paper considers the concept of restricted edge-connectivity, and relates that to the edgedegree of a connected graph. The… (More)

Is this relevant?

2001

2001

- Cai Heng Li, Hyo-Seob Sim
- J. Comb. Theory, Ser. B
- 2001

In this paper, infinitely many graphs of large valency which are half-transitive (that is vertexand edge-transitive but not arc… (More)

Is this relevant?

1999

1999

- Shao-Fei Du, Dragan Maru
- 1999

A regular and edge-transitive graph which is not vertex-transitive is said to be semisymmetric. Every semisymmetric graph is… (More)

Is this relevant?

1998

1998

- Dragan Marusic
- Discrete Mathematics
- 1998

Slovenija Abstract A vertex-transitive graph is said to be 1 2-transitive if its automor-phism group is vertex and edge but not… (More)

Is this relevant?

1980

1980

- LAszb BABAI, James E Cameron, Michel Deza, Navin M. Singhi
- 1980

We consider the problem of determining the maximum possible out-degree d(n) of a digraph on n vertices which admits a sharply… (More)

Is this relevant?