Constructing Homogeneous Factorisations of Complete Graphs and Digraphs

 A homogeneous factorisation of a complete graph K _n is a partition of the edge set that is invariant under a subgroup G of S _n such that G is transitive on the parts of the partition and induces a vertex-transitive automorphism group on the graph corresponding to each part. A product construction is given for such factorisations. Received: October, 2001 Final version received: May 17, 2002     

Eigenvalues and automorphisms of a graph

Let G be the automorphism group of a graph Γ and let λ be an eigenvalue of the adjacency matrix of Γ. In this article, (i) we derive an upper bound for rank(G), (ii) if G is vertex transitive, we derive an upper bound for the extension degree of ?(λ) over ?, (iii) we study automorphism groups of graphs without multiple eigenvalues, (iv) we study spectra of quotient graphs associated with orbit partitions.     

Automorphism groups of compact bordered Klein surfaces with invariant subsets

In this work we get upper bounds for the order of a group of automorphisms of a compact bordered Klein surface S of algebraic genus greater than 1. These bounds depend on the algebraic genus of S and on the cardinals of finite subsets of S which are invariant under the action of the group. We use our results to obtain upper bounds for the order of a group of automorphism whose action on the set of connected components of the boundary of S is not transitive. The bounds obtained this way depend only on the algebraic genus of S. The author is partially supported by the European Network RAAG HPRN-CT-2001-00271 and the Spanish GAAR DGICYT BFM2002-04797.     

Tetravalent vertex‐transitive graphs of order 4p

A graph is vertex‐transitive if its automorphism group acts transitively on vertices of the graph. A vertex‐transitive graph is a Cayley graph if its automorphism group contains a subgroup acting regularly on its vertices. In this article, the tetravalent vertex‐transitive non‐Cayley graphs of order 4p are classified for each prime p. As a result, there are one sporadic and five infinite families of such graphs, of which the sporadic one has order 20, and one infinite family exists for every prime p>3, two families exist if and only if p≡1 (mod 8) and the other two families exist if and only if p≡1 (mod 4). For each family there is a unique graph for a given order. © 2011 Wiley Periodicals, Inc.     

Mendelsohn designs admitting the affine group

All Mendelsohn designs containing a Frobenius group with cyclic complement of orderv – 1 as a subgroup of the automorphism are found. Furthermore, the automorphism group of each of the designs is constructed. These designs generalize Mendelsohn's construction of Mendelsohn designs containing a certain doubly transitive automorphism group.The research on this paper was partially supported by North Texas State Faculty Research Grant #35524.     

Upper Bounds for the Automorphic Chromatic Index of a Graph

The automorphic H-chromatic index of a graph Γ is the minimum integer m for which Γ has a proper edge-coloring with m colors preserved by a given subgroup H of the full automorphism group of Γ. We determine upper bounds for this index in terms of the chromatic index of Γ for some abelian 2-groups H.     

非拟本原（PSU3（P），2）-弧传递图的外自同构

证明由GF（p^2）的域自同构可以产生一类非拟本原（PSU3（P），2）-弧传递图的白同构，并研究了这样的自同构与图的传递自同构群中心化予的关系。     

Metric ends,fibers and automorphisms of graphs

Several results on the action of graph automorphisms on ends and fibers are generalized for the case of metric ends. This includes results on the action of the automorphisms on the end space, directions of automorphisms, double rays which are invariant under a power of an automorphism and metrically almost transitive automorphism groups. It is proved that the bounded automorphisms of a metrically almost transitive graph with more than one end are precisely the kernel of the action on the space of metric ends. (© 2007 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Extremal first passage times for trees

For random walks associated with trees with probability zero of staying at any vertex, we develop explicit graph theoretic formulas for the mean first passage times between states, we give lower and upper bounds for the entries of the mean first passage matrix E, and we characterize the cases of equality in these bounds. We also consider the variance of the first return time to a state and we find those trees which maximize the variance and those trees which minimize the variance. As may be expected, the trees which provide extremal behavior are given by paths and stars.     

循环图的距离能量（英文）

For a connected graph G, the distance energy of G is a recently developed energytype invariant, defined as the sum of absolute values of the eigenvalues of the distance matrix G. A graph is called circulant if it is Cayley graph on the circulant group, i.e., its adjacency matrix is circulant. In this note, we establish lower bounds for the distance energy of circulant graphs. In particular, we discuss upper bound of distance energy for the 4-circulant graph.     

超立方体Q_n的传递剖分

一个图的传递剖分是它的边集的一个划分,且满足图的一个自同构群在其划分后的各个部分组成的集合上作用是传递的.决定了超立方体Q_n的所有G-传递剖分,其中G为Q_n的全自同构群.     

Sharp bounds on eigenvalues via spectral embedding based on signless Laplacians

Using spectral embedding based on the probabilistic signless Laplacian, we obtain bounds on the spectrum of transition matrices on graphs. As a consequence, we bound return probabilities and the uniform mixing time of simple random walk on graphs. In addition, spectral embedding is used in this article to bound the spectrum of graph adjacency matrices. Our method is adapted from Lyons and Oveis Gharan [13].     

On z-analogue of Stepanov–Lomonosov–Polesskii inequality

Stepanov?s inequality and its various extensions provide an upper bound for connectedness probability for a Bernoulli-type random subgraph of a given graph. We have found an analogue of this bound for the expected value of the connectedness-event indicator times a positive z raised to the number of edges in the random subgraph. We demonstrate the power of this bound by a quick derivation of a relatively sharp bound for the number of the spanning connected, sparsely edged, subgraphs of a high-degree regular graph.     

An Embedding Theorem for Automorphism Groups of Cartan Geometries

We study the automorphism group of a Cartan geometry, and prove an embedding theorem analogous to a result of Zimmer for automorphism groups of G-structures. Our embedding theorem leads to general upper bounds on the real rank or nilpotence degree of a Lie subgroup of the automorphism group. We prove that if the maximal real rank is attained in the automorphism group of a geometry of parabolic type, then the geometry is flat and complete.     

Cores of Imprimitive Symmetric Graphs of Order a Product of Two Distinct Primes

A retract of a graph Γ is an induced subgraph Ψ of Γ such that there exists a homomorphism from Γ to Ψ whose restriction to Ψ is the identity map. A graph is a core if it has no nontrivial retracts. In general, the minimal retracts of a graph are cores and are unique up to isomorphism; they are called the core of the graph. A graph Γ is G‐symmetric if G is a subgroup of the automorphism group of Γ that is transitive on the vertex set and also transitive on the set of ordered pairs of adjacent vertices. If in addition the vertex set of Γ admits a nontrivial partition that is preserved by G, then Γ is an imprimitive G‐symmetric graph. In this paper cores of imprimitive symmetric graphs Γ of order a product of two distinct primes are studied. In many cases the core of Γ is determined completely. In other cases it is proved that either Γ is a core or its core is isomorphic to one of two graphs, and conditions on when each of these possibilities occurs is given.     

Expected hitting and cover times of random walks on some special graphs

We give general bounds (and in some cases exact values) for the expected hitting and cover times of the simple random walk on some special undirected connected graphs using symmetry and properties of electrical networks. In particular we give easy proofs for an N–1H_N-1 lower bound and an N² upper bound for the cover time of symmetric graphs and for the fact that the cover time of the unit cube is Φ(NlogN). We giver a counterexample to a conjecture of Freidland about a general bound for hitting times. Using the electric approach, we provide some genral upper and lower bounds for the expected cover times in terms of the diameter of the graph. These bounds are tight in many instances, particularly when the graph is a tree. © 1994 John Wiley & Sons, Inc.     

Nilpotent 1‐factorizations of the complete graph

For which groups G of even order 2n does a 1‐factorization of the complete graph K_2n exist with the property of admitting G as a sharply vertex‐transitive automorphism group? The complete answer is still unknown. Using the definition of a starter in G introduced in 4 , we give a positive answer for new classes of groups; for example, the nilpotent groups with either an abelian Sylow 2‐subgroup or a non‐abelian Sylow 2‐subgroup which possesses a cyclic subgroup of index 2. Further considerations are given in case the automorphism group G fixes a 1‐factor. © 2005 Wiley Periodicals, Inc. J Combin Designs     

Constructing even radius tightly attached half-arc-transitive graphs of valency four

A finite graph X is half-arc-transitive if its automorphism group is transitive on vertices and edges, but not on arcs. When X is tetravalent, the automorphism group induces an orientation on the edges and a cycle of X is called an alternating cycle if its consecutive edges in the cycle have opposite orientations. All alternating cycles of X have the same length and half of this length is called the radius of X. The graph X is said to be tightly attached if any two adjacent alternating cycles intersect in the same number of vertices equal to the radius of X. Marušič (J. Comb. Theory B, 73, 41–76, 1998) classified odd radius tightly attached tetravalent half-arc-transitive graphs. In this paper, we classify the half-arc-transitive regular coverings of the complete bipartite graph K _4,4 whose covering transformation group is cyclic of prime-power order and whose fibre-preserving group contains a half-arc-transitive subgroup. As a result, two new infinite families of even radius tightly attached tetravalent half-arc-transitive graphs are constructed, introducing the first infinite families of tetravalent half-arc-transitive graphs of 2-power orders.      

Vector-valued fractal functions: Fractal dimension and fractional calculus

There are many research available on the study of a real-valued fractal interpolation function and fractal dimension of its graph. In this paper, our main focus is to study the dimensional results for a vector-valued fractal interpolation function and its Riemann–Liouville fractional integral. Here, we give some results which ensure that dimensional results for vector-valued functions are quite different from real-valued functions. We determine interesting bounds for the Hausdorff dimension of the graph of a vector-valued fractal interpolation function. We also obtain bounds for the Hausdorff dimension of the associated invariant measure supported on the graph of a vector-valued fractal interpolation function. Next, we discuss more efficient upper bound for the Hausdorff dimension of measure in terms of probability vector and contraction ratios. Furthermore, we determine some dimensional results for the graph of the Riemann–Liouville fractional integral of a vector-valued fractal interpolation function.