Isogonal figure

Known as: Vertex-uniform, Isogonal polygon, Isogonal 
In geometry, a polytope (a polygon, polyhedron or tiling, for example) is isogonal or vertex-transitive if, loosely speaking, all its vertices are… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
The independent spanning trees (ISTs) problem attempts to construct a set of pairwise independent spanning trees and it has… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2008
Highly Cited
2008
We consider the DLA process on a cylinder G × N. It is shown that this process “grows arms”, provided that the base graph G has… (More)
  • figure 1
Is this relevant?
2007
2007
The semidefinite programming formulation of the Lovász theta number does not only give one of the best polynomial simultaneous… (More)
  • table 2
  • table 3
  • table 4
  • table 5
  • table 7
Is this relevant?
2002
2002
  • Vadim A. Kaimanovich, Wolfgang Woess
  • 2002
CNRS, Université de Rennes-1 and Technische Universität Graz We study the Poisson boundary (≡ representation of bounded harmonic… (More)
  • figure 1
  • figure 2
Is this relevant?
1999
1999
The full symmetry groups for all single-wall and multiwall carbon nanotubes are found. As for the singlewall tubes, the… (More)
  • figure 1
  • figure 2
  • table I
  • figure 3
Is this relevant?
1997
1997
The study of the polyhedra (in Euclidean 3-space) in which faces may be self-intersecting polygons, and distinct faces may… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1991
Highly Cited
1991
Highly Cited
1991
Heuristic algorithms manipulating finite groups often work under the assumption that certain operations lead to “random” elements… (More)
Is this relevant?
1981
1981
We obtain exact bounds for the girth and the diameter of a vertex-transitive digraph. As an application of the above results we… (More)
Is this relevant?
1981
1981
A graph having 2 7 vertices is described, whose automorphism group is transitive on vertices and undirected edges, but not on… (More)
  • figure 1
  • figure 2
Is this relevant?