Distance-Dominating Cycles in Quasi Claw-Free Graphs

We say that a graph G is quasi claw-free if every pair (a ₁, a ₂) of vertices at distance 2 satisfies {u∈N (a ₁)∩N (a ₂) | N[u]⊆N[a ₁]∪N [a ₂]}≠∅. A cycle C is m-dominating if every vertex of G is of distance at most m from C. We prove that if G is a κ-connected (κ≥2) quasi claw-free graph then either G has an m-dominating cycle or G has a set of at least κ+1 vertices such that the distance between every pair of them is at least 2m+3. Received: June 12, 1996 Revised: November 9, 1998     

Undirected power graphs of semigroups

The undirected power graph G(S) of a semigroup S is an undirected graph whose vertex set is S and two vertices a,b∈S are adjacent if and only if a≠b and a ^m =b or b ^m =a for some positive integer m. In this paper we characterize the class of semigroups S for which G(S) is connected or complete. As a consequence we prove that G(G) is connected for any finite group G and G(G) is complete if and only if G is a cyclic group of order 1 or p ^m . Particular attention is given to the multiplicative semigroup ℤ _n and its subgroup U _n , where G(U _n ) is a major component of G(ℤ _n ). It is proved that G(U _n ) is complete if and only if n=1,2,4,p or 2p, where p is a Fermat prime. In general, we compute the number of edges of G(G) for a finite group G and apply this result to determine the values of n for which G(U _n ) is planar. Finally we show that for any cyclic group of order greater than or equal to 3, G(G) is Hamiltonian and list some values of n for which G(U _n ) has no Hamiltonian cycle.     

Diperfect graphs

Gallai and Milgram have shown that the vertices of a directed graph, with stability number α(G), can be covered by exactly α(G) disjoint paths. However, the various proofs of this result do not imply the existence of a maximum stable setS and of a partition of the vertex-set into paths μ₁, μ₂, ..., μ_k such tht |μ_i ∩S|=1 for alli. Later, Gallai proved that in a directed graph, the maximum number of vertices in a path is at least equal to the chromatic number; here again, we do not know if there exists an optimal coloring (S ₁,S ₂, ...,S _k) and a path μ such that |μ ∩S _i|=1 for alli. In this paper we show that many directed graphs, like the perfect graphs, have stronger properties: for every maximal stable setS there exists a partition of the vertex set into paths which meet the stable set in only one point. Also: for every optimal coloring there exists a path which meets each color class in only one point. This suggests several conjecties similar to the perfect graph conjecture. Dedicated to Tibor Gallai on his seventieth birthday     

Large centralizers in finite solvable groups

In 1955 R. Brauer and K. A. Fowler showed that ifG is a group of even order >2, and the order |Z(G)| of the center ofG is odd, then there exists a strongly real) elementx∈G−Z whose centralizer satisfies|C _G(x)|>|G|^1/3. In Theorem 1 we show that every non-abeliansolvable groupG contains an elementx∈G−Z such that|C _G(x)|>[G:G′∩Z]^1/2 (and thus|C _G(x)|>|G|^1/3). We also note that if non-abelianG is either metabelian, nilpotent or (more generally) supersolvable, or anA-group, or any Frobenius group, then|C _G(x)|>|G|^1/2 for somex∈G−Z. In Theorem 2 we prove that every non-abelian groupG of orderp ^mqⁿ (p, q primes) contains a proper centralizer of order >|G|^1/2. Finally, in Theorem 3 we show that theaverage |C(x)|, x∈G, is ≧c|G| ^1/3 for metabelian groups, wherec is constant and the exponent 1/3 is best possible.     

Untangling Polygons and Graphs

Untangling is a process in which some vertices in a drawing of a planar graph are moved to obtain a straight-line plane drawing. The aim is to move as few vertices as possible. We present an algorithm that untangles the cycle graph C _n while keeping Ω(n ^2/3) vertices fixed. For any connected graph G, we also present an upper bound on the number of fixed vertices in the worst case. The bound is a function of the number of vertices, maximum degree, and diameter of G. One consequence is that every 3-connected planar graph has a drawing δ such that at most O((nlog n)^2/3) vertices are fixed in every untangling of δ.     

On Cycle Sequences

. For each vertex v in a graph G, the maximum length of a cycle which passes through v is called the cycle number of v, denoted by c(v). A sequence a ₁,a ₂,…,a _n of nonnegative integers is called a cycle sequence of a graph G if the vertices of G can be labeled as v ₁,v ₂,…,v _n such that a _i =c(v _i ) for 1≤i≤n. We give some sufficient and necessary conditions for a sequence to be a cycle sequence. We can thereby derive a polynomial time procedure for recognizing cycle sequences. Received: July 14, 1997 Final version received: June 15, 1998     

The roots of <Emphasis Type="Italic">σ</Emphasis>-polynomials

Let G be a connected graph. We denote by σ(G,x) and δ(G) respectively the σ-polynomial and the edge-density of G, where . If σ(G,x) has at least an unreal root, then G is said to be a σ-unreal graph. Let δ(n) be the minimum edgedensity over all n vertices graphs with σ-unreal roots. In this paper, by using the theory of adjoint polynomials, a negative answer to a problem posed by Brenti et al. is given and the following results are obtained: For any positive integer a and rational number 0≤c≤1, there exists at least a graph sequence {G _i}_1≤i≤a such that G _i is σ-unreal and δ(G _i)→c as n→∞ for all 1 ≤i≤a, and moreover, δ(n)→0 as n→∞. Supported by the National Natural Science Foundation of China (10061003) and the Science Foundation of the State Education Ministry of China.     

Algebras whose equivalence relations are congruences

It is proved that all the equivalence relations of a universal algebra A are its congruences if and only if either |A| ≤ 2 or every operation f of the signature is a constant (i.e., f(a ₁ , . . . , a _n ) = c for some c ∈ A and all the a ₁ , . . . , a _n ∈ A) or a projection (i.e., f(a ₁ , . . . , a _n ) = a _i for some i and all the a ₁ , . . . , a _n ∈ A). All the equivalence relations of a groupoid G are its right congruences if and only if either |G| ≤ 2 or every element a ∈ G is a right unit or a generalized right zero (i.e., x _a  = y _a for all x, y ∈ G). All the equivalence relations of a semigroup S are right congruences if and only if either |S| ≤ 2 or S can be represented as S = A∪B, where A is an inflation of a right zero semigroup, and B is the empty set or a left zero semigroup, and ab = a, ba = a ² for a ∈ A, b ∈ B. If G is a groupoid of 4 or more elements and all the equivalence relations of it are right or left congruences, then either all the equivalence relations of the groupoid G are left congruences, or all of them are right congruences. A similar assertion for semigroups is valid without the restriction on the number of elements.     

Degree Sums,Connectivity and Dominating Cycles in Graphs

Let G be a graph of order n with connectivity κ≥3 and let α be the independence number of G. Set σ₄(G)= min{∑⁴ _{i =1} d(x _i ):{x ₁,x ₂,x ₃,x ₄} is an independent set of G}. In this paper, we will prove that if σ₄(G)≥n+2κ, then there exists a longest cycle C of G such that V(G−C) is an independent set of G. Furthermore, if the minimum degree of G is at least α, then G is hamiltonian. Received: July 31, 1998?Final version received: October 4, 2000     

Generalizations of coatomic modules

For a ring R and a right R-module M, a submodule N of M is said to be δ-small in M if, whenever N+X=M with M/X singular, we have X=M. Let ℘ be the class of all singular simple modules. Then δ(M)=Σ{ L≤ M| L is a δ-small submodule of M} = Re _jm(℘)=∩{ N⊂ M: M/N∈℘. We call M δ-coatomic module whenever N≤ M and M/N=δ(M/N) then M/N=0. And R is called right (left) δ-coatomic ring if the right (left) R-module R _R(_RR) is δ-coatomic. In this note, we study δ-coatomic modules and ring. We prove M=⊕ _i=1 ⁿ M_i is δ-coatomic if and only if each M _i (i=1,…, n) is δ-coatomic.     

On κ—ordered Graphs Involved Degree Sum

A graph G is κ-ordered Hamiltonian 2≤κ≤n,if for every ordered sequence S of κ distinct vertices of G,there exists a Hamiltonian cycle that encounters S in the given order,In this article,we prove that if G is a graph on n vertices with degree sum of nonadjacent vertices at least n 3κ-9/2,then G is κ-ordered Hamiltonian for κ=3,4,…,[n/19].We also show that the degree sum bound can be reduced to n 2[κ/2]-2 if κ(G）≥3κ-1/2 or δ（G）≥5κ-4.Several known results are generalized.     

Cycles in Partially Square Graphs

. In this work we consider finite undirected simple graphs. If G=(V,E) is a graph we denote by α(G) the stability number of G. For any vertex x let N[x] be the union of x and the neighborhood N(x). For each pair of vertices ab of G we associate the set J(a,b) as follows. J(a,b)={u∈N[a]∩N[b]∣N(u)⊆N[a]∪N[b]}. Given a graph G, its partially squareG ^* is the graph obtained by adding an edge uv for each pair u,v of vertices of G at distance 2 whenever J(u,v) is not empty. In the case G is a claw-free graph, G ^* is equal to G ². If G is k-connected, we cover the vertices of G by at most ⌈α(G ^*)/k⌉ cycles, where α(G ^*) is the stability number of the partially square graph of G. On the other hand we consider in G ^* conditions on the sum of the degrees. Let G be any 2-connected graph and t be any integer (t≥2). If ∑ _{x ∈ S} deg _G (x)≥|G|, for every t-stable set S⊆V(G) of G ^* then the vertex set of G can be covered with t−1 cycles. Different corollaries on covering by paths are given. Received: January 22, 1997 Final version received: February 15, 2000     

Intersection theorems with geometric consequences

In this paper we prove that ifℱ is a family ofk-subsets of ann-set, μ₀, μ₁, ..., μ_s are distinct residues modp (p is a prime) such thatk ≡ μ₀ (modp) and forF ≠ F′ ≠ℱ we have |F ∩F′| ≡ μ_i (modp) for somei, 1 ≦i≦s, then |ℱ|≦( _s ⁿ ). As a consequence we show that ifR ⁿ is covered bym sets withm<(1+o(1)) (1.2) ⁿ then there is one set within which all the distances are realised. It is left open whether the same conclusion holds for compositep.     

Some results on the majorization theorem of connected graphs

Let π = (d ₁, d ₂, ..., d _n ) and π′ = (d′ ₁, d′ ₂, ..., d′ _n ) be two non-increasing degree sequences. We say π is majorizated by π′, denoted by π ⊲ π′, if and only if π ≠ π′, Σ _i=1 ⁿ d _i = Σ _i=1 ⁿ d′ _i , and Σ _i=1 ^j d _i ≤ Σ _i=1 ^j d′ _i for all j = 1, 2, ..., n. Weuse C _π to denote the class of connected graphs with degree sequence π. Let ρ(G) be the spectral radius, i.e., the largest eigenvalue of the adjacent matrix of G. In this paper, we extend the main results of [Liu, M. H., Liu, B. L., You, Z. F.: The majorization theorem of connected graphs. Linear Algebra Appl., 431(1), 553–557 (2009)] and [Bıyıkoğlu, T., Leydold, J.: Graphs with given degree sequence and maximal spectral radius. Electron. J. Combin., 15(1), R119 (2008)]. Moreover, we prove that if π and π′ are two different non-increasing degree sequences of unicyclic graphs with π ⊲ π′, G and G′ are the unicyclic graphs with the greatest spectral radii in C _π and C′ _π , respectively, then ρ(G) < ρ(G′).     

Almost continuous orbit equivalence for non-singular homeomorphisms

Let X and Y be Polish spaces with non-atomic Borel measures μ and ν of full support. Suppose that T and S are ergodic non-singular homeomorphisms of (X, μ) and (Y, ν) with continuous Radon-Nikodym derivatives. Suppose that either they are both of type III ₁ or that they are both of type III _λ, 0 < λ < 1 and, in the III _λ case, suppose in addition that both ‘topological asymptotic ranges’ (defined in the article) are log λ · ℤ. Then there exist invariant dense G _δ-subsets X′ ⊂ X and Y′ ⊂ Y of full measure and a non-singular homeomorphism ϕ: X′ → Y′ which is an orbit equivalence between T| _X′ and S| _Y′, that is ϕ{T ⁱ x} = {S ⁱ ϕx} for all x ∈ X′. Moreover, the Radon-Nikodym derivative dν ∘ ϕ/dμ is continuous on X′ and, letting S′ = ϕ ⁻¹ Sϕ, we have T _x = S′ ^n(x) x and S′x = T ^m(x) x where n and m are continuous on X′.     

Generalized Ham-Sandwich Cuts

Bárány, Hubard, and Jerónimo recently showed that for given well-separated convex bodies S ₁,…,S _d in R ^d and constants β _i ∈[0,1], there exists a unique hyperplane h with the property that Vol (h ⁺∩S _i )=β _i ⋅Vol (S _i ); h ⁺ is the closed positive transversal halfspace of h, and h is a “generalized ham-sandwich cut.” We give a discrete analogue for a set S of n points in R ^d which are partitioned into a family S=P ₁∪⋅⋅⋅∪P _d of well-separated sets and are in weak general position. The combinatorial proof inspires an O(n(log n) ^d−3) algorithm which, given positive integers a _i ≤|P _i |, finds the unique hyperplane h incident with a point in each P _i and having |h ⁺∩P _i |=a _i . Finally we show two other consequences of the direct combinatorial proof: the first is a stronger result, namely that in the discrete case, the conditions assuring existence and uniqueness of generalized cuts are also necessary; the second is an alternative and simpler proof of the theorem in Bárány et al., and in addition, we strengthen the result via a partial converse.     

A 2-factor with Short Cycles Passing Through Specified Independent Vertices in Graph

For a graph G, we define σ₂(G) := min{d(u) + d(v)|u, v ≠ ∈ E(G), u ≠ v}. Let k ≥ 1 be an integer and G be a graph of order n ≥ 3k. We prove if σ₂(G) ≥ n + k − 1, then for any set of k independent vertices v ₁,...,v _k , G has k vertex-disjoint cycles C ₁,..., C _k of length at most four such that v _i ∈ V(C _i ) for all 1 ≤ i ≤ k. And show if σ₂(G) ≥ n + k − 1, then for any set of k independent vertices v ₁,...,v _k , G has k vertex-disjoint cycles C ₁,..., C _k such that v _i ∈ V(C _i ) for all 1 ≤ i ≤ k, V(C ₁) ∪...∪ V(C _k ) = V(G), and |C _i | ≤ 4 for all 1 ≤ i ≤ k − 1. The condition of degree sum σ₂(G) ≥ n + k − 1 is sharp. Received: December 20, 2006. Final version received: December 12, 2007.     

On the Structure of Graphs with Bounded Asteroidal Number

 A set A⊆V of the vertices of a graph G=(V,E) is an asteroidal set if for each vertex a∈A, the set A\{a} is contained in one component of G−N[a]. The maximum cardinality of an asteroidal set of G, denoted by an (G), is said to be the asteroidal number of G. We investigate structural properties of graphs of bounded asteroidal number. For every k≥1, an (G)≤k if and only if an (H)≤k for every minimal triangulation H of G. A dominating target is a set D of vertices such that D∪S is a dominating set of G for every set S such that G[D∪S] is connected. We show that every graph G has a dominating target with at most an (G) vertices. Finally, a connected graph G has a spanning tree T such that d _T (x,y)−d _G (x,y)≤3·|D|−1 for every pair x,y of vertices and every dominating target D of G. Received: July 3, 1998 Final version received: August 10, 1999     

Graphs whose every transitive orientation contains almost every relation

Given a graphG onn vertices and a total ordering ≺ ofV(G), the transitive orientation ofG associated with ≺, denotedP(G; ≺), is the partial order onV(G) defined by settingx<y inP(G; ≺) if there is a pathx=x ₁ x ₂…x _r=y inG such thatx ₁ ≺x _j for 1≦i<j≦r. We investigate graphsG such that every transitive orientation ofG contains ₂ ⁿ −o(n ²) relations. We prove that almost everyG _n,p satisfies this requirement if , but almost noG _n,p satisfies the condition if (pn log log logn)/(logn log logn) is bounded. We also show that every graphG withn vertices and at mostcn logn edges has some transitive orientation with fewer than ₂ ⁿ −δ(c)n ² relations. Partially supported by MCS Grant 8104854.     

Distributing vertices along a Hamiltonian cycle in Dirac graphs

A graph G on n vertices is called a Dirac graph if it has a minimum degree of at least n/2. The distance is defined as the number of edges in a shortest path of G joining u and v. In this paper we show that in a Dirac graph G, for every small enough subset S of the vertices, we can distribute the vertices of S along a Hamiltonian cycle C of G in such a way that all but two pairs of subsequent vertices of S have prescribed distances (apart from a difference of at most 1) along C. More precisely we show the following. There are ω,n₀>0 such that if G is a Dirac graph on n≥n₀ vertices, d is an arbitrary integer with 3≤d≤ωn/2 and S is an arbitrary subset of the vertices of G with 2≤|S|=k≤ωn/d, then for every sequence d_i of integers with 3≤d_i≤d,1≤i≤k−1, there is a Hamiltonian cycle C of G and an ordering of the vertices of S, a₁,a₂,…,a_k, such that the vertices of S are visited in this order on C and we have