The graphs which maximize and minimize respectively the largest eigenvalue over all unicyclic mixed graphs U on n vertices are determined. The unicyclic mixed graphs U with the largest eigenvalue λ 1(U)=n or λ 1(U...The graphs which maximize and minimize respectively the largest eigenvalue over all unicyclic mixed graphs U on n vertices are determined. The unicyclic mixed graphs U with the largest eigenvalue λ 1(U)=n or λ 1(U)∈(n,n+1] are characterized.展开更多
基金Supported by the project item for young teachers of colleges and universities of Anhui province( 2 0 0 3jq1 0 1 ) and the project item of Anhui University for talents group construction
文摘The graphs which maximize and minimize respectively the largest eigenvalue over all unicyclic mixed graphs U on n vertices are determined. The unicyclic mixed graphs U with the largest eigenvalue λ 1(U)=n or λ 1(U)∈(n,n+1] are characterized.