Workshop on Theory and Applications of Matrices Described by Patterns
会议时间：
JAN 31-FEB 05, 2010
会议地点：
Banff, CANADA
会议主办单位：
[Li, Shuchao;Zhang, Minjie] Cent China Normal Univ, Fac Math & Stat, Wuhan 430079, Peoples R China.^[Zhang, Minjie] Huangshi Inst Technol, Fac Math & Phys, Huangshi 435003, Peoples R China.
A connected graph G is a cactus if any two of its cycles have at most one common vertex. In this article, we determine graphs with the largest signless Laplacian index among all the cacti with n vertices and k pendant vertices. As a consequence, we determine the graph with the largest signless Laplacian index among all the cacti with n vertices;we also characterize the n-vertex cacti with a perfect matching having the largest signless La...
