r-Strong edge colorings of graphs

Let G be a graph and for any natural number r, denotes the minimum number of colors required for a proper edge coloring of G in which no two vertices with distance at most r are incident to edges colored with the same set of colors. In [Z. Zhang, L. Liu, J. Wang, Adjacent strong edge coloring of graphs, Appl. Math. Lett. 15 (2002) 623-626] it has been proved that for any tree T with at least three vertices, . Here we generalize this result and show that . Moreover, we show that if for any two vertices u and v with maximum degree d(u,v)?3, then . Also for any tree T with Δ(T)?3 we prove that . Finally, it is shown that for any graph G with no isolated edges, .     

A contraction of square transversal designs

In this paper we show that if a square transversal design TD_λ[k;u], say D(=(P,B)), admits a class semiregular automorphism group G of order s, then we have a by matrix M with entries from G∪{0} satisfying , where , if i=j, and , otherwise. As an application of (*), we show that any symmetric TD₂[12;6] admits no nontrivial elation. We also obtain a result that gives us a restriction on the existence of elations of putative projective planes of composite order.     

Distance irredundance and connected domination numbers of a graph

Let k be a positive integer and G be a connected graph. This paper considers the relations among four graph theoretical parameters: the k-domination number γ_k(G), the connected k-domination number ; the k-independent domination number and the k-irredundance number ir_k(G). The authors prove that if an ir_k-set X is a k-independent set of G, then , and that for k?2, if ir_k(G)=1, if ir_k(G) is odd, and if ir_k(G) is even, which generalize some known results.     

Hamilton decompositions of directed cubes and products

Call a directed graph symmetric if it is obtained from an undirected graph G by replacing each edge of G by two directed edges, one in each direction. We will show that if G has a Hamilton decomposition with certain additional structure, then has a directed Hamilton decomposition. In particular, it will follow that the bidirected cubes for m?2 are decomposable into 2m+1 directed Hamilton cycles and that a product of cycles is decomposable into 2m+1 directed Hamilton cycles if n_i?3 and m?2.     

On conjugate adjacency matrices of a graph

Let G be a simple graph of order n. Let and , where a and b are two nonzero integers and m is a positive integer such that m is not a perfect square. We say that A^c=[c_ij] is the conjugate adjacency matrix of the graph G if c_ij=c for any two adjacent vertices i and j, for any two nonadjacent vertices i and j, and c_ij=0 if i=j. Let P_G(λ)=|λI-A| and denote the characteristic polynomial and the conjugate characteristic polynomial of G, respectively. In this work we show that if then , where denotes the complement of G. In particular, we prove that if and only if P_G(λ)=P_H(λ) and . Further, let P^c(G) be the collection of conjugate characteristic polynomials of vertex-deleted subgraphs G_i=G?i(i=1,2,…,n). If P^c(G)=P^c(H) we prove that , provided that the order of G is greater than 2.     

On duality between étale groupoids and Hopf algebroids

For any étale Lie groupoid G over a smooth manifold M, the groupoid convolution algebra of smooth functions with compact support on G has a natural coalgebra structure over the commutative algebra which makes it into a Hopf algebroid. Conversely, for any Hopf algebroid A over we construct the associated spectral étale Lie groupoid over M such that is naturally isomorphic to G. Both these constructions are functorial, and is fully faithful left adjoint to . We give explicit conditions under which a Hopf algebroid is isomorphic to the Hopf algebroid of an étale Lie groupoid G.     

Graph colourings and solutions of systems of equations over finite fields

A congruence (p is a prime) is said to be strong homogeneous if it has the form

     

Total domination and total domination subdivision number of a graph and its complement

A set S of vertices of a graph G=(V,E) with no isolated vertex is a total dominating set if every vertex of V(G) is adjacent to some vertex in S. The total domination numberγ_t(G) is the minimum cardinality of a total dominating set of G. The total domination subdivision numbersd_γt(G) is the minimum number of edges that must be subdivided in order to increase the total domination number. We consider graphs of order n?4, minimum degree δ and maximum degree Δ. We prove that if each component of G and has order at least 3 and , then and if each component of G and has order at least 2 and at least one component of G and has order at least 3, then . We also give a result on stronger than a conjecture by Harary and Haynes.     

Nomadic decompositions of bidirected complete graphs

We use to denote the bidirected complete graph on n vertices. A nomadic Hamiltonian decomposition of is a Hamiltonian decomposition, with the additional property that “nomads” walk along the Hamiltonian cycles (moving one vertex per time step) without colliding. A nomadic near-Hamiltonian decomposition is defined similarly, except that the cycles in the decomposition have length n-1, rather than length n. Bondy asked whether these decompositions of exist for all n. We show that admits a nomadic near-Hamiltonian decomposition when .     

Remarks on the minus (signed) total domination in graphs

A function f:V(G)→{+1,0,-1} defined on the vertices of a graph G is a minus total dominating function if the sum of its function values over any open neighborhood is at least 1. The minus total domination number of G is the minimum weight of a minus total dominating function on G. By simply changing “{+1,0,-1}” in the above definition to “{+1,-1}”, we can define the signed total dominating function and the signed total domination number of G. In this paper we present a sharp lower bound on the signed total domination number for a k-partite graph, which results in a short proof of a result due to Kang et al. on the minus total domination number for a k-partite graph. We also give sharp lower bounds on and for triangle-free graphs and characterize the extremal graphs achieving these bounds.     

Monoids with sub-log-exponential free spectra

A classic result from the 1960s states that the asymptotic growth of the free spectrum of a finite group is sub-log-exponential if and only if is nilpotent. Thus a monoid is sub-log-exponential implies , the pseudovariety of semigroups with nilpotent subgroups. Unfortunately, little more is known about the boundary between the sub-log-exponential and log-exponential monoids.The pseudovariety consists of those finite semigroups satisfying (x^ωy^ω)^ω(y^ωx^ω)^ω(x^ωy^ω)^ω≈(x^ωy^ω)^ω. Here it is shown that a monoid is sub-log-exponential implies . A quick application: a regular sub-log-exponential monoid is orthodox. It is conjectured that a finite monoid is sub-log-exponential if and only if it is , the finite monoids in having nilpotent subgroups. The forward direction of the conjecture is proved; moreover, the conjecture is proved for when is completely (0)-simple. In particular, the six-element Brandt monoid (the Perkins semigroup) is sub-log-exponential.     

Edge covered critical multigraphs

Let G be a multigraph with edge set E(G). An edge coloring C of G is called an edge covered coloring, if each color appears at least once at each vertex v∈V(G). The maximum positive integer k such that G has a k edge covered coloring is called the edge covered chromatic index of G and is denoted by . A graph G is said to be of class if and otherwise of class. A pair of vertices {u,v} is said to be critical if . A graph G is said to be edge covered critical if it is of class and every edge with vertices in V(G) not belonging to E(G) is critical. Some properties about edge covered critical graphs are considered.     

On the number of graphs with a given endomorphism monoid

For a given finite monoid , let be the number of graphs on n vertices with endomorphism monoid isomorphic to . For any nontrivial monoid we prove that where and are constants depending only on with .For every k there exists a monoid of size k with , on the other hand if a group of unity of has a size k>2 then .     

On a relation between certain cohomological invariants

Let G be a group, the supremum of the projective lengths of the injective ZG-modules and the supremum of the injective lengths of the projective ZG-modules. The invariants and were studied in [T.V. Gedrich, K.W. Gruenberg, Complete cohomological functors on groups, Topology Appl. 25 (1987) 203-223] in connection with the existence of complete cohomological functors. If is finite then [T.V. Gedrich, K.W. Gruenberg, Complete cohomological functors on groups, Topology Appl. 25 (1987) 203-223] and , where is the generalized cohomological dimension of G [B.M. Ikenaga, Homological dimension and Farrell cohomology, J. Algebra 87 (1984) 422-457]. Note that if G is of finite virtual cohomological dimension. It has been conjectured in [O. Talelli, On groups of type Φ, Arch. Math. 89 (1) (2007) 24-32] that if is finite then G admits a finite dimensional model for , the classifying space for proper actions.We conjecture that for any group G and we prove the conjecture for duality groups, fundamental groups of graphs of finite groups and fundamental groups of certain finite graphs of groups of type .     

Cospectral graphs and the generalized adjacency matrix

Let J be the all-ones matrix, and let A denote the adjacency matrix of a graph. An old result of Johnson and Newman states that if two graphs are cospectral with respect to yJ − A for two distinct values of y, then they are cospectral for all y. Here we will focus on graphs cospectral with respect to yJ − A for exactly one value of y. We call such graphs -cospectral. It follows that is a rational number, and we prove existence of a pair of -cospectral graphs for every rational . In addition, we generate by computer all -cospectral pairs on at most nine vertices. Recently, Chesnokov and the second author constructed pairs of -cospectral graphs for all rational , where one graph is regular and the other one is not. This phenomenon is only possible for the mentioned values of , and by computer we find all such pairs of -cospectral graphs on at most eleven vertices.     

Deduction of L. Hörmander's extension of Ásgeirsson's mean value theorem

L. Hörmander's extension of Ásgeirsson's mean value theorem states that if u is a solution of the inhomogeneous ultrahyperbolic equation (Δ_x−Δ_y)u=f, , , then

     

Holomorphy of spectral multipliers of the Ornstein-Uhlenbeck operator

Let γ be the Gauss measure on and the Ornstein-Uhlenbeck operator. For every p in [1,∞)?{2}, set , and consider the sector . The main results of this paper are the following. If p is in (1,∞)?{2}, and , i.e., if M is an Lp(γ)uniform spectral multiplier of in our terminology, and M is continuous on , then M extends to a bounded holomorphic function on the sector . Furthermore, if p=1 a spectral multiplier M, continuous on , satisfies the condition if and only if M extends to a bounded holomorphic function on the right half-plane, and its boundary value M(i·) on the imaginary axis is the Euclidean Fourier transform of a finite Borel measure on the real line. We prove similar results for uniform spectral multipliers of second order elliptic differential operators in divergence form on belonging to a wide class, which contains . From these results we deduce that operators in this class do not admit an H^∞ functional calculus in sectors smaller than .     

On NP-hardness of the clique partition—Independence number gap recognition and related problems

We show that for a graph G it is NP-hard to decide whether its independence number α(G) equals its clique partition number even when some minimum clique partition of G is given. This implies that any α(G)-upper bound provably better than is NP-hard to compute.To establish this result we use a reduction of the quasigroup completion problem (QCP, known to be NP-complete) to the maximum independent set problem. A QCP instance is satisfiable if and only if the independence number α(G) of the graph obtained within the reduction is equal to the number of holes h in the QCP instance. At the same time, the inequality always holds. Thus, QCP is satisfiable if and only if . Computing the Lovász number ?(G) we can detect QCP unsatisfiability at least when . In the other cases QCP reduces to gap recognition, with one minimum clique partition of G known.