# bandwidth

##### Compute bandwidth for an undirected graph

Compute bandwidth for an undirected graph

- Keywords
- models

##### Usage

`bandwidth(g)`

##### Arguments

- g
- an instance of the
`graph`

class with`edgemode`

“undirected”

##### Details

The bandwidth of an undirected graph G=(V, E) is the maximum distance between two adjacent vertices. See documentation on bandwidth in Boost Graph Library for more details.

##### Value

- bandwidth
- the bandwidth of the given graph

##### References

Boost Graph Library ( www.boost.org/libs/graph/doc/index.html )

The Boost Graph Library: User Guide and Reference Manual; by Jeremy G. Siek, Lie-Quan Lee, and Andrew Lumsdaine; (Addison-Wesley, Pearson Education Inc., 2002), xxiv+321pp. ISBN 0-201-72914-8

##### Examples

```
con <- file(system.file("XML/dijkex.gxl",package="RBGL"), open="r")
coex <- fromGXL(con)
close(con)
coex <- ugraph(coex)
bandwidth(coex)
```

*Documentation reproduced from package RBGL, version 1.48.1, License: Artistic-2.0*

### Community examples

Looks like there are no examples yet.