Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Graph automorphism

Known as: Graph automorphism problem 
In the mathematical field of graph theory, an automorphism of a graph is a form of symmetry in which the graph is mapped onto itself while preserving… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
The power graph of a group is the graph whose vertex set is the group, two elements being adjacent if one is a power of the other… Expand
Is this relevant?
Highly Cited
2009
Highly Cited
2009
In this work, we consider the controlled agreement problem for multi-agent networks, where a collection of agents take on leader… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2008
Highly Cited
2008
A discrete uncoupling process for finite spaces is introduced, called the Markov Cluster Process or the MCL process. The process… Expand
  • figure 3.1
  • figure 3.2
  • figure 3.3
Is this relevant?
Highly Cited
2004
Highly Cited
2004
We study topological properties of conjugacy classes in Polish groups, with emphasis on automorphism groups of homogeneous… Expand
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Abstract. Let G be a closed group of automorphisms of a graph X. We relate geometric properties of G and X, such as amenability… Expand
Is this relevant?
Highly Cited
1996
Highly Cited
1996
A labeling of the vertices of a graph G, ` : V (G) !f1;:::;rg, is said to be r-distinguishing provided no automorphism of the… Expand
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1981
Highly Cited
1981
While it is easy to characterize the graphs on which a given transitive permutation groupG acts, it is very difficult to… Expand
Is this relevant?
Highly Cited
1979
Highly Cited
1979
It is proved that the Shannon zero-error capacity of the pentagon is \sqrt{5} . The method is then generalized to obtain upper… Expand
Is this relevant?
Highly Cited
1979
Highly Cited
1979
By a result of L. Lovasz, the determination of the spectrum of any graph with transitive automorphism group easily reduces to… Expand
Is this relevant?
Highly Cited
1971
Highly Cited
1971
Topological entropy há(T) is defined for a uniformly continuous map on a metric space. General statements are proved about this… Expand
Is this relevant?