"Upper bounds for the k-subdomination number of graphs."

Liying Kang et al. (2002)

> Home

Details and statistics

DOI: 10.1016/S0012-365X(01)00311-9

access: open

type: Journal Article

metadata version: 2021-02-12

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dm/KangDCS02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/KangDCS02
Liying Kang, Chuangyin Dang, Mao-cheng Cai, Erfang Shan:
Upper bounds for the k-subdomination number of graphs. Discret. Math. 247(1-3): 229-234 (2002)

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.