Eigenvalue Comparison Theorems of Neumann Laplacian for Graphs

スポンサーリンク

概要

• 論文の詳細を見る

• In this paper, the spectrum of the Neumann Laplacian for a graph with boundary is studied. Two comparison theorems of the Neumann Laplacian for a graph are shown. Namely, the optimal upper and lower bounds of the first eigenvalue of the Neumann boundary problem of the combinatorial Laplacian for a graph with boundary are given.

• 東北大学の論文

著者

• Tan Jinsong

  Graduate School Of Information Sciences Tohoku University

関連論文

• On Isospectral Graphs
• Eigenvalue Comparison Theorems of Neumann Laplacian for Graphs

スポンサーリンク