Hamiltonian path saturated graphs with small size

A graph G is said to be hamiltonian path saturated (HPS for short), if G has no hamiltonian path but any addition of a new edge in G creates a hamiltonian path in G. It is known that an HPS graph of order n has size at most and, for n?6, the only HPS graph of order n and size is K_n-1∪K₁. Denote by sat(n,HP) the minimum size of an HPS graph of order n. We prove that sat(n,HP)?⌊(3n-1)/2⌋-2. Using some properties of Isaacs’ snarks we give, for every n?54, an HPS graph G_n of order n and size ⌊(3n-1)/2⌋. This proves sat(n,HP)?⌊(3n-1)/2⌋ for n?54. We also consider m-path cover saturated graphs and P_m-saturated graphs with small size.     

The size of chordal,interval and threshold subgraphs

Given a graphG withn vertices andm edges, how many edges must be in the largest chordal subgraph ofG? Form=n ²/4+1, the answer is 3n/2?1. Form=n ²/3, it is 2n?3. Form=n ²/3+1, it is at least 7n/3?6 and at most 8n/3?4. Similar questions are studied, with less complete results, for threshold graphs, interval graphs, and the stars on edges, triangles, andK ₄'s.     

On the stability of the Serrin problem

We investigate stability issues concerning the radial symmetry of solutions to Serrin's overdetermined problems. In particular, we show that, if u is a solution to Δu=n in a smooth domain Ω⊂Rn, u=0 on ∂Ω and |Du| is “close” to 1 on ∂Ω, then Ω is “close” to the union of a certain number of disjoint unitary balls.     

The asymptotic number of geometries

A simple proof is given that lim_n?t8(log₂ log₂g_n)/n = 1, where g_n denotes the number of distinct combinatorial geometries on n point     

Supersaturated graphs and hypergraphs

We shall consider graphs (hypergraphs) without loops and multiple edges. Let ? be a family of so called prohibited graphs and ex (n, ?) denote the maximum number of edges (hyperedges) a graph (hypergraph) onn vertices can have without containing subgraphs from ?. A graph (hyper-graph) will be called supersaturated if it has more edges than ex (n, ?). IfG hasn vertices and ex (n, ?)+k edges (hyperedges), then it always contains prohibited subgraphs. The basic question investigated here is: At least how many copies ofL ε ? must occur in a graphG ⁿ onn vertices with ex (n, ?)+k edges (hyperedges)?     

Extremal energies of trees with a given domination number

The energy of a graph is defined as the sum of the absolute values of the eigenvalues of its adjacency matrix. Let T(n,γ) be the set of trees of order n and with domination number γ. In this paper, we characterize the tree from T(n,γ) with the minimal energy, and determine the tree from T(n,γ) where n=kγ with maximal energy for .     

Spectral radius and Hamiltonicity of graphs

Let G be a graph of order n and μ(G) be the largest eigenvalue of its adjacency matrix. Let be the complement of G.Write K_n-1+v for the complete graph on n-1 vertices together with an isolated vertex, and K_n-1+e for the complete graph on n-1 vertices with a pendent edge.We show that:If μ(G)?n-2, then G contains a Hamiltonian path unless G=K_n-1+v; if strict inequality holds, then G contains a Hamiltonian cycle unless G=K_n-1+e.If , then G contains a Hamiltonian path unless G=K_n-1+v.If , then G contains a Hamiltonian cycle unless G=K_n-1+e.     

A spectral condition for odd cycles in graphs

Let G be a graph of sufficiently large order n, and let the largest eigenvalue μ(G) of its adjacency matrix satisfies . Then G contains a cycle of length t for every t?n/320This condition is sharp: the complete bipartite graph T₂(n) with parts of size ⌊n/2⌋ and ⌈n/2⌉ contains no odd cycles and its largest eigenvalue is equal to .This condition is stable: if μ(G) is close to and G fails to contain a cycle of length t for some t?n/321, then G resembles T₂(n).     

On tricyclic graphs of a given diameter with minimal energy

The energy of a graph is defined as the sum of the absolute values of all the eigenvalues of the graph. Let G(n,d) be the class of tricyclic graphs G on n vertices with diameter d and containing no vertex disjoint odd cycles C_p,C_q of lengths p and q with p+q≡2(mod4). In this paper, we characterize the graphs with minimal energy in G(n,d).     

4-Books of three pages

Let H be a 4-uniform hypergraph on an n-element vertex set V containing no 4-book of 3 pages, i.e., a hypergraph of 4 quadruples with vertices {1,2,…,7} and edges {1234,1235,1236,4567}. Then for n>n₀

     

On 0-1 matrices and small excluded submatrices

We say that a 0-1 matrix A avoids another 0-1 matrix (pattern) P if no matrix P^′ obtained from P by increasing some of the entries is a submatrix of A. Following the lead of (SIAM J. Discrete Math. 4 (1991) 17-27; J. Combin. Theory Ser. A 55 (1990) 316-320; Discrete Math. 103 (1992) 233-251) and other papers we investigate n by n 0-1 matrices avoiding a pattern P and the maximal number ex(n,P) of 1 entries they can have. Finishing the work of [8] we find the order of magnitude of ex(n,P) for all patterns P with four 1 entries. We also investigate certain collections of excluded patterns. These sets often yield interesting extremal functions different from the functions obtained from any one of the patterns considered.     

Zonal spherical functions on the complex reflection groups and (n+1,m+1)-hypergeometric functions

The pair of groups, complex reflection group G(r,1,n) and symmetric group S_n, is a Gelfand pair. Its zonal spherical functions are expressed in terms of multivariate hypergeometric functions called (n+1,m+1)-hypergeometric functions. Since the zonal spherical functions have orthogonality, they form discrete orthogonal polynomials. Also shown is a relation between monomial symmetric functions and the (n+1,m+1)-hypergeometric functions.     

On Estrada index of trees

Let G be a graph on n vertices, and let λ₁,λ₂,…,λ_n be its eigenvalues. The Estrada index is defined as . We determine the unique tree with maximum Estrada index among the trees on n vertices with given matching number, and the unique tree with maximum Estrada index among the trees on n vertices with fixed diameter. For , we also determine the tree with maximum Estrada index among the trees on n vertices with maximum degree Δ. It gives a partial solution to the conjecture proposed by Ili? and Stevanovi? in Ref. [14].     

On restricted colourings ofK n

Given a sample graphH and two integers,n andr, we colourK _n byr colours and are interested in the following problem. Which colourings of the subgraphs isomorphic to H in K _n must always occur (and which types of colourings can occur whenK _n is coloured in an appropriate way)? These types of problems include theRamsey theory, where we ask: for whichn andr must a monochromaticH occur. They also include theanti-Ramsey type problems, where we are trying to ensure a totally multicoloured copy ofH, that is, anH each edge of which has different colour.     

The convexity spectra of graphs

Let D be a connected oriented graph. A set S⊆V(D) is convex in D if, for every pair of vertices x,y∈S, the vertex set of every x-y geodesic (x-y shortest dipath) and y-x geodesic in D is contained in S. The convexity numbercon(D) of a nontrivial oriented graph D is the maximum cardinality of a proper convex set of D. Let G be a graph. We define that S_C(G)={con(D):D is an orientation of G} and S_SC(G)={con(D):D is a strongly connected orientation of G}. In the paper, we show that, for any n?4, 1?a?n-2, and a≠2, there exists a 2-connected graph G with n vertices such that S_C(G)=S_SC(G)={a,n-1} and there is no connected graph G of order n?3 with S_SC(G)={n-1}. Then, we determine that S_C(K₃)={1,2}, S_C(K₄)={1,3}, S_SC(K₃)=S_SC(K₄)={1}, S_C(K₅)={1,3,4}, S_C(K₆)={1,3,4,5}, S_SC(K₅)=S_SC(K₆)={1,3}, S_C(K_n)={1,3,5,6,…,n-1}, S_SC(K_n)={1,3,5,6,…,n-2} for n?7. Finally, we prove that, for any integers n, m, and k with , 1?k?n-1, and k≠2,4, there exists a strongly connected oriented graph D with n vertices, m edges, and convexity number k.     

Global structure stability of Riemann solutions of quasilinear hyperbolic systems of conservation laws: shocks and contact discontinuities

In this paper, the author proves the global structure stability of the Lax's Riemann solution , containing only shocks and contact discontinuities, of general n×n quasilinear hyperbolic system of conservation laws. More precisely, the author proves the global existence and uniqueness of the piecewise C¹ solution u=u(t,x) of a class of generalized Riemann problem, which can be regarded as a perturbation of the corresponding Riemann problem, for the quasilinear hyperbolic system of conservation laws; moreover, this solution has a global structure similar to that of the solution . Combining the results in Kong (Global structure instability of Riemann solutions of quasilinear hyperbolic systems of conservation laws: rarefaction waves, to appear), the author proves that the Lax's Riemann solution of general n×n quasilinear hyperbolic system of conservation laws is globally structurally stable if and only if it contains only non-degenerate shocks and contact discontinuities, but no rarefaction waves and other weak discontinuities.     

Global solutions and blow-up phenomena to a shallow water equation

A nonlinear shallow water equation, which includes the famous Camassa-Holm (CH) and Degasperis-Procesi (DP) equations as special cases, is investigated. The local well-posedness of solutions for the nonlinear equation in the Sobolev space Hs(R) with is developed. Provided that does not change sign, u₀∈Hs () and u₀∈L¹(R), the existence and uniqueness of the global solutions to the equation are shown to be true in u(t,x)∈C([0,∞);Hs(R))∩C¹([0,∞);Hs−1(R)). Conditions that lead to the development of singularities in finite time for the solutions are also acquired.     

On the Szeged and the Laplacian Szeged spectrum of a graph

For a given graph G its Szeged weighting is defined by w(e)=n_u(e)n_v(e), where e=uv is an edge of G,n_u(e) is the number of vertices of G closer to u than to v, and n_v(e) is defined analogously. The adjacency matrix of a graph weighted in this way is called its Szeged matrix. In this paper we determine the spectra of Szeged matrices and their Laplacians for several families of graphs. We also present sharp upper and lower bounds on the eigenvalues of Szeged matrices of graphs.