Sciweavers

68 search results - page 3 / 14
» Symplectic graphs and their automorphisms
Sort
View
MST
2011
231views Hardware» more  MST 2011»
12 years 9 months ago
On the Complexity of Matroid Isomorphism Problem
We study the complexity of testing if two given matroids are isomorphic. The problem is easily seen to be in Σ p 2. In the case of linear matroids, which are represented over pol...
B. V. Raghavendra Rao, Jayalal M. N. Sarma
JCT
2008
71views more  JCT 2008»
13 years 6 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...
DM
1998
76views more  DM 1998»
13 years 5 months ago
Automorphism groups with cyclic commutator subgroup and Hamilton cycles
It has been shown that there is a Hamilton cycle in every connected Cayley graph on any group G whose commutator subgroup is cyclic of prime-power order. This note considers conne...
Edward Dobson, Heather Gavlas, Joy Morris, Dave Wi...
COMBINATORICS
2006
132views more  COMBINATORICS 2006»
13 years 6 months ago
On Computing the Distinguishing Numbers of Trees and Forests
Let G be a graph. A vertex labeling of G is distinguishing if the only label-preserving automorphism of G is the identity map. The distinguishing number of G, D(G), is the minimum...
Christine T. Cheng
CPC
2006
92views more  CPC 2006»
13 years 6 months ago
Waiting for a Bat to Fly By (in Polynomial Time)
We observe returns of a simple random walk on a finite graph to a fixed node, and would like to infer properties of the graph, in particular properties of the spectrum of the trans...
Itai Benjamini, Gady Kozma, László L...