Lu, C., Wang, B., & Wang, K. (2017). Algorithm complexity of neighborhood total domination and ( ρ , γ n t ) -graphs. Journal of Combinatorial Optimization, 1-12. https://doi.org/10.1007/s10878-017-0181-6
ISO-690 (author-date, English)LU, Changhong, WANG, Bing and WANG, Kan, 2017. Algorithm complexity of neighborhood total domination and ( ρ , γ n t ) -graphs. Journal of Combinatorial Optimization. 10 October 2017. P. 1-12. DOI 10.1007/s10878-017-0181-6.
Modern Language Association 9th editionLu, C., B. Wang, and K. Wang. “Algorithm Complexity of Neighborhood Total Domination and ( ρ , γ N T ) -Graphs”. Journal of Combinatorial Optimization, Oct. 2017, pp. 1-12, https://doi.org/10.1007/s10878-017-0181-6.
Mohr Siebeck - Recht (Deutsch - Österreich)Lu, Changhong/Wang, Bing/Wang, Kan: Algorithm complexity of neighborhood total domination and ( ρ , γ n t ) -graphs, Journal of Combinatorial Optimization 2017, 1-12.
Emerald - HarvardLu, C., Wang, B. and Wang, K. (2017), “Algorithm complexity of neighborhood total domination and ( ρ , γ n t ) -graphs”, Journal of Combinatorial Optimization, pp. 1-12.