【摘 要】
：
In this talk,we give Brualdi-type eigenvalue inclusion sets of tensors by using associated digraphs of tensors,and discuss some properties of Z-eigenvalues
【机 构】
：
CollegeofScience,HarbinEngineeringUniversity,Harbin150001,P.R.China
【出 处】
：
第六届图论与组合算法国际研讨会(The 6th International Symposium on Graph The
论文部分内容阅读
In this talk,we give Brualdi-type eigenvalue inclusion sets of tensors by using associated digraphs of tensors,and discuss some properties of Z-eigenvalues of the Laplacian tensor of a uniform hypergraph.
其他文献
Outline 1 Introduction;2 New gradient method;3 Numerical experiments;4 Conclusion
The number of proper q-colorings of a graph G,i.e.,the chromatic polynomial PG(q),plays a fundamental role in graph theory and is also important to computat
本文研究了面向随机市场需求的中小企业供应链融资策略。当债权融资比例小于某临界值时，零售商采用外部融资的最优订购量大于内部融资，反之亦然；当市场需求分布函数大于某临界值
A coloring of a graph G =(V,E)is a partition {V1,V2,…,Vk} of V into independent sets or color classes.A vertex v∈Vi is a Grundy vertex if it is adjacent t
In this talk,I will introduce some results on enumeration of spanning trees of toroidal graphs.
In this talk,we will introduce a general algebraic technique(Combinatorial Nullstellensatz)and its applications in graph colorings.We also mention a probabi
分析了增广拉格朗日法乘子修正基本技术、交替方向法乘子修正技术分析、基于新的修正技术导出的几种乘子修正技术，可以深入探讨多分块优化问题ADMM的乘子修正优化技术。
For any integer m>0 and any real c,let f(m,c)=∑∞k=0(km+1)k-1cke-(km+1)c/k!.The identity f(m,/c=m)m=f(1,c)arises in the random graph theory.Here we present
Let n and k be two positive integers satisfying n≥2k.Let A be an intersecting family of(C)([n]k).
Graphs/digraphs of graph theory are naturally and vividly used to be models for understanding and simulating complex networks nowadays.We talk about some ph