论文部分内容阅读
如果一个图存在定向满足其最大出度△+不超过最大度△的一半，则通过估计图的半边路径(semi-edge walk)的个数，得到了该图的无符号拉普拉斯谱半径的一个新上界.进而根据D.Gon(c)alves对平面图边分解的结果，得到了平面图无符号拉普拉斯谱半径的一个新上界.
无符号拉普拉斯谱半径的新上界
【摘 要】
：
如果一个图存在定向满足其最大出度△+不超过最大度△的一半，则通过估计图的半边路径(semi-edge walk)的个数，得到了该图的无符号拉普拉斯谱半径的一个新上界.进而根据D.Go
【出 处】
：
第五届全国组合数学与图论大会
【发表日期】
：
2012年7期
其他文献
Mechanism of wrinkle formation in chemical vapor deposited graphene and tuning its morphology by sub
会议
On the evolution of a heavy-gas cylinder accelerated by a cylindrical converging shock wave effect o
会议
For every undirected graph, Tutte [3] defined a polynomial TG(x;y) in two variables which plays an important role in graph theory.Now this polynomial is cal
会议
There are two kinds of perfect t-deletion-correcting codes of length k over an alphabet of size v, those where the coordinates may be equal and those where
会议
In this talk I report some results on the graphs with a unique perfect matching.One of them is a strengthening of Kotzigs theorem, which says that if a conn
会议
Let Tn(d) be the set of all trees with n vertices, diameter d and perfect matchings.We will show that the Laplacian energy of any tree in Tn(d), where d =4,
Depicting the automorphism group of any graph is the worlds problem, so it is necessary to depict special graphs.The article determined the automorphism gro
会议
Let Gσbe a weighted oriented graph with skew adjacency matrix S(Gσ).For an n × n real skew symmetric matrix S, the weighted oriented graph as-sociated to
For a graph G and two positive integers j and k, an m-L(j, k)-edge-labeling of G is an assignment on the edges to the set {0, 1, 2,..., m}, such that adjace