论文部分内容阅读
The graphs which maximize and minimize respectively the largest eigenvalue over allunicyclic mixed graphs U on n vertices are determined.The unicyclic mixed graphs U with thelargest eigenvalue λ1(U)=n or λ1(U)∈ (n,n+1] are characterized.