"How large can the domination numbers of a graph be?"

Gary Chartrand et al. (2000)

> Home

Details and statistics

DOI: —

access: open

type: Journal Article

metadata version: 2020-03-11

- view
  - electronic edition @ uq.edu.au (open access)
- export record
  dblp key:
  - journals/ajc/ChartrandEH000
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ajc/ChartrandEH000
Gary Chartrand, Linda Eroh, Frank Harary, Ping Zhang:
How large can the domination numbers of a graph be? Australas. J Comb. 21: 23-36 (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.