不含某些子图的k连通图中的k可收缩边

最近Ando等证明了在一个$k$($k\geq 5$ 是一个整数) 连通图 $G$ 中,如果 $\delta(G)\geq k+1$, 并且 $G$ 中既不含 $K^{-}_{5}$,也不含 $5K_{1}+P_{3}$, 则$G$ 中含有一条 $k$ 可收缩边.对此进行了推广,证明了在一个$k$连通图$G$中,如果 $\delta(G)\geq k+1$,并且 $G$ 中既不含$K_{2}+(\lfloor\frac{k-1}{2}\rfloor K_{1}\cup P_{3})$,也不含 $tK_{1}+P_{3}$ ($k,t$都是整数,且$t\geq 3$),则当 $k\geq 4t-7$ 时, $G$ 中含有一条 $k$ 可收缩边.     

W6*Sn的交叉数

早在20世纪50年代,Zarankiewicz 猜想完全2-部图K_{m,n}(m\leq n)的交叉数为\lfloor\frac{m}{2}\rfloor\times \lfloor\frac{m-1}{2}\rfloor\times\lfloor\frac{n}{2}\rfloor\times\lfloor\frac{n-1}{2}\rfloor (对任意实数x,\lfloor x\rfloor表示不超过x的最大整数). 目前这一猜想的正确性只证明了当m\leq6时成立. 假定著名的Zarankiewicz的猜想对m=7的情形成立,确定了6-轮W_{6}与星S_{n}的笛卡尔积图的交叉是 cr(W_{6}\times S_{n})=9\lfloor\frac{n}{2}\rfloor\times\lfloor\frac{n-1}{2}\rfloor+2n+5\lfloor\frac{n}{2}\rfloor.     

K2,4×Sn的交叉数

Garey和Johnson证明了确定图的交叉数是一个NP-完全问题.确定了笛卡尔积图$K_{2,4}\times S_{n}$的交叉数是$Z(6,n)+4n.$ 当$m\geq 5,$猜想${\rm cr}(K_{2,m}\timesS_{n})={\rm cr}(K_{2,m,n})+n\lfloor\frac{m}{2}\rfloor\lfloor\frac{m-1}{2}\rfloor$.     

ON THE CROSSING NUMBER OF THE COMPLETE TRIPARTITE GRAPH K1,8,n

The well known Zarankiewicz' conjecture is said that the crossing number of the complete bipartite graph K_m,n (m≤ n) is Z(m,n), where Z(m,n)=\lfloor\frac{m}{2}\rfloor\lfloor\frac{m-1}{2}\rfloor\lfloor\frac{n}{2}\rfloor$\lfloor\frac{n-1}{2}\rfloor$ (for any real number x, $\lfloor x\rfloor$ denotes the maximal integer no more than x). Presently, Zarankiewicz' conjecture is proved true only for the case m≤ 6. In this article, the authors prove that if Zarankiewicz' conjecture holds for m≤9, then the crossing number of the complete tripartite graph K_1,8,n is $Z(9, n)+ 12\lfloor\frac{n}{2}\rfloor$.     

$K_{5}\times S_{n}$ 的交叉数

把完全图$K_{5}$的五个顶点与另外$n$个顶点都联边得到一类特殊的图$H_{n}$.文中证明了$H_{n}$的交叉数为$Z(5,n)+2n+\lfloor \frac{n}{2}\rfloor+1$,并在此基础上证明了$K_{5}$与星$K_{1,n}$的笛卡尔积的交叉数为$Z(5,n)+5n+\lfloor\frac{n}{2} \rfloor+1$.     

第二大特征值小于$\frac{\sqrt{5}-1}{2}$的平面图

若能将图$G$画在一个平面上,使得任何两条边仅在顶点处相交,则称$G$是平面图.本文刻画了第二大特征值小于$\frac{\sqrt{5}-1}{2}$的所有无孤立点的平面图.     

对谱半径至多为$\sqrt[r]{2+\sqrt{5}}$的超图的分类研究

在本文,我们研究谱半径至多为$\sqrt[r]{2+\sqrt{5}}$的超图.我们得到此种超图必须具有一个基普结构,这与Woo-Neumaier在2007年对谱半径至多为$\frac{3}{2}\sqrt{2}$的图的分类结果类似.     

Clifford 环面 Sm(\sqrt{\frac{m}{n}})×Sn-m(\sqrt{\frac{n-m}{n}})的刚性定理

\small\zihao{-5}\begin{quote}{\heiti 摘要:} 设$M$为$n+1$维单位球面$S^{n+1}(1)$中的一个极小闭超曲面，如果 $ n \le S \le n+\frac{2}{3}$, 则有 $S=n$ 且 $M$ 与某一Clifford 环面 $S^m(\sqrt{m/n}) \times S^{n-m}(\sqrt{(n-m)/n})$等距.     

一类具有奇异灵敏度的logistic趋化系统解的渐近行为

本文在无边界流的光滑有界区域$\Omega\subset\mathbb{R}^n~(n>2)$上研究了具有奇异灵敏度及logistic源的抛物-椭圆趋化系统$$\left\{\begin{array}{ll}u_t=\Delta u-\chi\nabla\cdot(\frac{u}{v}\nabla v)+r u-\mu u^k,&x\in\Omega,\,t>0,\\ 0=\Delta v-v+u,&x\in\Omega,\,t>0\end{array}\right.$$ 其中$\chi$, $r$, $\mu>0$, $k\geq2$. 证明了若当$r$适当大, 则当$t\rightarrow\infty$时该趋化系统全局有界解呈指数收敛于$((\frac{r}{\mu})^{\frac{1}{k-1}}, (\frac{r}{\mu})^{\frac{1}{k-1}})$.     

图的p-Sombor(拉普拉斯)矩阵的谱性质

最近在化学图论引入的Sombor指数可以预测分子的物理化学性质. 本文从代数的角度来研究($p$-)Sombor指数的性质. $p$-Sombor矩阵$\mathcal{S}_{p}(G)$是一个$n$阶方阵, 当$v_{i}\sim v_{j}$时, 其$(i,j)$位置的元素为$((d_{i})^{p}+(d_{j})^{p})^{\frac{1}{p}}$, 否则为$0$, 其中$d_{i}$表示图$G$中顶点$v_{i}$的度. 该矩阵推广了著名的Zagreb矩阵$(p=1)$、Sombor矩阵$(p=2)$和inverse sum indeg矩阵$(p=-1)$. 本文找到了一对$p$-Sombor非同谱的等能量图, 并确定了$p$-Sombor(拉普拉斯)谱半径的一些界. 然后刻画了具有$k$个不同$p$-Sombor拉普拉斯特征值的连通图的性质. 最后确定了一些特殊图的Sombor谱. 作为推论, 确定了Sombor矩阵$(p=2)$, Zagreb矩阵$(p=1)$和inverse sum indeg矩阵$(p=-1)$的谱性质.     

给定直径的单圈图的超Wiener指数

The hyper-Wiener index is a kind of extension of the Wiener index, used for predicting physicochemical properties of organic compounds. The hyper-Wiener index W W(G) is defined as WW(G) =1/2∑_(u,v)∈V(G)(d_G(u, v) + d_G~2(u,v)) with the summation going over all pairs of vertices in G, d_G(u,v) denotes the distance of the two vertices u and v in the graph G. In this paper,we study the minimum hyper-Wiener indices among all the unicyclic graph with n vertices and diameter d, and characterize the corresponding extremal graphs.     

图的上可嵌入性与独立顶点的新度和

Let G be a k(k ≤3)-edge connected simple graph with minimal degree ≥ 3,girth g,r=g12.For any independent set {a1,a2 , . . . , a 6/(4 k)} of G,if,then G is up-embeddable.     

和图、整和图与模和图的几个结果

Let N denote the set of positive integers. The sum graph G^＋（S） of a finite subset S belong to N is the graph （S, E） with uv ∈ E if and only if u ＋ v ∈ S. A graph G is said to be a sum graph if it is isomorphic to the sum graph of some S belong to N. By using the set Z of all integers instead of N, we obtain the definition of the integral sum graph. A graph G = （V, E） is a mod sum graph if there exists a positive integer z and a labelling, λ, of the vertices of G with distinct elements from {0, 1, 2,..., z - 1} so that uv ∈ E if and only if the sum, modulo z, of the labels assigned to u and v is the label of a vertex of G. In this paper, we prove that flower tree is integral sum graph. We prove that Dutch m-wind-mill （Dm） is integral sum graph and mod sum graph, and give the sum number of Dm.     

图的无符号拉普拉斯和距离无符号拉普拉斯特征值

Let G be a simple graph. We first show that ■, where δiand di denote the i-th signless Laplacian eigenvalue and the i-th degree of vertex in G, respectively.Suppose G is a simple and connected graph, then some inequalities on the distance signless Laplacian eigenvalues are obtained by deleting some vertices and some edges from G. In addition, for the distance signless Laplacian spectral radius ρQ(G), we determine the extremal graphs with the minimum ρQ(G) among the trees with given diameter, the unicyclic and bicyclic graphs with given girth, respectively.     

定向图的斜Randic能量

图G是一个简单无向图,G~σ是图G在定向σ下的定向图,G被称作G~σ的基础图.定向图G~σ的斜Randi6矩阵是实对称n×n矩阵R_s(G~σ)=[(r_s)_(ij)].如果(v_i,v_j)是G~σ的弧,那么(r_s)_(ij)=(d_id_j)~(-1/2)且(r_s)_(ji)=(d_id_j)~(-1/2),否则(r_s)_(ij)=(r_s)_(ji)=0.定向图G~σ的斜Randi能量RE_s(G~σ)是指R_s(G~σ)的所有特征值的绝对值的和.首先刻画了定向图G~σ的斜Randi矩阵R_s(G~σ)的特征多项式的系数.然后给出了定向图G~σ的斜Randi能量RE_s(G~σ)的积分表达式.之后给出了RE_s(G~σ)的上界.最后计算了定向圈的斜Randi能量RE_s(G~σ).     

图的距离无符号拉普拉斯谱半径的关于色数的下界

Let G be a connected graph on n vertices with chromatic number k, and let ρ(G)be the distance signless Laplacian spectral radius of G. We show that ρ(G) ≥ 2n + 2「n k」- 4,with equality if and only if G is a regular Tur′an graph.     

完全图的Cantesian积的L(2,1)-圆标定

For positive integers j and k with j ≥ k, an L（j, k）-labeling of a graph G is an assignment of nonnegative integers to V（G） such that the difference between labels of adjacent vertices is at least j, and the difference between labels of vertices that are distance two apart is at least k. The span of an L（j, k）-labeling of a graph G is the difference between the maximum and minimum integers it uses. The λj, k-number of G is the minimum span taken over all L（j, k）-labelings of G. An m-（j, k）-circular labeling of a graph G is a function f ： V（G） →{0, 1, 2,..., m - 1} such that ｜f（u） - f（v）｜m ≥ j if u and v are adjacent; and ｜f（u） - f（v）｜m 〉 k ifu and v are at distance two, where ｜x｜m = min{｜xl｜, m-｜x｜}. The minimum integer m such that there exists an m-（j, k）-circular labeling of G is called the σj,k-number of G and is denoted by σj,k（G）. This paper determines the σ2,1-number of the Cartesian product of any three complete graphs.     

通过增强型萨格勒布指数对图排序

Recently, Furtula et al. proposed a valuable predictive index in the study of the heat of formation in octanes and heptanes, the augmented Zagreb index(AZI index) of a graph G, which is defined as AZI(G) =∑uv∈E(G)( d_u d_v/d_u + d_v-2)~3,where E(G) is the edge set of G, d u and d v are the degrees of the terminal vertices u and v of edge uv, respectively. In this paper, we obtain the first five largest(resp., the first two smallest) AZI indices of connected graphs with n vertices. Moreover, we determine the trees of order n with the first three smallest AZI indices, the unicyclic graphs of order n with the minimum, the second minimum AZI indices, and the bicyclic graphs of order n with the minimum AZI index, respectively.     

关于完全二部图$K_{4, n}$和$K_{n, n}$的点可区别 $IE$-全染色的一些注记

Let G be a simple graph.An IE-total coloring f of G refers to a coloring of the vertices and edges of G so that no two adjacent vertices receive the same color.Let C(u) be the set of colors of vertex u and edges incident to u under f.For an IE-total coloring f of G using k colors,if C(u)=C(v) for any two different vertices u and v of V(G),then f is called a k-vertex-distinguishing IE-total-coloring of G,or a k-VDIET coloring of G for short.The minimum number of colors required for a VDIET coloring of G is denoted by χ ie vt (G),and it is called the VDIET chromatic number of G.We will give VDIET chromatic numbers for complete bipartite graph K4,n (n≥4),K n,n (5≤ n ≤ 21) in this article.