Author(s):
1. Kun Wei:
School of Mathematics and Statistics, Guangdong University of Technology,Guangzhou,P. R. China
2. Jianping Li:
School of Mathematics and Statistics, Guangdong University of Technology,Guangzhou,P. R. China
Abstract:
Let D be a digraph with n vertices and let 1(D); 2(D); : : : ; n(D) be the singular values of the adjacency matrix of D, where 1(D) 2(D) n(D). The spectral norm of D is 1(D). In this paper, we determine the orientations of graphs with the first three largest values of the spectral norm over the family of all orientations of bicyclic graphs with at least 12 vertices..
Page(s):
93-97
Published:
Journal: Discrete Mathematics Letters, Volume: 12, Issue: 0, Year: 2023
Keywords:
oriented graph
,
spectral radius
,
spectral norm
References:
References are not available for this document.
Citations
Citations are not available for this document.