29234559
Quasi-abelian cayley graphs and parsons graphs
LetGbe a finite group, andSa subset ofGwith 1?SandS-1=S.IfSis a union of conjugacy classes ofG,then the Cayley graphX=Cay(G, S)onGwith respect toSis calledquasi-abelian.In this paper we prove that any connected quasi-abelian Cayley graph is hamiltonian (Theorem 2). As a consequence, we prove that Zaks' three conjectures on Parsons graphs are true, with one exception.
7439709
2-Arc-transitive regular covers of complete graphs having the covering transformation group Z3p
A family of 2-arc-transitive regular covers of a complete graph is investigated. In this paper, we classify all such covering graphs satisfying the following two properties: (1) the covering transformation group is isomorphic to the elementary abelian p-group Zp3, and (2) the group of fiber-preserving automorphisms acts 2-arc-transitively. As a result, new infinite families of 2-arc-transitive graphs are constructed.
1797921
Arc-transitive circulant digraphs of odd prime-power order
In this paper, the full automorphism group of a circulant digraph of prime-power order is investigated, and as a result, a complete classification of arc-transitive circulant graphs of odd prime-power order is given.
29378412
Vertex-primitive digraphs of prime-power order are hamiltonian
Abstract Witte [6] proved that every connected Cayley digraph of a p -group is hamiltonian. In this note we generalize Witte's result to connected vertex-primitive digraphs of prime-power order; namely, we prove that every connected vertex-primitive digraph of prime-power order is hamiltonian.
43124802
On the Isomorphisms of Cayley Graphs of Abelian Groups
Let G be a finite group, S a subset of G\{1}, and let Cay (G, S) denote the Cayley digraph of G with respect to S. If, for any subset T of G\{1}, Cay(G, S) ≅ Cay(G, T) implies that Sα = T for some α ∈ Aut(G), then S is called a CI-subset. The group G is called a CIM-group if for any minimal generating subset S of G, S ∪ S-1 is a CI-subset. In this paper, CIM-abelian groups are characterized.
3952660
Automorphism groups and isomorphisms of Cayley digraphs
Abstract We call a Cayley digraph X = Cay(G, S) normal for G if the right regular representation R(G) of G is normal in the full automorphism group Aut(X) of X. In this paper we give some examples of normal and nonnormal Cayley digraphs and survey some results about the normality of Cayley digraphs. We also propose some conjectures and problems about them. In the last section of this paper we discuss a problem about isomorphisms of Cayley digraphs.
10735574
Forwarding indices of folded n-cubes
For a given connected graph G of order n, a routing R is a set of n(n - 1) elementary paths specified for every ordered pair of vertices in G. The vertex (resp. edge) forwarding index of a graph is the maximum number of paths of R passing through any vertex (resp. edge) in the graph. In this paper, the authors determine the vertex and the edge forwarding indices of a folded n-cube as (n-1)2n-1 +1-((n+l)/2) (n ⌊n+1/2⌋) and 2n-(n,⌊n+1/2⌋),respectively.
16235334
Illumination-Invariant Motion Detection Using Colour Mixture Models
This paper tackles the problem of robust change detection in image sequences from static cameras. Motion cues are detected using frame differencing with an adaptive background estimation modelled by a mixture of Gaussians. Illumination invariance and elimination or detection of shadows is achieved by using a colour chromaticity representation of the image data. The combination of the colourand intensity-based models results in some promising applications.
7639532
Fault diameter of Cartesian product graphs
The (k-1)-fault diameter D"k(G) of a k-connected graph G is the maximum diameter of G-F for any F@?V(G) with |F|=1 for i=1,2.
15417765
The proof of a conjecture of Bouabdallah and Sotteau
Let G be a connected graph of order n. A routing in G is a set of n(n 1) fixed paths for all ordered pairs of vertices of G. The edge-forwarding index of G, (G), is the minimum of the maximum number of paths specified by a routing passing through any edge of G taken over all routings in G, and ,n is the minimum of (G) taken over all graphs of order n with maximum degree at most . To determine n 2p 1,n for 4p 2p/3 1 ≤ n ≤ 6p, A. Bouabdallah and D. Sotteau proposed the following conjecture in [On the edge forwarding index problem for small graphs, Networks 23 (1993), 249–255]. The set 3 {1, 2, . . . , (4p)/3} can be partitioned into 2p pairs plus singletons such that the set of differences of the pairs is the set 2 {1, 2, . . . , p}. This article gives a proof of this conjecture and determines that n 2p 1,n is equal to 5 if 4p 2p/3 1 ≤ n ≤ 6p and to 8 if 3p p/3 1 ≤ n ≤ 3p (3p)/5 for any p ≥ 2. © 2004 Wiley Periodicals, Inc. NETWORKS, Vol. 44(4), 292–296 2004
502799
Multifacet's general execution-driven multiprocessor simulator (GEMS) toolset
The Wisconsin Multifacet Project has created a simulation toolset to characterize and evaluate the performance of multiprocessor hardware systems commonly used as database and web servers. We leverage an existing full-system functional simulation infrastructure (Simics [14]) as the basis around which to build a set of timing simulator modules for modeling the timing of the memory system and microprocessors. This simulator infrastructure enables us to run architectural experiments using a suite of scaled-down commercial workloads [3]. To enable other researchers to more easily perform such research, we have released these timing simulator modules as the Multifacet General Execution-driven Multiprocessor Simulator (GEMS) Toolset, release 1.0, under GNU GPL [9].