Combinatorica
Isoperimetric numbers of graphs
Journal of Combinatorial Theory Series B
The edge-forwarding index of orbital regular graphs
Discrete Mathematics
Hi-index | 0.06 |
For a connected graph G of order n ≥ 2 with positive Laplacian eigenvalues λ2,...,λn, let b(G) = n-1 1/λ2 + ... + 1/λn. In this note we derive bounds on some graph invariants (edge-density in cuts, isoperimetric number, mean distance, edge-forwarding index, edge connectivity, etc) in terms of b(G).