On the spectral radius of (0,1)-matrices

R.A. Brualdi; A.J. Hoffman

doi:10.1016/0024-3795(85)90092-8

Linear Algebra and Its Applications

Paper

01 Jan 1985

On the spectral radius of (0,1)-matrices

View publication

Abstract

We determine the maximum spectral radius for (0,1)-matrices with k2 andk2+1 1's, respectively, and for symmetric (0,1)-matrices with zero trace and e= k 21's (graphs with e edges). In all cases, equality is characterized. © 1985.

Conference paper

A Single-Loop Gradient Descent and Perturbed Ascent Algorithm for Nonconvex Functional Constrained Optimization

Conference paper

Federated Nearest Neighbor Classification with a Colony of Fruit-Flies

Conference paper

An Approximation Algorithm for Minimizing the Cloud Carbon Footprint through Workload Scheduling

Talk

Nesterov Accelerated Shuffling Gradient Method for Convex Optimization

View all publications

Abstract

Related

A Single-Loop Gradient Descent and Perturbed Ascent Algorithm for Nonconvex Functional Constrained Optimization

Federated Nearest Neighbor Classification with a Colony of Fruit-Flies

An Approximation Algorithm for Minimizing the Cloud Carbon Footprint through Workload Scheduling

Nesterov Accelerated Shuffling Gradient Method for Convex Optimization