Abstract
We obtain the lower and upper bounds on the largest eigenvalue of the distance matrix of a connected bipartite graph and characterize those graphs for which these bounds are best possible.
| Original language | English |
|---|---|
| Pages (from-to) | 667-672 |
| Number of pages | 6 |
| Journal | Match |
| Volume | 62 |
| Issue number | 3 |
| State | Published - 2009 |