Sciweavers

68 search results - page 2 / 14
» Symplectic graphs and their automorphisms
Sort
View
ARSCOM
2005
94views more  ARSCOM 2005»
13 years 5 months ago
Isometrically Embedded Graphs
Can an arbitrary graph be embedded in Euclidean space so that the isometry group of its vertex set is precisely its graph automorphism group? This paper gives an affirmative answe...
Debra L. Boutin
JSC
2010
132views more  JSC 2010»
13 years 3 months ago
Binary codes from the line graph of the n-cube
We examine designs and binary codes associated with the line graph of the n-cube Qn, i.e. the Hamming graph H(n, 2). We find the automorphism groups and the parameters of the cod...
W. Fish, Jennifer D. Key, E. Mwambene
EJC
2007
13 years 5 months ago
A new family of locally 5-arc transitive graphs
We present a new family of locally 5–arc transitive graphs. The graphs constructed are bipartite with valency {2m + 1, 2m}. The actions of the automorphism group on the two bipa...
Michael Giudici, Cai Heng Li, Cheryl E. Praeger
DM
2008
89views more  DM 2008»
13 years 5 months ago
Primitive 2-factorizations of the complete graph
Let F be a 2-factorization of the complete graph Kv admitting an automorphism group G acting primitively on the set of vertices. If F consists of Hamiltonian cycles, then F is the...
Giuseppe Mazzuoccolo
ICCD
2003
IEEE
127views Hardware» more  ICCD 2003»
14 years 2 months ago
Structural Detection of Symmetries in Boolean Functions
Functional symmetries provide significant benefits for multiple tasks in synthesis and verification. Many applications require the manual specification of symmetries using spe...
Guoqiang Wang, Andreas Kuehlmann, Alberto L. Sangi...