The maximum multiplicity of the largest k-th eigenvalue in a matrix whose graph is acyclic or unicyclic

Given a graph $G$ we are interested in studying the symmetric matrices associated to $G$ with a fixed number of negative eigenvalues. For this class of matrices we focus on the maximum possible nullity. For trees this parameter has already been studied and plenty of applications are known. In this work we derive a formula for the maximum nullity and completely describe its behavior as a function of the number of negative eigenvalues. In addition, we also carefully describe the matrices associated with trees that attain this maximum nullity. The analysis is then extended to the more general class of unicyclic graphs. Further our work is applied to re-describing all possible partial inertias associated with trees, and is employed to study an instance of the inverse eigenvalue problem for certain trees.     

The trigonometric triangle

A procedure is presented by which the integration of a function such as cos ⁿ (x) or sin ⁿ (x) with n = 1, 2, 3, 4 … is facilitated.     

具有较小秩的带号图的刻画

带号图是每条边带有符号（正或负）的简单图.探讨了带号图的秩，刻画了秩为2与3的带号图，以及秩为4的带号二部图.     

符号圈拼接图的零度

令$\eta(\Gamma)$和$c(\Gamma)$是符号图$\Gamma$的零度和基本圈数. 一个符号圈拼接图是指每个块都是圈的连通符号图. 本文证明了对任意符号拼接图$\eta(\Gamma)\le c(\Gamma)+1$成立, 并且刻画了等号成立的极图, 推广了王登银等人(2022)在简单圈拼接图上的结果. 此外, 我们证明了任意的符号拼接图$\eta(\Gamma)\neq c(\Gamma)$, 给出了满足$\eta(\Gamma)=c(\Gamma)-1$的符号拼接图的一些性质并刻画处$\eta(\Gamma)=c(\Gamma)-1$的二部符号拼接图.     

An Estimate of Inequality of Signature and Nullity for Links

ＡｎＥｓｔｉｍａｔｅｏｆＩｎｅｑｕａｌｉｔｙｏｆＳｉｇｎａｔｕｒｅａｎｄＮｕｌｌｉｔｙｆｏｒＬｉｎｋｓ￥ＬｉＱｉｓｈｅｎｇ（李起升）（Ｄｅｐｔ．ＯｆＭａｔｈ．ＨｅｎａｎＵｎｉｖｅｒｓｉｔｙ，Ｋａｉｆｅｎｇ４７５００１）Ａｂｓｔｒａｃｔ：Ａｎｉｎｅｑｕ...     

Matrix presentations of braids and applications

We show that there exists a one-to-one correspondence between the class of certain block tridiagonal matrices with the entries or and the free monoid generated by generators and relation and give some applications for braids. In particular, we give new formulation of the reduced Alexander matrices for closed braids.

     

Spectral properties of Pascal graphs

We obtain spectral properties of the Pascal graphs by exploring its spectral graph invariants such as the algebraic connectivity, the first three largest Laplacian eigenvalues and the nullity. Some open problems pertaining to the Pascal graphs are given.     

包含子图K_4的无割点次极大图的唯一性

研究次极大图(即链环分支数等于基圈数的连通平图)的唯一性.证明了无割点且包含子图K_4的连通平图G是次极大图当且仅当G同构于K_4,并刻画了包含子图K_4的次极大图的结构.     

秩$6$的无三角形的图

The rank of a graph G is defined to be the rank of its adjacency matrix A（G）. In this paper we characterize all connected triangle-free graphs with rank 6.