Sundareswaran, R., & Swaminathan, V. (2015). Computational complexity of domination integrity in graphs. TWMS journal of applied and engineering mathematics, 5(2), 214.
Chicago-Zitierstil (17. Ausg.)Sundareswaran, R., und V. Swaminathan. "Computational Complexity of Domination Integrity in Graphs." TWMS Journal of Applied and Engineering Mathematics 5, no. 2 (2015): 214.
MLA-Zitierstil (9. Ausg.)Sundareswaran, R., und V. Swaminathan. "Computational Complexity of Domination Integrity in Graphs." TWMS Journal of Applied and Engineering Mathematics, vol. 5, no. 2, 2015, p. 214.
Achtung: Diese Zitate sind unter Umständen nicht zu 100% korrekt.