The search for chromatically unique graphs

The number of vertex-colourings of a simple graphG in not more than colours is a polynomial in. This polynomial, denoted byP(G, ), is called the chromatic polynomial ofG. A graphG is said to be chromatically unique, in short-unique, ifH G for any graphH withP(H, ) = P(G, ). Since the appearance of the first paper on-unique graphs by Chao and Whitehead in 1978, various families of and several results on such graphs have been obtained successively, especially during the last five years. It is the aim of this expository paper to give a survey on most of the works done on-unique graphs. A number of related problems and conjectures are also included.1980 Mathematical Subject Classification. Primary 05C15This work was done while the author was visiting the Department of Mathematics, National University of Singapore.     

Regularity of ∫Ω|∇u|2 + λ∫Ω|u−f{2 and some gap phenomenon

We study the regularity of the minimizer u for the functional F (u,f)=|u|² + |u–f{² over all maps uH ¹(, S ²). We prove that for some suitable functions f every minimizer u is smooth in if ₀ and for the same functions f, u has singularities when is large enough.

---

Résumé On étudie la régularité des minimiseurs u du problème de minimisation min_ueH ¹(,S²)(|u|² + |u–f{². On montre que pour certaines fonctions f, u est régulière lorsque ₀ et pour les mêmes f, si est assez grand, alors u possède des singularités.

     

A minimax principle for the critical value of a boundary value problem with positive and increasing nonlinearity

Summary For a non-linear boundary value problem with a positive and increasing non-linearity there exists a critical value* of the parameter, beyond which there are no solutions. We give a minimax characterization of*.

---

Zusammenfassung In der Randwertaufgabe –u(x)=f(x, u(x)), u(a)=u(b)=0, seif positiv und wachsend im zweiten Argument. Dann gibt es einen Wert*, so dass keine Lösung existiert für>*. In dieser Arbeit wird* durch ein Minimaxprinzip charakterisiert. Der Beweis beruht auf der Anwendung von Ober- und Unterlösungen und monotonen Iterationen.

     

D λ -cycles in 3-cyclable graphs

Letk and be positive integers, andG a 2-connected graph of ordern with minimum degree and independence number. A cycleC ofG is called aD -cycle if every component ofG – V(C) has order smaller than. The graphG isk-cyclable if anyk vertices ofG lie on a common cycle. A previous result of the author is that if k 2, G isk-connected and every connected subgraphH ofG of order has at leastn +k ² + 1/k + 1 – vertices outsideH adjacent to at least one vertex ofH, thenG contains aD -cycle. Here it is conjectured that k-connected can be replaced by k-cyclable, and this is proved fork = 3. As a consequence it is shown that ifn 4 – 6, or ifG is triangle-free andn 8 – 10, thenG contains aD ₃-cycle orG , where denotes a well-known class of nonhamiltonian graphs of connectivity 2. As an analogue of a result of Nash-Williams it follows that ifn 4 – 6 and – 1, thenG is hamiltonian orG . The results are all best possible and compare favorably with recent results on hamiltonicity of graphs which are close to claw-free.     

Continuous Singularity of the Weak Limit of Convolution Powers of a Discrete Probability Measure on 2 × 2 Stochastic Matrices

Let be a probability measure on n 2 × 2 stochastic matrices, n an arbitrary positive integer, and = (w) lim _n ⁿ , such that the support of consists of 2 × 2 stochastic matrices of rank one, and as such, can be regarded as a probability measure on [0, 1]. We present simple sufficient conditions for to be continuous singular w.r.t. the Lebesgue measure on [0, 1]. We also determine , given .     

Nonlinear eigenvalue approximation

Summary For each in some domainD in the complex plane, letF() be a linear, compact operator on a Banach spaceX and letF be holomorphic in . Assuming that there is a so thatI–F() is not one-to-one, we examine two local methods for approximating the nonlinear eigenvalue . In the Newton method the smallest eigenvalue of the operator pencil [I–F(),F()] is used as increment. We show that under suitable hypotheses the sequence of Newton iterates is locally, quadratically convergent. Second, suppose 0 is an eigenvalue of the operator pencil [I–F(),I] with algebraic multiplicitym. For fixed leth() denote the arithmetic mean of them eigenvalues of the pencil [I–F(),I] which are closest to 0. Thenh is holomorphic in a neighborhood of andh()=0. Under suitable hypotheses the classical Muller's method applied toh converges locally with order approximately 1.84.     

Steepest Descent with Curvature Dynamical System

Let H be a real Hilbert space and let <..,.> denote the corresponding scalar product. Given a function that is bounded from below, we consider the following dynamical system:

On polynomial EkP matrices

In this paper the relation betweenEP--matrices andE ^k P--matrices over an arbitrary filedF is studied. Further, conditions for the product ofE ^k P--matrices to be anE ^k P--matrix and for the reverse order law to hold for the polynomial Moore-Penrose inverse of the product ofE ^k P--matrices are determined     

Resolution of the Symmetric Nonnegative Inverse Eigenvalue Problem for Matrices Subordinate to a Bipartite Graph

There is a symmetric nonnegative matrix A, subordinate to a given bipartite graph G on n vertices, with eigenvalues _{12 n} if and only if, ₁ + _n 0, ₂ + _n-10,..., _m + _{n - m + 1}0, _{m + 1}0,..., _{n - m} 0, in which m is the matching numberof G. Other observations are also made about the symmetric nonnegative inverse eigenvalue problem with respect to a graph