当匹配数很小时具有最小拉普拉斯谱半径的树(Trees with small matching number and minimum Laplacian spectral radius)
考虑了具有最小拉普拉斯谱半径的树的问题.并确定了当匹配数很小时具有最小拉普拉斯谱半径的树.
Main Authors: | LINXi-qin(林西芹), FENGLi-hua(冯立华), YUGui-hai(于桂海) |
---|---|
Format: | Article |
Language: | zho |
Published: |
Zhejiang University Press
2013-09-01
|
Series: | Zhejiang Daxue xuebao. Lixue ban |
Subjects: | |
Online Access: | https://doi.org/10.3785/j.issn.1008-9497.2013.05.003 |
Similar Items
-
A new skew Laplace distribution(一种非对称拉普拉斯分布)
by: ZHANGGuofen(张帼奋), et al.
Published: (2014-11-01) -
具有禁用子图的图的(全)符号控制数(The (total) signed domination number of graphs with forbidden subgraphs)
by: LINXi-qin(林西芹)
Published: (2012-01-01) -
Review of "Lajiyu Yanjiu 拉基语研究"
by: Edmondson, Jerold A.
Published: (2024) -
The Minimax-regret spanning tree problem(最小最大后悔支撑树问题)
by: LIBang-yi(李帮义), et al.
Published: (2001-05-01) -
拉曼泵浦光源退偏技术研究
by: 罗勇, et al.
Published: (2006-01-01)