Last update: Sun Mar 31 03:12:29 MDT 2019
@Article{Chang:2012:CDP, author = "Gerard J. Chang and B. S. Panda and D. Pradhan", title = "Complexity of distance paired-domination problem in graphs", journal = j-THEOR-COMP-SCI, volume = "459", number = "1", pages = "89--99", day = "9", month = nov, year = "2012", CODEN = "TCSCDI", DOI = "https://doi.org/10.1016/j.tcs.2012.08.024", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Wed Oct 24 08:34:55 MDT 2012", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs2010.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0304397512007980", acknowledgement = ack-nhfb, fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", }