{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T14:19:13Z","timestamp":1778595553781,"version":"3.51.4"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031252105","type":"print"},{"value":"9783031252112","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-25211-2_31","type":"book-chapter","created":{"date-parts":[[2023,1,25]],"date-time":"2023-01-25T19:02:42Z","timestamp":1674673362000},"page":"403-414","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Maximum Subgraph Problem for\u00a03-Regular Kn\u00f6del graphs and\u00a0its Wirelength"],"prefix":"10.1007","author":[{"given":"R. Sundara","family":"Rajan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Remi Mariam","family":"Reji","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T. M.","family":"Rajalaxmi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,26]]},"reference":[{"issue":"2","key":"31_CR1","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/s000260050003","volume":"4","author":"SL Bezrukov","year":"2000","unstructured":"Bezrukov, S.L., Das, S.K., Els\u00e4sser, R.: An edge-isoperimetric problem for powers of the petersen graph. Ann. Comb. 4(2), 153\u2013169 (2000)","journal-title":"Ann. Comb."},{"key":"31_CR2","volume-title":"Introduction Algorithms","author":"TH Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction Algorithms, 2nd edn. The MIT Press, McGraw-Hill, New York (2001)","edition":"2"},{"key":"31_CR3","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1002\/net.1033","volume":"38","author":"P Fraigniaud","year":"2001","unstructured":"Fraigniaud, P., Peters, J.G.: Minimum linear gossip graphs and maximal linear ($$\\varDelta $$, $$k$$)-gossip graphs. Networks 38, 150\u2013162 (2001)","journal-title":"Networks"},{"key":"31_CR4","volume-title":"Computers and Intractability; A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness, 1st edn. W. H. Freeman & Co., USA (1979)","edition":"1"},{"issue":"1","key":"31_CR5","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1137\/0112012","volume":"12","author":"LH Harper","year":"1964","unstructured":"Harper, L.H.: Optimal assignments of numbers to vertices. J. Soc. Ind. Appl. Math. 12(1), 131\u2013135 (1964)","journal-title":"J. Soc. Ind. Appl. Math."},{"issue":"2","key":"31_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1142\/S1793830918500234","volume":"10","author":"X Jiang","year":"2018","unstructured":"Jiang, X., Liu, Q., Parthiban, N., Rajan, R.S.: A note on minimum linear arrangement for BC graphs. Discrete Math. Algorithms Appl. 10(2), 1\u20137 (2018)","journal-title":"Discrete Math. Algorithms Appl."},{"key":"31_CR7","doi-asserted-by":"crossref","unstructured":"Kn\u00f6del, W.: New gossips and telephones. Discrete Math. 13, 95 (1975)","DOI":"10.1016\/0012-365X(75)90090-4"},{"issue":"2","key":"31_CR8","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1093\/comjnl\/bxu031","volume":"58","author":"M Miller","year":"2015","unstructured":"Miller, M., Rajan, R.S., Parthiban, N., Rajasingh, I.: Minimum linear arrangement of incomplete hypercubes. Comput. J. 58(2), 331\u2013337 (2015)","journal-title":"Comput. J."},{"issue":"18","key":"31_CR9","doi-asserted-by":"publisher","first-page":"2778","DOI":"10.1016\/j.dam.2011.12.007","volume":"160","author":"I Rajasingh","year":"2012","unstructured":"Rajasingh, I., Manuel, P., Rajan, B., Arockiaraj, M.: Wirelength of hypercubes into certain trees. Discrete Appl. Math. 160(18), 2778\u20132786 (2012)","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"31_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1142\/S0129626415500085","volume":"25","author":"I Rajasingh","year":"2015","unstructured":"Rajasingh, I., Sundara Rajan, R., Manuel, P.: A linear time algorithm for embedding christmas trees into certain trees. Parallel Process. Lett. 25(4), 1\u201317 (2015)","journal-title":"Parallel Process. Lett."},{"key":"31_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3387-7","volume-title":"Topological Structure and Analysis of Interconnection Networks","author":"J Xu","year":"2001","unstructured":"Xu, J.: Topological Structure and Analysis of Interconnection Networks. Kluwer Academic Publishers, Dordrecht (2001)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-25211-2_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T22:44:16Z","timestamp":1767134656000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-25211-2_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031252105","9783031252112"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-25211-2_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"26 January 2023","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":"Gandhinagar","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 February 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 February 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caldam2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/caldam2023.daiict.ac.in\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}