Algorithm complexity of neighborhood total domination and $$(\rho ,\gamma _{nt})$$ ( ρ , γ n t ) -graphs
Crossref DOI link: https://doi.org/10.1007/s10878-017-0181-6
Published Online: 2017-10-10
Published Print: 2018-02
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Lu, Changhong
Wang, Bing https://orcid.org/0000-0003-4449-7082
Wang, Kan
Funding for this research was provided by:
NSF of CHina (11371008, 91230201)
License valid from 2017-10-10