Lu, C., Wang, B., & Wang, K. (2018). Algorithm complexity of neighborhood total domination and (ρ,γnt)-graphs. Journal of combinatorial optimization, 35(2), 424-435. https://doi.org/10.1007/s10878-017-0181-6
Chicago Style (17th ed.) CitationLu, Changhong, Bing Wang, and Kan Wang. "Algorithm Complexity of Neighborhood Total Domination and (ρ,γnt)-graphs." Journal of Combinatorial Optimization 35, no. 2 (2018): 424-435. https://doi.org/10.1007/s10878-017-0181-6.
MLA (9th ed.) CitationLu, Changhong, et al. "Algorithm Complexity of Neighborhood Total Domination and (ρ,γnt)-graphs." Journal of Combinatorial Optimization, vol. 35, no. 2, 2018, pp. 424-435, https://doi.org/10.1007/s10878-017-0181-6.
Warning: These citations may not always be 100% accurate.