搜索筛选:
搜索耗时1.5624秒,为你在为你在102,285,761篇论文里面共找到 5 篇相符的论文内容
发布年度:
[会议论文] 作者：Tingzeng Wu,
来源：第六届图论与组合算法国际研讨会(The 6th International Symposium on Graph The 年份：2015
Let G be a graph,and let A(G)denote the adjacency matrix of G.The permanental polynomial of G is defined as π(G,x)=per(xI-A(G)).The permanental spectrum of...
[期刊论文] 作者：Tingzeng Wu,Huazhong Lü,
来源：应用数学(英文) 年份：2020
The eccentricity of a vertex in a graph is the maximum distance from the vertex to any other vertex. Two structure topological indices: eccentric connectivity i...
[期刊论文] 作者：Tingzeng Wu,Ying Wu,
来源：应用数学(英文) 年份：2018
The eccentric connectivity index and connective eccentricity index are important topological indices for chemistry. In this paper, we investigate the eccentric...
[期刊论文] 作者：Tingzeng Wu,Huazhong Lü,
来源：应用数学(英文) 年份：2017
Two nonisomorphic graphs G and H are said to be matching equivalent if and only if G and H have the same matching polynomials. In this paper, some families matc...
[期刊论文] 作者：Xiaolin Zeng,Tingzeng Wu,
来源：应用数学(英文) 年份：2021
The Lanzhou index of a graph G is defined as the sum of the product between and squa...
相关搜索：
