树图的1—Hamilton连通性

一阶数≥3的简单连通图叫做1-Hamilton连通的,若对每一对顶点v_1、v_2及任一边v_2v_3(v_1≠v_3),存在连接v_1和v_2,并且经过v_3v_2的Hamilton路.本文中我们证明:连通图的树图或是1-Hamilton连通的,或为一超立方体,或同构于K_2×K_3和W_5之一.     

拟树图按第二大无符号拉普拉斯特征值排序

A connected graph G=(V,E) is called a quasi-tree graph if there exists a vertex v_0∈V(G) such that G-v_0 is a tree.In this paper,we determine all quasi-tree graphs of order n with the second largest signless Laplacian eigenvalue greater than or equal to n-3.As an application,we determine all quasi-tree graphs of order n with the sum of the two largest signless Laplacian eigenvalues greater than to 2 n-5/4.     

(邻接)树图的同构及平面性

树图是非常有用的一类图.本文刻画了(邻接)树图分别为Pn,Cn,Kn的图类并且讨论了(邻接)树图的平面性.     

谱半径前五位的$n$阶拟树图

A connected graph G =(V, E) is called a quasi-tree graph, if there exists a vertex v_0 ∈ V(G) such that G-v_0 is a tree. Liu and Lu [Linear Algebra Appl. 428(2008) 2708-2714] determined the maximal spectral radius together with the corresponding graph among all quasi-tree graphs on n vertices. In this paper, we extend their result, and determine the second to the fifth largest spectral radii together with the corresponding graphs among all quasi-tree graphs on n vertices.     

(ψψ)的树图近似

在树图近似下计算了任意维正规点阵的naive费米子凝聚,没有发现手征自发破缺.     

树图边色数的界

本文研究树图的边色数，确定了其上界与下界，并进而考虑界的精确性。     

有红利美式看跌期权定价树图模型的自适应性改进

本文基于支付固定红利美式看跌期权的三叉树图定价模型,对其进行了自适应性改进,从而解决了树图模型所存在的因为时间离散、状态不连续而产生的"非线性误差"问题.最后给出了实证分析,并与二叉树图和三叉树图进行了比较,结果表明进行自适应性改进后可以得到更加精确、有效的数值解.     

Oriented tree diagram Lie algebras and their abelian ideals

We introduce oriented tree diagram Lie algebras which are generalized from Xu＇s both upward and downward tree diagram Lie algebras, and study certain numerical invariants of these algebras related to abelian ideals.     

外平面图的对策色数

本讨论了图的色对策Ⅱ，给出了外平面图的几个性质，并且利用性质证明了外平面图的对策色数至多是6。