402 search results - page 3 / 81 » On Finding the Number of Graph Automorphisms |
ICCD
2003
IEEE
14 years 4 months ago
2003
IEEE
Functional symmetries provide significant benefits for multiple tasks in synthesis and verification. Many applications require the manual specification of symmetries using spe...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
A vertex k-labeling of graph G is distinguishing if the only automorphism that preserves the labels of G is the identity map. The distinguishing number of G, D(G), is the smallest...
ISAAC
2007
Springer
14 years 1 months ago
2007
Springer
The class of graphs where the size of a minimum vertex cover equals that of a maximum matching is known as K¨onig-Egerv´ary graphs. K¨onig-Egerv´ary graphs have been studied ex...
GC
2007
Springer
13 years 7 months ago
2007
Springer
Let Γ be a finite digraph and let G be a subgroup of the automorphism group of Γ. A directed cycle C of Γ is called G-consistent whenever there is an element of G whose restri...
EJC
2006
13 years 7 months ago
2006
A general method for finding elementary abelian regular covering projections of finite connected graphs is applied to the Petersen graph. As a result, a complete list of pairwise ...