Recurrence among trees with most numerous efficient dominating sets

Dorota Bród, Zdzisław Skupień

Open source

DOI
10.46298/dmtcs.445
Published
1
Container
Discrete Mathematics & Theoretical Computer Science
Publisher
Not recorded
Open access
yes

Credibility signals

uncertain Score 53/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.

Show all credibility signals

Cite this work

BibTeX

@article{allodium:10.46298/dmtcs.445,
  title = {Recurrence among trees with most numerous efficient dominating sets},
  author = {Dorota Bród and Zdzisław Skupień},
  year = {2008},
  journal = {Discrete Mathematics \& Theoretical Computer Science},
  doi = {10.46298/dmtcs.445},
  url = {https://doi.org/10.46298/dmtcs.445}
}

RIS

TY  - JOUR
TI  - Recurrence among trees with most numerous efficient dominating sets
AU  - Dorota Bród
AU  - Zdzisław Skupień
PY  - 2008
JO  - Discrete Mathematics & Theoretical Computer Science
DO  - 10.46298/dmtcs.445
UR  - https://doi.org/10.46298/dmtcs.445
ER  - 

APA

Bród, D., & Skupień, Z. (2008). Recurrence among trees with most numerous efficient dominating sets. Discrete Mathematics & Theoretical Computer Science. https://doi.org/10.46298/dmtcs.445

Source records