若干图的点强全着色

图G(V,E)的一正常k-全着色σ称为G(V,E)的一个k-点强全着色,当且仅当v∈V(G),N[v]中的元素着不同颜色,其中N[v]={u|vu∈E(G)}∪{v}.并且vχsT(G)=min{k|存在G的一个k-点强全着色}称为G(V,E)的点强全色数.本文得到了一些特殊图的点强全色数χvTs(G),并提出猜想:对于简单图G,有k(G)≤χvTs(G)≤k(G)+1,这里k(G)表示图G中所有顶点间距离不超过2的点集的最大顶点数.     

几类图的调和着色数的估计

引言设 V(G),E(G)分别表示无向单纯图 G 的顶点集和边集.称 V(G)到集{1,2,…,k}上的映射 f 为 G 的一个 k-着色.如果 u、v 是边 e 的两个端点,称 f(e)={f(u),f(v)}是 e 的色对.如果在 G 的一个着色中,相邻的点有不同的色,不同的边有不同的色对,则称此着色是调和的.使 G 能有 k-调和着色的最小整数 k 被称为 G 的调和着色数,记作 h(G).     

2-控制数和连通2-控制数相等的图(英文)

任意一个图G =(V ,E) ,S是V(G)的子集 ,如果对每一个顶点u∈V-S都存在顶点v∈S ,使得d(u ,v) ≤ 2 ,则称S为G的一个 2 控制 .称最小的 2 控制集的顶点个数为G的 2 控制数 ,记为γ2 (G) .如果G的一个 2 控制集S的生成子集〈S〉是一个连通图 ,则称S为G的一个连通 2 控制集 .称最小的连通 2 控制集的顶点个数为G的连通 2 控制数 ,记为γc2 (G) .本文论述了树和单圈图中 2 控制数和连通 2 控制数相等的充分必要条件 .     

独立集的度和与图的哈密尔顿性

关于哈密尔顿连通图的一个基本结果是Ore给出的：设G是n阶图,若对于任意两个不相邻顶点u和v,有d(u) d(v)≥n 1,则G是哈密尔顿连通的．设G是一个图,对于任意u (?)V(G),令N(U)=∪_(u∈∪)N(u),d(U)=|N(U)|,称d(U)是U的度．本文利用独立集的度和得到如下结果：设s和t是正整数,G是(2s 2t 1)-连通n阶图．若对于任两个强不交独立集S,T,|S|=s,|T|=t,有d(S) d(T)≥n 1．则G是哈密尔顿连通的．同时也得到图的哈密尔顿性的其它相关结果．两个独立集S和T称为强不交的,如果S∪T也是独立集．     

图的下测地数和上测地数

对于图G(或有向图D)内的任意两点u和v,u—v测地线是指在u和v之间(或从u到v)的最短路．I(u,v)表示位于u—v测地线上所有点的集合,对于S(?)V(G)(或V(D)),I(S)表示所有I(u,v)的并,这里u,v∈S．G(或D)的测地数g(G)(或g(D))是使I(S)=V(G)(或I(S)=V(D))的点集S的最小基数．G的下测地数g~-(G)=min{g(D)：D是G的定向图},G的上测地数g~ (G)=max{g(D)：D是G的定向图}．对于u∈V(G)和v∈V(H),G_u H_v表示在u和v之间加一条边所得的图．本文主要研究图G_u H_v的测地数和上(下)测地数．     

图K_(3,4)∨K_t的点可区别正常边染色

设f是图G的一个正常边染色.对任意x∈V(G),令S(x)表示与点x相关联的边的颜色所构成的集合.若对任意u,v∈V(G),u≠v,有S(u)≠S(v),则称f是图G的一个点可区别正常边染色.对一个图G进行点可区别正常边染色所需的最少的颜色的数目称为G的点可区别正常边色数,记为χ_s'(G).讨论了图K_(3,4)∨K_t的点可区别正常边染色及其色数,利用正多边形的对称性构造染色以及组合分析的方法,确定了图K_(3,4)∨K_t的点可区别正常边色数,得到了当t是大于等于2的偶数以及t是奇数且3≤t≤25时,χ_s'(K_(3,4)∨K_t)=t+7;当t是奇数且t≥27时,χ_s'(K_(3,4)∨K_t)=t+8.     

星和轮的Mycielski图的[r,s,t]色数

给定非负整数r,s和t,若图G(V,E)有一个映射σ:V∪E→{0,1,…,k-1},k∈N,满足对V中相邻的点v_i,v_j有|σ(v_i)-σ(v_j)|≥r;对E中相邻的边e_i,e_j有|σ(e_i)-σ(e_j)|≥s;对V∪E中相关联的点v_i和边e_j有|σ(v_i)-σ(e_j)|≥t,则称σ为G的一个[r,s,t]-着色.使得图G存在使用了k种颜色的[r,s,t]-着色的最小整数k称为G的[r,s,t]-色数.研究星和轮的Mycielski图的[r,s,t]-着色,并给出其在一定条件下的[r,s,t]-色数.     

广义de Bruijn和Kautz有向图的双向控制集

设G=(V,A)是一个有向图,其中V和A分别表示有向图G的点集和弧集.对集合TV(G),如果对于任意点v∈V(G)\T,都存在点u,w∈T(u,w可能是同一点)使得(u,v),(v,w)∈A(G),则称T是G的一个双向控制集.有向图G的双向控制数γ~*(G)是G的最小双向控制集所含点的数目.提出了广义de Bruijn和Kautz有向图的双向控制数的新上界,改进了以前文献中提出的相关结论.此外,对某些特殊的广义de Bruijn和Kautz有向图,通过构造其双向控制集,进一步改进了它们双向控制数的上、下界.     

一个定理的简单证明

本文对文献[1]的部分结论给出了一个很简单的证明。本文讨论的图是无向简单图。用d_G(v)或者d(v)表示图G中顶点v的次或度。用G[U]表示点集U的导出子图。其余符号见[2]。设G是一个图,|V(G)|=p,若k是给定的非负整数,若对图G中每一对不相邻的顶点u和v,都有d(u) d(v)≥p k,则称图G为Ore-k型图。     

含临界指数的拟线性椭圆系统正对称解的存在性（英文）

本文讨论一类拟线性椭圆型系统-Δpu=μ|u|p-2 u|x|p+2αQ(x)(α+β)|x|s|u|α-2 u|v|β+σ1|u|q1-2 u,x∈Ω,-Δpv=μ|v|p-2v|x|p+2βQ(x)(α+β)|x|s|u|α|v|β-2v+σ2|v|q2-2v,x∈Ω,u=v=0,x∈Ω,其中Δpu=div(|▽u|p-2▽u)是p-Laplacian,2≤pN,ΩRN是一个有界光滑区域,0∈Ω,且Ω关于O(N)的一个闭子群G对称,0≤μ,=((N-p)/p)p,σ1,σ2≥0,0≤sp,α,β1满足α+β=p*(s)=(N-s)p/(N-p),pq1,q2p*=Np/(N-p),Q(x)是Ω上的连续G对称函数.应用Palais对称临界原理和变分方法,我们建立了该系统几个全新的正G-对称解的存在性结果.     

Application of a composition of generating functions for obtaining explicit formulas of polynomials

Using notions of composita and composition of generating functions, we obtain explicit formulas for the Chebyshev polynomials, the Legendre polynomials, the Gegenbauer polynomials, the Associated Laguerre polynomials, the Stirling polynomials, the Abel polynomials, the Bernoulli Polynomials of the Second Kind, the Generalized Bernoulli polynomials, the Euler Polynomials, the Peters polynomials, and the Narumi polynomials.     

Upward Extension of the Jacobi Matrix for Orthogonal Polynomials

Orthogonal polynomials on the real line always satisfy a three-term recurrence relation. The recurrence coefficients determine a tridiagonal semi-infinite matrix (Jacobi matrix) which uniquely characterizes the orthogonal polynomials. We investigate new orthogonal polynomials by adding to the Jacobi matrixrnew rows and columns, so that the original Jacobi matrix is shifted downward. Thernew rows and columns contain 2rnew parameters and the newly obtained orthogonal polynomials thus correspond to an upward extension of the Jacobi matrix. We give an explicit expression of the new orthogonal polynomials in terms of the original orthogonal polynomials, their associated polynomials, and the 2rnew parameters, and we give a fourth order differential equation for these new polynomials when the original orthogonal polynomials are classical. Furthermore we show how the 1?orthogonalizing measure for these new orthogonal polynomials can be obtained and work out the details for a one-parameter family of Jacobi polynomials for which the associated polynomials are again Jacobi polynomials.     

Eulerian pairs and Eulerian recurrence systems

In this paper, we introduce the definitions of Eulerian pair and Hermite-Biehler pair. We also characterize a duality relation between Eulerian recurrences and Eulerian recurrence systems. This generalizes and unifies Hermite-Biehler decompositions of several enumerative polynomials, including up-down run polynomials for symmetric groups, alternating run polynomials for hyperoctahedral groups, flag descent polynomials for hyperoctahedral groups and flag ascent-plateau polynomials for Stirling permutations. We derive some properties of associated polynomials. In particular, we prove the alternatingly increasing property and the interlacing property of the ascent-plateau and left ascent-plateau polynomials for Stirling permutations.     

四元数体上两类多项式的零点

本文研究四元数体 Q上多项式的零点 ,特别对于其中两类多项式——系数两两可换的多项式和二次多项式建立了系统而完善的零点理论 .     

Matrix Pearson Equations Satisfied by Koornwinder Weights in Two Variables

We consider Koornwinder’s method for constructing orthogonal polynomials in two variables from orthogonal polynomials in one variable. If semiclassical orthogonal polynomials in one variable are used, then Koornwinder’s construction generates semiclassical orthogonal polynomials in two variables. We consider two methods for deducing matrix Pearson equations for weight functions associated with these polynomials, and consequently, we deduce the second order linear partial differential operators for classical Koornwinder polynomials.     

A new class of polynomials associated with Bernstein and beta polynomials

The purpose of this paper is to define a new class polynomials. Special cases of these polynomials give many famous family of the Bernstein type polynomials and beta polynomials. We also construct generating functions for these polynomials. We investigate some fundamental properties of these functions and polynomials. Using functional equations and generating functions, we derive various identities related to theses polynomials. We also construct interpolation function that interpolates these polynomials at negative integers. Finally, we give a matrix representations of these polynomials. Copyright © 2013 John Wiley & Sons, Ltd.     

Difference equations for discrete classical multiple orthogonal polynomials

For discrete multiple orthogonal polynomials such as the multiple Charlier polynomials, the multiple Meixner polynomials, and the multiple Hahn polynomials, we first find a lowering operator and then give a (r+1)th order difference equation by combining the lowering operator with the raising operator. As a corollary, explicit third order difference equations for discrete multiple orthogonal polynomials are given, which was already proved by Van Assche for the multiple Charlier polynomials and the multiple Meixner polynomials.     

σ-polynomials and graph coloring

A new class of graph polynomials is defined. Tight bounds on the coefficients of the polynomials are given, and the exact polynomials for several classes of graphs are derived. The relationship of these polynomials to chromatic polynomials and graph coloring is discussed.     

On the log-convexity of combinatorial sequences

We give new sufficient conditions for a sequence of polynomials to have only real zeros based on the method of interlacing zeros. As applications we derive several well-known facts, including the reality of zeros of orthogonal polynomials, matching polynomials, Narayana polynomials and Eulerian polynomials. We also settle certain conjectures of Stahl on genus polynomials by proving them for certain classes of graphs, while showing that they are false in general.     

Elliptic solutions of the Toda chain and a generalization of the Stieltjes–Carlitz polynomials

We construct new elliptic solutions of the restricted Toda chain. These solutions give rise to a new explicit class of orthogonal polynomials, which can be considered as a generalization of the Stieltjes–Carlitz elliptic polynomials. Relations between characteristic (i.e., positive definite) functions, Toda chain, and orthogonal polynomials are developed in order to derive the main properties of these polynomials. Explicit expressions are found for the recurrence coefficients and the weight function for these polynomials. In the degenerate cases of the elliptic functions, the modified Meixner polynomials and the Krall–Laguerre polynomials appear.