{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T18:44:43Z","timestamp":1742928283185,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319644189"},{"type":"electronic","value":"9783319644196"}],"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-3-319-64419-6_37","type":"book-chapter","created":{"date-parts":[[2017,8,15]],"date-time":"2017-08-15T22:42:00Z","timestamp":1502836920000},"page":"289-299","source":"Crossref","is-referenced-by-count":0,"title":["On Graphs Whose Graphoidal Length Is Half of\u00a0Its Size"],"prefix":"10.1007","author":[{"given":"Purnima","family":"Gupta","sequence":"first","affiliation":[]},{"given":"Rajesh","family":"Singh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,8,17]]},"reference":[{"key":"37_CR1","first-page":"127","volume":"4","author":"BD Acharya","year":"2007","unstructured":"Acharya, B.D., Purnima, G.: Further results on domination in graphoidally covered graphs. AKCE Int. J. Graphs Comb. 4, 127\u2013138 (2007)","journal-title":"AKCE Int. J. Graphs Comb."},{"issue":"2\u20133","key":"37_CR2","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/j.akcej.2015.11.007","volume":"12","author":"BD Acharya","year":"2015","unstructured":"Acharya, B.D., Purnima, G., Deepti, J.: On graphs whose graphoidal domination number is one. AKCE Int. J. Graphs Comb. 12(2\u20133), 133\u2013140 (2015)","journal-title":"AKCE Int. J. Graphs Comb."},{"key":"37_CR3","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0012-365X(98)00389-6","volume":"206","author":"BD Acharya","year":"1999","unstructured":"Acharya, B.D., Purnima, G.: Domination in graphoidal covers of a graph. Discrete Math. 206, 3\u201333 (1999)","journal-title":"Discrete Math."},{"key":"37_CR4","first-page":"882","volume":"18","author":"BD Acharya","year":"1987","unstructured":"Acharya, B.D., Sampathkumar, E.: Graphoidal covers and graphoidal covering number of a graph. Indian J. Pure Appl. Math. 18, 882\u2013890 (1987)","journal-title":"Indian J. Pure Appl. Math."},{"key":"37_CR5","unstructured":"Arumugam, S., Acharya, B.D., Sampathkumar, E.: Graphoidal covers of a graph: a creative review. In: Proceedings of Graph Theory and its Applications, pp. 1\u201328. Tata McGraw-Hill, New Delhi (1997)"},{"key":"37_CR6","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/j.endm.2016.05.010","volume":"53","author":"S Arumugam","year":"2016","unstructured":"Arumugam, S., Purnima, G., Rajesh, S.: Bounds on graphoidal length of a graph. Electron. Notes Discrete Math. 53, 113\u2013122 (2016)","journal-title":"Electron. Notes Discrete Math."},{"key":"37_CR7","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/BF02986680","volume":"10","author":"S Arumugam","year":"1994","unstructured":"Arumugam, S., Pakkiam, C.: Graphoidal bipartite graphs. Graphs Combin. 10, 305\u2013310 (1994)","journal-title":"Graphs Combin."},{"key":"37_CR8","first-page":"1147","volume":"25","author":"S Arumugam","year":"1994","unstructured":"Arumugam, S., Pakkiam, C.: Graphs with unique minimum graphoidal cover. Indian J. Pure Appl. Math. 25, 1147\u20131153 (1994)","journal-title":"Indian J. Pure Appl. Math."},{"key":"37_CR9","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/S0012-365X(00)00350-2","volume":"240","author":"S Arumugam","year":"2001","unstructured":"Arumugam, S., Rajasingh, I., Pushpam, P.R.L.: Graphs whose acyclic graphoidal covering number is one less than its maximum degree. Discrete Math. 240, 231\u2013237 (2001)","journal-title":"Discrete Math."},{"key":"37_CR10","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/S0012-365X(98)00032-6","volume":"190","author":"S Arumugam","year":"1998","unstructured":"Arumugam, S., Suseela, J.S.: Acyclic graphoidal covers and path partitions in a graph. Discrete Math. 190, 67\u201377 (1998)","journal-title":"Discrete Math."},{"issue":"2","key":"37_CR11","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1006\/jctb.2001.2057","volume":"83","author":"JI Brown","year":"2001","unstructured":"Brown, J.I., Hickman, C., Sokal, A.D., Wagner, D.G.: On the chromatic roots of generalized theta graphs. J. Combin. Theory Ser. B. 83(2), 272\u2013297 (2001)","journal-title":"J. Combin. Theory Ser. B."},{"key":"37_CR12","volume-title":"Graphs & Digraphs","author":"G Chartrand","year":"2005","unstructured":"Chartrand, G., Lesniak, L.: Graphs & Digraphs. Chapman & Hall\/CRC, Boca Raton (2005)"},{"key":"37_CR13","series-title":"Discrete Mathematics and its Applications","volume-title":"Handbook of Graph Theory","author":"JL Gross","year":"2014","unstructured":"Gross, J.L., Yellen, J., Zhang, P.: Handbook of Graph Theory. Discrete Mathematics and its Applications. CRC Press, Boca Raton (2014)"},{"key":"37_CR14","first-page":"330","volume":"20","author":"C Pakkiam","year":"1989","unstructured":"Pakkiam, C., Arumugam, S.: On the graphoidal covering number of a graph. Indian J. Pure Appl. Math. 20, 330\u2013333 (1989)","journal-title":"Indian J. Pure Appl. Math."},{"key":"37_CR15","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1016\/j.endm.2016.05.037","volume":"53","author":"G Purnima","year":"2016","unstructured":"Purnima, G., Rajesh, S.: Domination in graphoidally covered graphs: least-kernel graphoidal covers. Electron. Notes Discrete Math. 53, 433\u2013444 (2016)","journal-title":"Electron. Notes Discrete Math."},{"issue":"2","key":"37_CR16","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/BF01929485","volume":"11","author":"B Reed","year":"1995","unstructured":"Reed, B., Sbihi, N.: Recognizing bull-free perfect graphs. Graphs Combin. 11(2), 171\u2013178 (1995)","journal-title":"Graphs Combin."},{"key":"37_CR17","first-page":"25","volume":"1","author":"I Sahul Hamid","year":"2012","unstructured":"Sahul Hamid, I., Anitha, A.: On label graphoidal covering number-I. Trans. Comb. 1, 25\u201333 (2012)","journal-title":"Trans. Comb."},{"key":"37_CR18","unstructured":"Sampathkumar, E.: Semigraphs and their applications. Report on the DST Project (2000)"}],"container-title":["Lecture Notes in Computer Science","Theoretical Computer Science and Discrete Mathematics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-64419-6_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,10,24]],"date-time":"2017-10-24T22:51:38Z","timestamp":1508885498000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-64419-6_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319644189","9783319644196"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-64419-6_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}