Sciweavers

488 search results - page 1 / 98
» Automorphic Decompositions of Graphs
Sort
View
JCT
2008
71views more  JCT 2008»
13 years 4 months ago
Primitive decompositions of Johnson graphs
A transitive decomposition of a graph is a partition of the edge set together with a group of automorphisms which transitively permutes the parts. In this paper we determine all t...
Alice Devillers, Michael Giudici, Cai Heng Li, Che...
GC
2011
Springer
12 years 8 months ago
Automorphic Decompositions of Graphs
ties: Graded for Calculus III and substituted in Abstract Algebra • Adjunct Instructor, Tri-County Technical College (2005) (864) 646-1368 Courses Taught: Intermediate Algebra, C...
Robert A. Beeler, Robert E. Jamison
CC
2006
Springer
147views System Software» more  CC 2006»
13 years 4 months ago
Complexity of Ring Morphism Problems
Abstract. We study the complexity of the isomorphism and automorphism problems for finite rings. We show that both integer factorization and graph isomorphism reduce to the problem...
Neeraj Kayal, Nitin Saxena
JGT
2006
101views more  JGT 2006»
13 years 4 months ago
Distinguishing geometric graphs
We begin the study of distinguishing geometric graphs. Let G be a geometric graph. An automorphism of the underlying graph that preserves both crossings and noncrossings is called...
Michael O. Albertson, Debra L. Boutin
ARSCOM
2005
94views more  ARSCOM 2005»
13 years 4 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