•  
  •  
 

Keywords

Laplacian matrix, Weighted directed graph, First eigenvalue, First eigenvector

Abstract

The class of nonsingular connected weighted directed graphs with an unweighted undirected branch is considered in this article. This paper investigates the monotonicity properties of the first eigenvector of such graphs along certain paths. The paper describes how the first eigenvalue of such graphs changes under some perturbation. It is shown that replacing a branch which is a tree by a path on the same number of vertices will not increase the first eigenvalue, while replacing the tree by a star on the same number of vertices will not decrease the first eigenvalue. As an application the paper characterizes the graphs minimizing the first eigenvalue over certain classes of such graphs.

abs_vol30_pp227-242.pdf (21 kB)
Abstract

Share

COinS
 

To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.