2486014
On vertex-transitive graphs of odd prime-power order
Marusic (Ann. Discrete Math. 27 (1985) 115) proved that all vertex-transitive graphs of order pk are Cayley graphs for each prime p and k = 1,2, or 3, and constructed a non-Cayley vertex-transitive graph of order pk and valency 2p + 2 for each prime p ≥ 5 and k ≥ 4. McKay and Praeger (J. Austral. Math. Soc. (A) 56 (1994) 53) gave an alternative construction of a non-Cayley vertex-transitive graph of order pk for each prime p ≥ 3 and k ≥ 4. In this paper it is proved that, for each positive integer k and each prime p ≥ 3, a vertex-transitive graph of order pk with valency less than 2p + 2 is a Cayley graph.
26757666
An infinite family of cubic one-regular graphs with unsolvable automorphism groups
A graph is one-regular if its automorphism group acts freely and transitively on the set of its arcs. In this paper, an infinite family of cubic one-regular graphs with unsolvable automorphism groups is constructed.
11331203
Automorphism groups of Cayley graphs on symmetric groups with generating transposition sets
Let T be a set of transpositions of the symmetric group Sn. The transposition graph Tra(T) of T is the graph with vertex set {1, 2, ..., n} and edge set {ij|(i j) ∈ T}. In this paper it is shown that if n ≥ 3, then the automorphism group of the transposition graph Tra(T) is isomorphic to Aut(Sn, T) = {α ∈ Aut(Sn)|Tα = T} and if T is a minimal generating set of Sn then the automorphism group of the Cayley graph Cay(Sn, T) is the semiproduct R(Sn) Aut(Sn, T), where R(Sn) is the right regular representation of Sn. As a result, we generalize a theorem of Godsil and Royle [C.D. Godsil, G. Royle, Algebraic Graph Theory, Springer, New York, 2001, p. 53] regarding the automorphism groups of Cayley graphs on Sn : if T is a minimal generating set of Sn and the automorphism group of the transposition graph Tra(T) is trivial then the automorphism group of the Cayley graph Cay(Sn, T) is isomorphic to Sn.
44503656
s-Regular cubic graphs as coverings of the complete bipartite graph K3, 3
14199306
A Case Study in Application Family Development by Automated Component Composition: h-p Adaptive Finite Element Codes
This paper reports a case study in automated composition of application families from components. The case study composes multiple instances of an h-p adaptive finite element code. An application family is represented as a structure of components. Each component is encapsulated with an interface giving a semantic specification of the properties and behavior of the component. Instances of the application family can be automatically assembled from a library of components by a compiler and the application instance can be optimized by component replacement during runtime through runtime component selection and binding. The case study demonstrates the benefits of the component composition approach to application family development and shows that execution efficiency is maintained or improved by the componentized development process.
1503799
Deza digraphs
We consider a directed version of Deza graphs. A digraph is said to be a Deza digraph if it is regular and the number of common out-neighbors of any two distinct vertices takes on at most two values. We introduce some constructions and develop some basic theory. In particular, constructions from Cayley digraphs, graph lexicograph products and graph directed products are described. Moreover, we characterize a family of normal Deza digraphs, and list all cyclic strictly Deza digraphs with at most six vertices. Finally, connections to weakly distance-regular digraphs are discussed, and all strictly Deza digraphs which are also weakly distance-regular digraphs with at most ten vertices are listed.
11780341
Sentential Association Based Text Classification Systems
We recently proposed a novel sentential association based approach SAT-MOD for text classification, which views a sentence rather than a document as an association transaction, and uses a novel heuristic called MODFIT to select the most significant itemsets for constructing a category classifier. Based on SAT-MOD, we have developed a prototype system called SAT-Class. In this demo, we demonstrate the effectiveness of our text classification system, and also the readability and refinability of acquired classification rules.
30099215
Indexing and incremental updating condensed data cube
OLAP (online analytical processing) servers usually pre-compute data cubes to improve the response time of possible aggregate queries over cuboids with different grouping attributes. To reduce the huge size of a sparse data cube, the base single tuples (BSTs) are explored to condense cube tuples aggregated from the same set of source tuples into one tuple, whenever such condensing will not require further aggregate when the cube is used to answer queries. We propose the CuboidTree to index the BST condensed cube. Using both synthetic and real world data, we conducted experiments to demonstrate query processing and bulk incremental updating performance of the indexing scheme.