Almost resolvable maximum packings of complete graphs with 5-cycles

Let X be the vertex set of K_nA k-cycle packing of K_n is a triple (X,C,L), where C is a collection of edge disjoint k-cycles of K_n and L is the collection of edges of K_n not belonging to any of the k-cycles in C. A k-cycle packing (X,C,L) is called resolvable if C can be partitioned into almost parallel classes. A resolvable maximum k-cycle packing of K_n, denoted by k-RMCP(n), is a resolvable k-cycle packing of K_n, (X,C,L), in which the number of almost parallel classes is as large as possible. Let D(n, k) denote the number of almost parallel classes in a k-RMCP(n). D(n, k) for k = 3, 4 has been decided. When n ≡ k (mod 2k) and k ≡ 1 (mod 2) or n ≡ 1 (mod 2k) and k ∈{6, 8, 10, 14}∪{m: 5≤m≤49, m ≡ 1 (mod 2)}, D(n, k) also has been decided with few possible exceptions. In this paper, we shall decide D(n, 5) for all values of n≥5.     

A survey of graph laplacians

Let G be a graph on n vertices. Its Laplacian is the n-by-n matrix L(G)-D(G)-A(G), where D(G) is the diagonal matrix of vertex degrees and A(G) is the (0,1)-adjacency matrix of G. This article surveys recent results on graph Laplacians.     

Two observations about free graded hopf algebras

This paper records two results about graded Hopf algebras that do not appear to be stated explicitly in the literature. Let B be a graded set, graded by the positive integers. Let V be the graded vector space with basis B over a field K of characteristic zero and V^'=K⊕V, where K is in grading zero. Let L ne the free graded Lie algebra on B over K and let T be the free graded tensor algebra on B. The first result is the "graded Witt formula" giving the dimension of the subspace of L in each grading. The second result is the observation that any graded coassociative, co-commutative comultiplication Δ:V^'→V^'⊗V^', with co-unit the projection V¹→K. extends to a graded Hopf algebra structure on T that is in fact isomorphic to the natural graded Hopf algebra structure on T. In the ungraded case the statement analogous to the second result is false.     

Degrees in a digraph whose nodes are graphs

By an f-graph we mean an unlabeled graph having no vertex of degree greater than f. Let D(n, f) denote the digraph whose node set is the set of f-graphs of order n and such that there is an arc from the node corresponding to graph H to the node corresponding to the graph K if and only if K is obtainable from H by the addition of a single edge. In earlier work, algorithms were developed which produce exact results about the structure of D(n, f), nevertheless many open problems remain. For example, the computation of the order and size of D(n, f) for a number of values of n and f have been obtained. Formulas for the order and size for f = 2 have also been derived. However, no closed form formulas have been determined for the order and size of D(n, f) for any value of f. Here we focus on questions concerning the degrees of the nodes in D(n,n − 1) and comment on related questions for D(n,f) for 2 f < n − 1.     

All trees are 1-embeddable and all except stars are 2-embeddable

A graph G with n vertices is said to be embeddable (in its complement) if there is an automorphism φ of K_n such that E(G) ∩ E(φ(G))=. It is known that all trees T with n (≥2) vertices and T K_1,n−1 are embeddable. We say that G is 1-embeddable if, for every edge e, there is an automorphism φ of K_n such that E(G) ∩ E(φ(G))={e};and that it is 2-embeddable if,for every pair e₁, e₂ of edges, there is an automorphism φ of K_n such that E(G) ∩ E(φ(G))={e₁, e₂}. We prove here that all trees with n (3) vertices are 1-embeddable; and that all trees T with n (4) vertices and T K_1,n−1 are 2-embeddable. In a certain sense, this result is sharp.     

Linear transformations on symmetric matrices II

Let Tbe a linear mapping on the space of n× nsymmetric matrices over a field Fof characteristic not equal to two. We obtain the structure of Tfor the following cases:(i) Tpreserves matrices of rank less than three; (ii) Tpreserves nonzero matrices of rank less than K + 1 where Kis a fixed positive integer less than nand Fis algebraically closed; (iii) Tpreserves rank Kmatrices where Kis a fixed odd integer and Fis algebraically closed.     

A linear time algorithm for edge coloring of binomial trees

We consider the problem of efficient coloring of the edges of a so-called binomial tree T, i.e. acyclic graph containing two kinds of edges: those which must have a single color and those which are to be colored with L consecutive colors, where L is an arbitrary integer greater than 1. We give an O(n) time algorithm for optimal coloring of such a tree, where n is the number of vertices of T. Also, we give simple bounds on the chromatic index of T and a division of all binomial trees into two classes depending on their chromaticity.     

Discriminant preserving linear maps

Consider the n-square matrices over an infiniie field Kas an n²-dimcnsional vector space M( nK). We determine all linear maps Ton M(nK) such that discriminant TX- discriminant Xfor all Xin M(nK)     

Large eigenvalues of the laplacian

Let G be a simple graph on n vertices and let L=L(G) be the Laplacian matrix of G corresponding to some ordering of the vertices. It is known that λ≤n for any eigenvalue λ of L. In this note we characterize when n is an eigenvalue of L with multiplicity m.     

Local trace forms

Let F be a local field of characteristic ≠2 and K a Galois extension field of F of degree n. Then K can be viewed as a quadratic space over F under the bilinear form T(xy)=tr_K/Fxy for xyεK. The invariants of this form are given in the case when n is odd; when n is even and F is nondyadic; and when n is evesF dyadic, and K/F is unramifed.     

Linear mappings which are rank-k nonincreasing, II

We prove the following result. Let F be an infinite field of characteristic other than two. Let k be a positive integer. Let S_n(F) denote the space of all n × n symmetric matrices with entries in F, and let T:S_n(F)→S_n(F) be a linear operator. Suppose that T is rank-k nonincreasing and its image contains a matrix with rank higher than K. Then, there exist λεF and PεF^n,n such that T(A)=λPAP^t for all AεS_n(F). λ can be chosen to be 1 if F is algebraically closed and ±1 if F=R, the real field.     

A reversal index for tournament matrices

Given a tournament matrix T, its reversal indexi_R(T), is the minimum k such that the reversal of the orientation of k arcs in the directed graph associated with T results in a reducible matrix. We give a formula for i_R(T) in terms of the score vector of T which generalizes a simple criterion for a tournament matrix to be irreducible. We show that i_R(T)≤[(n-1)/2] for any tournament matrix T of order n, with equality holding if and only if T is regular or almost regular, according as n is odd or even. We construct, for each k between 1 and [(n-1)/2], a tournament matrix of order n whose reversal index is k. Finally, we suggest a few problems.     

Cell rotation graphs of strongly connected orientations of plane graphs with an application

The cell rotation graph D(G) on the strongly connected orientations of a 2-edge-connected plane graph G is defined. It is shown that D(G) is a directed forest and every component is an in-tree with one root; if T is a component of D(G), the reversions of all orientations in T induce a component of D(G), denoted by T⁻, thus (T,T⁻) is called a pair of in-trees of D(G); G is Eulerian if and only if D(G) has an odd number of components (all Eulerian orientations of G induce the same component of D(G)); the width and height of T are equal to that of T⁻, respectively. Further it is shown that the pair of directed tree structures on the perfect matchings of a plane elementary bipartite graph G coincide with a pair of in-trees of D(G). Accordingly, such a pair of in-trees on the perfect matchings of any plane bipartite graph have the same width and height.     

Combinatorial aspects of geometric graphs

As a special case of our main result, we show that for all L> 0, each k-nearest neighbor graph in d dimensions excludes K_h as a depth L minor if h = Ω(L^d). More generally, we prove that the overlap graphs defined by Miller, Teng, Thurston and Vavasis (1993) have this combinatorial property. By a construction of Plotkin, Rao and Smith (1994), our result implies that overlap graphs have “good” cut-covers, answering an open question of Kaklamanis, Krizanc and Rao (1993). Consequently, overlap graphs can be emulated on hypercube graphs with a constant factor of slow-down and on butterfly graphs with a factor of O(log^* n) slow-down. Therefore, computations on overlap graphs, such as finite element and finite difference methods on “well-conditioned” meshes and image processing on k-nearest neighbor graphs, can be performed on hypercubic parallel machines with a linear speed-up. Our result, in conjunction with a result of Plotkin, Rao and Smith, also yields a combinatorial proof that overlap graphs have separators of sublinear size. We also show that with high probability, the Delaunay diagram, the relative neighborhood graph, and the k-nearest neighbor graph of a random point set exclude K_h as a depth L minor if h = Ω(L^d/2 log n).     

Maximal orders containing local crossed-products

Let Λ = (S/R, ) be the crossed product order in the crossed product algebra A = (L/K, ) with factor set , where L/K is a Galois extension of the local field K, and R (resp. S) the valuation ring of K (resp. L). In this paper the maximal R-orders in A containing Λ and the irreducible Λ-lattices are determined.     

Trace forms of normal extensions over local fields

Let k be a local field of char(k)≠2 and K/k a finite field extension of degree n. Then K can be viewed as a quadratic space of k under the quadratic form T(X) =tr_K/k(x²). The invariants of this form are given in the case when K/k is a Galois extension, except for Galois extensions K/k with k dyadicn divisible by 4 and the 2-Sylowgroups of the Galois group are non-cyclic. Conversely all quadratic forms of a local field k of char(k)≠ 2 which appear as trace forms of Galois extensions of k are determined.     

Upper bounds for nearly optimal diagonal scaling of matrices

Optimal diagonal scaling of an n×n matrix A consists in finding a diagonal matrix D that minimizes a condition number of AD. Often a nearly optimal scaling of A is achieved by taking a diagonal matrix D₁ such that all diagonal elements of D₁A^TAD₁ are equal to one. It is shown in this paper that the condition number of AD₁ can be at least (n/2)^1/2 times the minimal one. Some questions for a further research are posed.     

Linear operators preserving the higher numerical radius of matrices

A linear operator T on a matrix space is said to be unital if T(I) = I. In this note we characterize the unital lineart operators on matrix spaces that preserve the k-numerical radius. Using the results obtained we easily determine the structure of all linear operators on the space of n × n complex matrices that preserve the k-numerical range. This completes the work of Pierce and Watking, who obtained the results for the cases when n ≠ n2k.     

ContributionsOn optimal orientations of cartesian products of graphs (I)

For a graph G, let D(G) be the family of strong orientations of G, and define [ovbar|d] (G) = min[d(D) vb D ] D(G), where d(D) denotes the diameter of the digraph D. Let G × H denote the cartesian product of the graphs G and H. In this paper, we determine completely the values of and , except , where K_n, P_n and C_n denote the complete graph, path and cycle of order n, respectively.     

Linear operators strongly preserving digraphs whose maximum cycle length

We characterize those linear operators L such that for all digraphsD,L(D) has maximal cycle length L if an only if D has maximum cycle length L. We do this for L =0 and L = 1, the cases L ≤2 having been done previously.