{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T20:08:09Z","timestamp":1767211689104,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030678982"},{"type":"electronic","value":"9783030678999"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-67899-9_16","type":"book-chapter","created":{"date-parts":[[2021,1,28]],"date-time":"2021-01-28T00:05:55Z","timestamp":1611792355000},"page":"209-221","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["On cd-Coloring of Trees and Co-bipartite Graphs"],"prefix":"10.1007","author":[{"given":"M. A.","family":"Shalu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3057-457X","authenticated-orcid":false,"given":"V. K.","family":"Kirubakaran","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,1,28]]},"reference":[{"key":"16_CR1","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1109\/MPAE.2005.1507024","volume":"3","author":"SM Amin","year":"2005","unstructured":"Amin, S.M., Wollenberg, B.F.: Towards a smart grid. IEEE Power Energ. Mag. 3, 34\u201341 (2005). https:\/\/doi.org\/10.1109\/MPAE.2005.1507024","journal-title":"IEEE Power Energ. Mag."},{"key":"16_CR2","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1145\/1041680.1041681","volume":"36","author":"S Androutsellis-Theotokis","year":"2004","unstructured":"Androutsellis-Theotokis, S., Spinellis, D.: A survey of peer-to-peer content distribution technologies. ACM Comput. Surv. 36, 335\u2013371 (2004). https:\/\/doi.org\/10.1145\/1041680.1041681","journal-title":"ACM Comput. Surv."},{"key":"16_CR3","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-3-642-25011-8_2","volume":"7056","author":"S Arumugam","year":"2011","unstructured":"Arumugam, S., Chandrasekar, K.R., Misra, N., Philip, G., Saurabh, S.: Algorithmic aspects of dominator colorings in graphs. Comb. Algorithms 7056, 19\u201330 (2011). https:\/\/doi.org\/10.1007\/978-3-642-25011-8_2","journal-title":"Comb. Algorithms"},{"key":"16_CR4","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/BF02352694","volume":"21","author":"D Bocs\u00f3","year":"1990","unstructured":"Bocs\u00f3, D., Tuza, Z.: Dominating cliques in $${P_5}$$-free graphs. Periodica Mathematica Hungarica 21, 303\u2013308 (1990). https:\/\/doi.org\/10.1007\/BF02352694","journal-title":"Periodica Mathematica Hungarica"},{"key":"16_CR5","doi-asserted-by":"publisher","first-page":"51","DOI":"10.4007\/annals.2006.164.51","volume":"164","author":"M Chudnovsky","year":"2006","unstructured":"Chudnovsky, M., Robertson, N., Seymour, P., Thomas, R.: The strong perfect graph theorem. Ann. Math. 164, 51\u2013229 (2006). https:\/\/doi.org\/10.4007\/annals.2006.164.51","journal-title":"Ann. Math."},{"key":"16_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/978-3-319-51963-0_26","volume-title":"SOFSEM 2017: Theory and Practice of Computer Science","author":"R Krithika","year":"2017","unstructured":"Krithika, R., Rai, A., Saurabh, S., Tale, P.: Parameterized and exact algorithms for class domination coloring. In: Steffen, B., Baier, C., van den Brand, M., Eder, J., Hinchey, M., Margaria, T. (eds.) SOFSEM 2017. LNCS, vol. 10139, pp. 336\u2013349. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-51963-0_26"},{"issue":"3","key":"16_CR7","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1007\/s00373-014-1407-3","volume":"31","author":"HB Merouane","year":"2014","unstructured":"Merouane, H.B., Haddad, M., Chellali, M., Kheddouci, H.: Dominated colorings of graphs. Graphs Comb. 31(3), 713\u2013727 (2014). https:\/\/doi.org\/10.1007\/s00373-014-1407-3","journal-title":"Graphs Comb."},{"key":"16_CR8","doi-asserted-by":"publisher","unstructured":"Micali, S., Vazirani, V.V.: An $${O(\\sqrt{|V|}|E|)}$$ algorithm for finding maximum matching in general graphs. In: Proceedings of 21st IEEE Symposium on Foundations of Computer Science, pp. 17\u201327 (1980). https:\/\/doi.org\/10.1109\/SFCS.1980.12","DOI":"10.1109\/SFCS.1980.12"},{"key":"16_CR9","doi-asserted-by":"publisher","unstructured":"Monti, A., Ponci, F., Benigni, A., Liu, J.: Distributed intelligence for smart grid control. In: International School on Nonsinusoidal currents and Compensation, Lagow, Poland (2010). https:\/\/doi.org\/10.1109\/ISNCC.2010.5524469","DOI":"10.1109\/ISNCC.2010.5524469"},{"key":"16_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-319-29221-2_29","volume-title":"Algorithms and Discrete Applied Mathematics","author":"MA Shalu","year":"2016","unstructured":"Shalu, M.A., Sandhya, T.P.: The cd-coloring of graphs. In: Govindarajan, S., Maheshwari, A. (eds.) CALDAM 2016. LNCS, vol. 9602, pp. 337\u2013348. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-29221-2_29"},{"key":"16_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1007\/978-3-319-53007-9_30","volume-title":"Algorithms and Discrete Applied Mathematics","author":"MA Shalu","year":"2017","unstructured":"Shalu, M.A., Vijayakumar, S., Sandhya, T.P.: A lower bound of the cd-chromatic number and its complexity. In: Gaur, D., Narayanaswamy, N.S. (eds.) CALDAM 2017. LNCS, vol. 10156, pp. 344\u2013355. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-53007-9_30"},{"key":"16_CR12","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/j.dam.2018.03.004","volume":"280","author":"MA Shalu","year":"2020","unstructured":"Shalu, M.A., Vijayakumar, S., Sandhya, T.P.: On complexity of cd-coloring of graphs. Discret. Appl. Math. 280, 171\u2013185 (2020). https:\/\/doi.org\/10.1016\/j.dam.2018.03.004","journal-title":"Discret. Appl. Math."},{"key":"16_CR13","unstructured":"Swaminathan, V., Sundareswaran, R.: Color class domination in graphs. In: Mathematical and Experimental Physics. Narosa Publishing House (2010)"},{"key":"16_CR14","first-page":"233","volume":"12","author":"YB Venkatakrishnan","year":"2010","unstructured":"Venkatakrishnan, Y.B., Swaminathan, V.: Color class domination number of middle and central graph of $${K_{1, n}}, {C_n}, {P_n}$$. Adv. Model. Optim. 12, 233\u2013237 (2010)","journal-title":"Adv. Model. Optim."},{"key":"16_CR15","volume-title":"Introduction to Graph Theory","author":"DB West","year":"2018","unstructured":"West, D.B.: Introduction to Graph Theory, 2nd edn. Pearson, London (2018)","edition":"2"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-67899-9_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,28]],"date-time":"2021-01-28T00:11:48Z","timestamp":1611792708000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-67899-9_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030678982","9783030678999"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-67899-9_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"28 January 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CALDAM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Algorithms and Discrete Applied Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rupnagar","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 February 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 February 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caldam2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.iitrpr.ac.in\/caldam2021\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair and OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"82","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"39","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"48% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2,8","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2,21","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}