Degree sequences of graphs and dominance order

Suppose that the graphical partition H(A) = (a₂¹ ≥ ··· ≥ a_n¹) arises from A = (a₁ ≥ ··· ≥ a_n) by deleting the largest summand a₁ from A and reducing the a₁ largest of the remaining summands by one. Let (a_i+1′ ≥ ··· ≥ a_n′) = H′(A) denote the partition obtained by applying the operator H i times. We prove that the dominance order of partitions is preserved when we switch from A to (a₁ ≥ a₂¹ ≥ ··· ≥ a_i+1′ ≥ ···) =: E(A). This generalizes a recent result by Favaron, Mahéo, and Saclé on the residue of a graph. © 1996 John Wiley & Sons, Inc.     

The size Ramsey number of trees with bounded degree

The size Ramsey number r?(G, H) of graphs G and H is the smallest integer r? such that there is a graph F with r? edges and if the edge set of F is red-blue colored, there exists either a red copy of G or a blue copy of H in F. This article shows that r?(T_nd, T_nd) ? c · d² · n and c · n³ ? r?(K_n, T_nd) ? c(d)·n³ log n for every tree T_nd on n vertices. and maximal degree at most d and a complete graph K_n on n vertices. A generalization will be given. Probabilistic method is used throught this paper. © 1993 John Wiley Sons, Inc.     

Forbidden induced subgraph characterization of cograph contractions

Let S₁, S₂,…,S_t be pairwise disjoint non‐empty stable sets in a graph H. The graph H^* is obtained from H by: (i) replacing each S_i by a new vertex q_i; (ii) joining each q_i and q_j, 1 ≤ i # j ≤ t, and; (iii) joining q_i to all vertices in H – (S₁ ∪ S₂ ∪ ··· ∪ S_t) which were adjacent to some vertex of S_i. A cograph is a P₄‐free graph. A graph G is called a cograph contraction if there exist a cograph H and pairwise disjoint non‐empty stable sets in H for which G ? H^*. Solving a problem proposed by Le [ 2 ], we give a finite forbidden induced subgraph characterization of cograph contractions. © 2004 Wiley Periodicals, Inc. J Graph Theory 46: 217–226, 2004     

On pure Goldie dimensions

In this paper, we examine the pure Goldie dimension and dual pure Goldie dimension in finitely accessible additive categories. In particular, we show that if A is an object in a finitely accessible additive category 𝒜 that has finite pure Goldie dimension n and finite dual pure Goldie dimension m, then End_𝒜(A) is semilocal and the dual Goldie dimension of End_𝒜(A) is less than or equal to n+m.     

A polarographic study of methionine complexes of cadmium and indium

The stability constants of methionine complexes of cadmium were determined polarographically by ths method of DeFord and Hume as β₁ =6·5 × 10³, β₂ = 1·7 × 10⁶ and β₃ = 2·1 · 10⁸. The indium complexes were studied by the modified method of Momoki and Ogawa and two complexes, with β₁ = 1·7 × 10⁸ and β₂ = 8·4 × 10¹³, were identified in the concentration range studied. The haf-wave potential of uncomplexed indium ion which cannot be measured directly owing to the irreversible nature of the reduction was calculated as — 0·503 Vvs. SCE.     

A polarographic study of methionine complexes of cadmium in mixed solvents

Methionine complexes of cadmium in 25 and 50 per cent aqueous mixtures of ethyl and methyl alcohol and dioxan have been studied. The half-wave potentials measured in both the alcohols were the same and the reduction was reversible. Three complex species withβ ₁=1·0×10⁴,β ₂=1·1×10⁷ andβ ₃=1·2×10⁹ were found in 25 per cent alcohol while four complexes withβ ₁=3·0×10⁴,β ₂=4·3×10⁷,β ₃=4·0×10⁹ andβ ₄=1·6×10¹¹ were observed in 50 per cent solutions. In the case of dioxan, the reduction was quasi-reversible (k _s=1·0×10^?3 cm sec^?1) in 25 per cent and irreversible (k _s=2·0×10^?4 cm sec^?1) in 50 per cent solutions. The stability constants, evaluated using the formal potentials, wereβ ₁=7·0×10³,β ₂-3·9×10⁵;β ₂=3·9×10⁸ andβ ₄=3·4×10¹⁰ in 25 per cent dioxan andβ ₁=1·5×10⁴,β ₂=3·4×10⁷.β ₃=7·5×10⁹ andβ ₄=9·0×10¹¹ in 50 per cent solutions.     

Completely 𝒲-Resolved Complexes

Let R be a ring and 𝒲 a self-orthogonal class of left R-modules which is closed under finite direct sums and direct summands. A complex C of left R-modules is called a 𝒲-complex if it is exact with each cycle Z ⁿ (C) ∈ 𝒲. The class of such complexes is denoted by 𝒞_𝒲. A complex C is called completely 𝒲-resolved if there exists an exact sequence of complexes D _· = … → D _?1 → D ₀ → D ₁ → … with each term D _i in 𝒞_𝒲 such that C = ker(D ₀ → D ₁) and D _· is both Hom(𝒞_𝒲, ?) and Hom(?, 𝒞_𝒲) exact. In this article, we show that C = … → C ^?1 → C ⁰ → C ¹ → … is a completely 𝒲-resolved complex if and only if C ⁿ is a completely 𝒲-resolved module for all n ∈ ?. Some known results are obtained as corollaries.     

Über symmetrische Graphen vom grad fünf

Let G be a connected 1-transitive graph of valency five. It is shown that the order of a vertex stabilizer divides 5 · 3² · 2¹⁷. A theorem of A. Gardiner bounding the order of a vertex stabilizer of a 2-transitive graph of valency 1 + p,p prime, is reproved.     

Nuclear disintegrations produced in nuclear emulsions by α-particles of great energy

A study of nuclear disintegrations caused by α-particles of primary cosmic radiation with energies > 5 BeV per nucleon, has been carried out. In a systematic survey in nuclear emulsions using ‘along the track’ scanning method, 479 α-particles with a total track length of 40·84 metres and 242 interactions were obtained. From the angular distribution of shower particles associated with these interactions, a procedure has been found for distinguishing protons, which originally formed part of the incident α-particle and which have not taken part in the interaction, from other charged particles. The mean free path for nuclear interaction in G-5 emulsion is found to be 17·5±1·1 cm. (68·9±4·3 gm./cm.²). Assigning both to the incident α-particle and to the target nuclei a radius R=r _oA^1/2, one obtains an effective nuclear radiusr _o=1·13±0·04 ×10^?13 cm. Using the number of protons emerging from disintegrations of heavy nuclei (Silver and Bromine) without having participated in the interaction (as can be deduced from the angular distribution) and assuming spherical nuclei of uniform density, the mean free path of nucleons in nuclear matter is calculated to be less than 3·2×10^?13 cm.     

Cubic one-regular graphs of order twice a square-free integer

A graph is one-regular if its automorphism group acts regularly on the set of its arcs.Let n be a square-free integer.In this paper,we show that a cubic one-regular graph of order 2n exists if and only if n=3~tp1p2…p_s≥13,where t≤1,s≥1 and p_i's are distinct primes such that 3|(P_i—1). For such an integer n,there are 2~(s-1) non-isomorphic cubic one-regular graphs of order 2n,which are all Cayley graphs on the dihedral group of order 2n.As a result,no cubic one-regular graphs of order 4 times an odd square-free integer exist.     

Proof of a conjecture on game domination

Let G(V, E) be a simple, undirected graph where V is the set of vertices and E is the set of edges. A b‐dimensional cube is a Cartesian product I₁×I₂×···×I_b, where each I_i is a closed interval of unit length on the real line. The cubicity of G, denoted by cub(G), is the minimum positive integer b such that the vertices in G can be mapped to axis parallel b‐dimensional cubes in such a way that two vertices are adjacent in G if and only if their assigned cubes intersect. An interval graph is a graph that can be represented as the intersection of intervals on the real line—i.e. the vertices of an interval graph can be mapped to intervals on the real line such that two vertices are adjacent if and only if their corresponding intervals overlap. Suppose S(m) denotes a star graph on m+1 nodes. We define claw number ψ(G) of the graph to be the largest positive integer m such that S(m) is an induced subgraph of G. It can be easily shown that the cubicity of any graph is at least ?log₂ψ(G)?. In this article, we show that for an interval graph G ?log₂ψ(G)??cub(G)??log₂ψ(G)?+2. It is not clear whether the upper bound of ?log₂ψ(G)?+2 is tight: till now we are unable to find any interval graph with cub(G)>?log₂ψ(G)?. We also show that for an interval graph G, cub(G)??log₂α?, where α is the independence number of G. Therefore, in the special case of ψ(G)=α, cub(G) is exactly ?log₂α₂?. The concept of cubicity can be generalized by considering boxes instead of cubes. A b‐dimensional box is a Cartesian product I₁×I₂×···×I_b, where each I_i is a closed interval on the real line. The boxicity of a graph, denoted box(G), is the minimum k such that G is the intersection graph of k‐dimensional boxes. It is clear that box(G)?cub(G). From the above result, it follows that for any graph G, cub(G)?box(G)?log₂α?. © 2010 Wiley Periodicals, Inc. J Graph Theory 65: 323–333, 2010     

Grids in random graphs

Threshold probabilities for the existence in a random graph on n vertices of a graph isomorphic to a given graph of order Cn and average degree at least three are investigated. In particular it is proved that the random graph G(n, p) on n vertices with edge probability contains a square grid on En/2 vertices. © 1994 John Wiley & Sons, Inc.     

Characteristics ofπ −-nucleon collisions at a primary energy of 4·4 GeV

Eight hundred and sixteen nuclear interactions produced by 4·4 GeVπ ^?-mesons in nuclear emulsion have been obtained by “along the track” scanning procedure. Favourable secondary particles from a selected 290π ^?-N (pion-nucleon) collisions have been identified by blob-density and multiple scattering measurements. It is found that the pion often persists in theseπ ^?-N collisions, the average persistence is estimated to be 0·24 per collision. It is estimated thatπ-N andπ-π collisions account for 60% and 28% respectively of the secondary particles. The average number of charged shower particles is 〈n _s〉=2·09±0·12, the average number of created charged particles is 〈n _e±〉=1·94±0·12, the average number of protons with energy greater than 300 MeV is 〈n _p〉=0·15±0·05 and the average number of charged kaons is found to be 〈n _k±〉=0·11±0·06. The integral energy spectra of pions in C-system as well as in L-system are well represented by exponential forms. The average inelasticity of the proton in C-system is found to be 0·52±0·10. The charge retention probability for protons inπ ^?-p collisions is 0·45±0·07.     

Star factorizations of graph products

A k‐star is the graph K_1,k. We prove a general theorem about k‐star factorizations of Cayley graphs. This is used to give necessary and sufficient conditions for the existence of k‐star factorizations of any power (K_q)^s of a complete graph with prime power order q, products C × C ×··· × C of k cycles of arbitrary lengths, and any power (C_r)^s of a cycle of arbitrary length. © 2001 John Wiley & Sons, Inc. J Graph Theory 36: 59–66, 2001     

The edge‐bandwidth of theta graphs

An edge‐labeling f of a graph G is an injection from E(G) to the set of integers. The edge‐bandwidth of G is B′(G) = min_f {B′(f)} where B′(f) is the maximum difference between labels of incident edges of G. The theta graph Θ(l₁,…,l_m) is the graph consisting of m pairwise internally disjoint paths with common endpoints and lengths l₁ ≤ ··· ≤ l_m. We determine the edge‐bandwidth of all theta graphs. © 2000 John Wiley & Sons, Inc. J Graph Theory 35: 89–98, 2000     

CO‐irredundant Ramsey numbers for graphs

The study of the CO‐irredundant Ramsey numbers t(n₁, ···, n_k) is initiated. It is shown that several values and bounds for these numbers may be obtained from the well‐studied generalized graph Ramsey numbers and the values of t(4, 5), t(4, 6) and t(3, 3, m) are calculated. © 2000 John Wiley & Sons, Inc. J Graph Theory 34: 258–268, 2000     

The edge reconstruction hypothesis is true for graphs with more than n · log2n edges

It is shown that a graph with n vertices and more than n · log₂n edges can be uniquely reconstructed from its edge-deleted subgraphs.     

The maximal Fejér operator on the spacesH p (R×···×R)

It is shown that the maximal operator of the Fejér means of a tempered distribution is bounded from thed-dimensional Hardy spaceH _p (R×···×R) toL _p (R ^d ) (1/2<p<∞) and is of weak type (H ₁ ^?i ,L ₁) (i=1,…,d), where the Hardy spaceH ₁ ^?i is defined by a hybrid maximal function. As a consequence, we obtain that the Fejér means of a functionf ∈H ₁ ^?i ?L(logL) ^d?1 converge a.e. to the function in question. Moreover, we prove that the Fejér means are uniformly bounded onH _p (R×···×R) whenever 1/2<p<∞. Thus, in casef ∈H _p (R×···×R) the Fejér means converge tof inH _p (R×···×R) norm. The same results are proved for the conjugate Fejér means, too.     

Strict Dead-End Elements in Free Soluble Groups

Let G be a group generated by a finite set A. An element g ∈ G is a strict dead end of depth k (with respect to A) if |g|>|ga ₁|>|ga ₁ a ₂|>···>|ga ₁ a ₂… a _k | for any a ₁, a ₂,…, a _k  ∈ A ^±1 such that the word a ₁ a ₂… a _k is freely irreducible. (Here |g| is the distance from g to the identity in the Cayley graph of G.) We show that in finitely generated free soluble groups of degree d ≥ 2 there exist strict dead elements of depth k = k(d), which grows exponentially with respect to d.     

On the characteristic of sets in the space conjugate to a normed structure

Let (E, ∥ · ∥_E) be a normed space, E^* its conjugate, and M a linear subset in E^*. The number is called the characteristic of the set M. In this paper we establish a relationship in normed structures between the semicontinuous properties of the norm and the characteristics of certain subsets in the conjugate space. For example, the following is a valid proposition. Let (X, ∥ · ||_X) be a KN-space. Then in order that ∥ · ∥_X be semicontinuous on X it is necessary and sufficient that for each intervally-complete norm p on X the set (X, ∥ · ∥_X)^* ∩ (X, p)^*, i.e., the set of all functionals linear on X, simultaneously continuous with respect to both the norm ∥ · ∥_X and the norm p, have characteristic one in the space (X, ∥ · ∥_X).