{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T12:20:33Z","timestamp":1725884433798},"publisher-location":"Singapore","reference-count":7,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811046414"},{"type":"electronic","value":"9789811046421"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-981-10-4642-1_9","type":"book-chapter","created":{"date-parts":[[2017,4,15]],"date-time":"2017-04-15T05:18:49Z","timestamp":1492233529000},"page":"96-102","source":"Crossref","is-referenced-by-count":1,"title":["Connected Fair Domination in Graphs"],"prefix":"10.1007","author":[{"given":"Angsuman","family":"Das","sequence":"first","affiliation":[]},{"given":"Wyatt J.","family":"Desormeaux","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,4,16]]},"reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"2905","DOI":"10.1016\/j.disc.2012.05.006","volume":"312","author":"Y Caro","year":"2012","unstructured":"Caro, Y., Hansberg, A., Henning, M.: Fair domination in graphs. Discrete Math. 312, 2905\u20132914 (2012)","journal-title":"Discrete Math."},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1016\/j.endm.2013.07.054","volume":"43","author":"A Hansberg","year":"2013","unstructured":"Hansberg, A.: Reviewing some results on fair domination in graphs. Electron. Notes Discrete Math. 43, 367\u2013373 (2013)","journal-title":"Electron. Notes Discrete Math."},{"key":"9_CR3","volume-title":"Fundamentals of Domination in Graphs","author":"TW Haynes","year":"1998","unstructured":"Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Fundamentals of Domination in Graphs. Marcel Dekker Inc., New York (1998)"},{"volume-title":"Domination in Graphs: Advanced Topics","year":"1998","key":"9_CR4","unstructured":"Haynes, T.W., Hedetniemi, S.T., Slater, P.J. (eds.): Domination in Graphs: Advanced Topics. Marcel Dekker Inc., New York (1998)"},{"issue":"6","key":"9_CR5","first-page":"607","volume":"13","author":"E Sampathkumar","year":"1979","unstructured":"Sampathkumar, E., Walikar, H.B.: The connected domination number of a graph. J. Math. Phy. Sci. 13(6), 607\u2013613 (1979)","journal-title":"J. Math. Phy. Sci."},{"issue":"4","key":"9_CR6","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s00453-004-1112-3","volume":"40","author":"C Swamy","year":"2004","unstructured":"Swamy, C., Kumar, A.: Primal-dual algorithms for connected facility location problems. Algorithmica 40(4), 245\u2013269 (2004)","journal-title":"Algorithmica"},{"key":"9_CR7","volume-title":"Introduction to Graph Theory","author":"DB West","year":"2001","unstructured":"West, D.B.: Introduction to Graph Theory. Prentice Hall, Upper Saddle River (2001)"}],"container-title":["Communications in Computer and Information Science","Mathematics and Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-10-4642-1_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,4,15]],"date-time":"2017-04-15T05:21:20Z","timestamp":1492233680000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-10-4642-1_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9789811046414","9789811046421"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-981-10-4642-1_9","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2017]]}}}