Maximizing Laplacian spectral radius over trees with fixed diameter

被引：2

作者：

Lal, A. K. ^{[1
]}

Patra, K. L. ^{[1
]}

机构：

[1] Indian Inst Technol, Dept Math & Stat, Kanpur 208016, Uttar Pradesh, India

来源：

LINEAR & MULTILINEAR ALGEBRA | 2007年 / 55卷 / 05期

关键词：

bipartite graph; tree; Laplacian spectral radius; diameter; center points;

D O I：

10.1080/03081080600618738

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

In this article, we consider the following problem: Of all trees on n vertices with diameter d ( both fixed) which tree achieves the maximal Laplacian spectral radius? We show that the maximal Laplacian spectral radius is obtained uniquely at Q(n)(c),d, where Q(n)(c),d is a tree obtained by taking a path P on d + 1 vertices and adding n - d - 1 pendant vertices to a center point of P.

引用

页码：457 / 461

页数：5