arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1209.2528math.CO
收藏

具有$k$割边的图的谱矩

On the spectral moment of graphs with $k$ cut edges

Shuchao Li, Huihui Zhang

摘要:

设$A(G)$是图$G$与$λ_{1}(G)$,$λ_{2}(G)$,.的邻接矩阵,$λ_{n}(G)$是其非递增阶的特征值。将数字$S_k(G):=\sum_{i=1}^{n}λ_{i}^k(G) (k=0,1,...,n-1)$称为$G$的第$k$次谱矩。令$S(G)=(S_0(G),S_1(G),...,S_{n-1}(G))$为$G$的谱矩序列。对于两个图$G_1$和$G_2$,如果$S_i(G_1)=S_i(G_2) (i=0,1,...,k-1)$有$G_1\prec_sG_2$,对于某些$k\in {1,2,...,n-1}$有$S_k(G_1)<S_k(G_2)$。用$\mathscr{G}_n^k$表示具有$k$割边的连通$n$ -顶点图的集合.在本文中,我们确定的第一,第二,最后和倒数第二个图,在$S$ -顺序,在$\mathscr{G}_n^k$,分别。

英文摘要:

Let $A(G)$ be the adjacency matrix of a graph $G$ with $λ_{1}(G)$, $λ_{2}(G)$, ..., $λ_{n}(G)$ being its eigenvalues in non-increasing order. Call the number $S_k(G):=\sum_{i=1}^{n}λ_{i}^k(G) (k=0,1,...,n-1)$ the $k$th spectral moment of $G$. Let $S(G)=(S_0(G),S_1(G),...,S_{n-1}(G))$ be the sequence of spectral moments of $G$. For two graphs $G_1$ and $G_2$, we have $G_1\prec_sG_2$ if $S_i(G_1)=S_i(G_2) (i=0,1,...,k-1)$ and $S_k(G_1)<S_k(G_2)$ for some $k\in {1,2,...,n-1}$. Denote by $\mathscr{G}_n^k$ the set of connected $n$-vertex graphs with $k$ cut edges. In this paper, we determine the first, the second, the last and the second last graphs, in an $S$-order, among $\mathscr{G}_n^k$, respectively.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑