Isotoxal figure

Known as: Edge-transitivity, Isotoxal polygon, Edge-transitive 
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)
Wikipedia

Topic mentions per year

Topic mentions per year

1980-2018
0246819802018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Topologies for data center interconnection networks have been proposed in the literature through various graph classes and… (More)
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2009
Highly Cited
2009
We show how to exploit symmetries of a graph to efficiently compute the fastest mixing Markov chain on the graph (choose the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2009
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)
  • figure 1
  • figure 2
Is this relevant?
2008
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)
  • figure 1
  • table 1
  • table 2
  • table 3
  • table 4
Is this relevant?
2007
2007
This is the first in the series of articles stemming from a systematical investigation of finite edge-transitive tetravalent… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2002
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
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
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
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
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?