Equality of Lifshitz and van Hove exponents on amenable Cayley graphs

We study the low energy asymptotics of periodic and random Laplace operators on Cayley graphs of amenable, finitely generated groups. For the periodic operator the asymptotics is characterised by the van Hove exponent or zeroth Novikov–Shubin invariant. The random model we consider is given in terms of an adjacency Laplacian on site or edge percolation subgraphs of the Cayley graph. The asymptotic behaviour of the spectral distribution is exponential, characterised by the Lifshitz exponent. We show that for the adjacency Laplacian the two invariants/exponents coincide. The result holds also for more general symmetric transition operators. For combinatorial Laplacians one has a different universal behaviour of the low energy asymptotics of the spectral distribution function, which can be actually established on quasi-transitive graphs without an amenability assumption. The latter result holds also for long range bond percolation models.     

Complete solution to a conjecture on the Randić index of triangle-free graphs

The Randić index R(G) of a graph G is defined by , where d(u) is the degree of a vertex u in G and the summation extends over all edges uv of G. A conjecture about the Randić index says that for any triangle-free graph G of order n with minimum degree δ≥k≥1, one has , where the equality holds if and only if G=K_k,n−k. In this short note we give a confirmative proof for the conjecture.     

Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable

The Total Coloring Conjecture, in short, TCC, says that every simple graph is (Δ+2)-totally-colorable where Δ is the maximum degree of the graph. Even for planar graphs this conjecture has not been completely settled yet. However, every planar graph with Δ≥9 has been proved to be (Δ+1)-totally-colorable. In this paper, we prove that planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable.     

On polynomial digraphs

Let Φ(x,y) be a bivariate polynomial with complex coefficients. The zeroes of Φ(x,y) are given a combinatorial structure by considering them as arcs of a directed graph G(Φ). This paper studies some relationship between the polynomial Φ(x,y) and the structure of G(Φ).     

Characterizations of Clifford semigroup digraphs

This paper characterizes directed graphs which are Cayley graphs of strong semilattices of groups and, in particular, strong chains of groups, i.e. of completely regular semigroups which are also called Clifford semigroups.     

On geodesic structures of weakly median graphs—II: Compactness, the role of isometric rays

We prove that the vertex set of a K_ℵ0-free weakly median graph G endowed with the weak topology associated with the geodesic convexity on V(G) is compact if and only if G has one of the following equivalent properties: (1) G contains no isometric rays; (2) any chain of interval of G ordered by inclusion is finite; (3) every self-contraction of G fixes a non-empty finite regular weakly median subgraph of G. We study the self-contractions of K_ℵ0-free weakly median graphs which fix no finite set of vertices. We also follow a suggestion of Imrich and Klavzar [Product Graphs, Wiley, New York, 2000] by defining different centers of such a graph G, each of them giving rise to a non-empty finite regular weakly median subgraph of G which is fixed by all automorphisms of G.     

Asymptotic enumeration of sparse 0-1 matrices with irregular row and column sums

Let s=(s₁,…,s_m) and t=(t₁,…,t_n) be vectors of non-negative integer-valued functions with equal sum . Let N(s,t) be the number of m×n matrices with entries from {0,1} such that the ith row has row sum s_i and the jth column has column sum t_j. Equivalently, N(s,t) is the number of labelled bipartite graphs with degrees of the vertices in one side of the bipartition given by s and the degrees of the vertices in the other side given by t. We give an asymptotic formula for N(s,t) which holds when S→∞ with 1?st=o(S^2/3), where and . This extends a result of McKay and Wang [Linear Algebra Appl. 373 (2003) 273-288] for the semiregular case (when s_i=s for 1?i?m and t_j=t for 1?j?n). The previously strongest result for the non-semiregular case required 1?max{s,t}=o(S^1/4), due to McKay [Enumeration and Design, Academic Press, Canada, 1984, pp. 225-238].     

Non-stretchable pseudo-visibility graphs

We exhibit a family of graphs which can be realized as pseudo-visibility graphs of pseudo-polygons, but not of straight-line polygons. The example is based on the characterization of vertex-edge pseudo-visibility graphs of O'Rourke and Streinu [Proc. ACM Symp. Comput. Geometry, Nice, France, 1997, pp. 119–128] and extends a recent result of the author [Proc. ACM Symp. Comput. Geometry, Miami Beach, 1999, pp. 274–280] on non-stretchable vertex-edge visibility graphs. We construct a pseudo-visibility graph for which there exists a unique compatible vertex-edge visibility graph, which is then shown to be non-stretchable. The construction is then extended to an infinite family.     

Quasirecognizability by the Set of Element Orders for Groups 3D4(q) and F4(q), for q Odd

It is proved that if L is one of the simple groups ³D₄(q) or F₄(q), where q is odd, and G is a finite group with the set of element orders as in L, then the derived subgroup of G/F(G) is isomorphic to L and the factor group G/G′ is a cyclic {2, 3}-group. __________ Translated from Algebra i Logika, Vol. 44, No. 5, pp. 517–539, September–October, 2005. Supported by RFBR grant No. 04-01-00463.     

Decomposition of search for -structures in DAGs

We show that the problem of searching for v-structures in a directed acyclic graph can be decomposed into searches in its decomposed subgraphs. This result simplifies the search for v-structures and the recovery of local causal relationships.