2. 您的位置
3. 首页
4. 会议论文
5. The minimal Laplacian spectral radius of trees with given matching number

The minimal Laplacian spectral radius of trees with given matching number

来源 :第五届全国组合数学与图论大会 | 被引量 : 0次 | 上传用户：qq912214209

【摘 要】

：

　　Let Jn,β denote the set of trees on n vertices with fixed matching number β, where n =kβ + l(k ≥ 2).In this paper, the tree with minimal Laplacian radiu

【出 处】

：

第五届全国组合数学与图论大会

【发表日期】

：

2012年7期

下载到本地 , 更方便阅读

下载此文 赞助VIP

声明 : 本文档内容版权归属内容提供方 , 如果您对本文有版权争议 , 可与客服联系进行内容授权或下架

论文部分内容阅读

　　Let Jn,β denote the set of trees on n vertices with fixed matching number β, where n =kβ + l(k ≥ 2).In this paper, the tree with minimal Laplacian radius in the set Jn,β is determined.

其他文献

On graphs with a unique perfect matching

　　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

会议

On the Laplacian energy of trees with perfect matchings

　　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,

会议

Laplacian energytreeperfect matchings

The Automorphism Group of the Complete Expansion Graph of Kn

　　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

会议

Oriented graphs and skew symmetric matrices

　　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

会议

Oriented graphSkew adjacency matrixPfaffianHadamard matrix

On L(1, 2)-edge-labelings for graphs

　　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

会议

L(jk)-edge-labelingline graphinfinite r-regular treewheellattice

无符号拉普拉斯谱半径的新上界

　　如果一个图存在定向满足其最大出度△+不超过最大度△的一半，则通过估计图的半边路径(semi-edge walk)的个数，得到了该图的无符号拉普拉斯谱半径的一个新上界.进而根据D.Go

会议

Oscillating Rim Hook Tableaux and Colored Matchings

　　Based on the generalized Schensted algorithm due to White (Adv.Math.(1983)), in this report we present a one-to-one correspondence between oscillating m-rim

会议

Adjacent vertex distinguishing total coloring of planar graphs

　　An adjacent vertex distinguishing total coloring of a graph G , or avd-total coloring in short, is a proper total coloring of G such that any pair of adjace

会议

Nowhere-zero 3-flows in Cayley graphs on generalized dihedral group and generalized quaternion group

　　Tutte conjectured that every 4-edge-connected graph admits a nowhere-zero 3-flow.In this paper, we show that this conjecture is true for Cayley graphs on ge

会议

Approximation Algorithms for Two Variants of Multiple Knapsack Problem with Restricted Bipartite Gra

　　Given n items with different sizes si and profits pi, m knapsacks with different capacities cj and a restricted bipartite graph G =(S ∪ T, E), where each v

会议

multiple knapsack problemrestricted bipartite graphinapproximabilityapproxima