Advanced search
1 file | 590.71 KB Add to list

Automated conjecturing VI : domination number of benzenoids

Author
Organization
Abstract
We demonstrate the use of a conjecturing program that can be a tool for researchers investigating bounds of invariants of chemical graphs by investigating upper bounds for the domination number of a benzenoid. The program is open-source, of general use, and can be used to generate conjectured bounds for any invariant of any class of chemical graphs.

Downloads

  • match80n3 821-834.pdf
    • full text
    • |
    • open access
    • |
    • PDF
    • |
    • 590.71 KB

Citation

Please use this url to cite or link to this publication:

MLA
Hutchinson, Laura, et al. “Automated Conjecturing VI : Domination Number of Benzenoids.” MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, vol. 80, no. 3, 2018, pp. 821–34.
APA
Hutchinson, L., Kamat, V., Larson, C. E., Mehta, S., Muncy, D., & Van Cleemput, N. (2018). Automated conjecturing VI : domination number of benzenoids. MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, 80(3), 821–834.
Chicago author-date
Hutchinson, Laura, Vikram Kamat, Craig E Larson, Shailya Mehta, David Muncy, and Nicolas Van Cleemput. 2018. “Automated Conjecturing VI : Domination Number of Benzenoids.” MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY 80 (3): 821–34.
Chicago author-date (all authors)
Hutchinson, Laura, Vikram Kamat, Craig E Larson, Shailya Mehta, David Muncy, and Nicolas Van Cleemput. 2018. “Automated Conjecturing VI : Domination Number of Benzenoids.” MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY 80 (3): 821–834.
Vancouver
1.
Hutchinson L, Kamat V, Larson CE, Mehta S, Muncy D, Van Cleemput N. Automated conjecturing VI : domination number of benzenoids. MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY. 2018;80(3):821–34.
IEEE
[1]
L. Hutchinson, V. Kamat, C. E. Larson, S. Mehta, D. Muncy, and N. Van Cleemput, “Automated conjecturing VI : domination number of benzenoids,” MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, vol. 80, no. 3, pp. 821–834, 2018.
@article{8568154,
  abstract     = {{We demonstrate the use of a conjecturing program that can be a tool for researchers investigating bounds of invariants of chemical graphs by investigating upper bounds for the domination number of a benzenoid. The program is open-source, of general use, and can be used to generate conjectured bounds for any invariant of any class of chemical graphs.}},
  author       = {{Hutchinson, Laura and Kamat, Vikram and Larson, Craig E and Mehta, Shailya and Muncy, David and Van Cleemput, Nicolas}},
  issn         = {{0340-6253}},
  journal      = {{MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY}},
  language     = {{eng}},
  location     = {{Leipzig, Germany}},
  number       = {{3}},
  pages        = {{821--834}},
  title        = {{Automated conjecturing VI : domination number of benzenoids}},
  url          = {{http://match.pmf.kg.ac.rs/electronic_versions/Match80/n3/match80n3_821-834.pdf}},
  volume       = {{80}},
  year         = {{2018}},
}

Web of Science
Times cited: