The laplacian spectral radius of a class of bipartite graphs

Authors

  • Xuezhong, Tan
  • Liu, Bolian

Abstract

The Laplacian spectral radius of a graph G is defined to be the greatest eigenvalue of the Laplacian matrix of G. Let B(n, n - k) be the class of graphs of bipartite graphs of order n with n - k pendant vertices. In this paper, the graphs with maximal Laplacian spectral radius in B(n, n - k) are determined. MSC: 05C50.

Published

2012-09-09

How to Cite

Xuezhong, Tan, & Liu, Bolian. (2012). The laplacian spectral radius of a class of bipartite graphs. Utilitas Mathematica, 89. Retrieved from https://utilitasmathematica.com/index.php/Index/article/view/845

Issue

Vol. 89 (2012): Volume 89, 2012

Section

Articles

Citation Check

Most read articles by the same author(s)

Obs.: This plugin requires at least one statistics/report plugin to be enabled. If your statistics plugins provide more than one metric then please also select a main metric on the admin's site settings page and/or on the journal manager's settings pages.