"Lollipop graphs are extremal for commute times."

Johan Jonasson (2000)

> Home

Details and statistics

DOI: 10.1002/(SICI)1098-2418(200003)16:2<131::AID-RSA1>3.0.CO;2-3

access: closed

type: Journal Article

metadata version: 2017-05-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/rsa/Jonasson00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/rsa/Jonasson00
Johan Jonasson:
Lollipop graphs are extremal for commute times. Random Struct. Algorithms 16(2): 131-142 (2000)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.