当匹配数很小时具有最小拉普拉斯谱半径的树(Trees with small matching number and minimum Laplacian spectral radius)

考虑了具有最小拉普拉斯谱半径的树的问题.并确定了当匹配数很小时具有最小拉普拉斯谱半径的树.

Bibliographic Details
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:	trees laplacian spectral radius matching number
Online Access:	https://doi.org/10.3785/j.issn.1008-9497.2013.05.003

Internet