{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T15:40:27Z","timestamp":1725896427181},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642102165"},{"type":"electronic","value":"9783642102172"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10217-2_39","type":"book-chapter","created":{"date-parts":[[2009,11,9]],"date-time":"2009-11-09T10:52:03Z","timestamp":1257763923000},"page":"396-407","source":"Crossref","is-referenced-by-count":1,"title":["Kernel in Oriented Circulant Graphs"],"prefix":"10.1007","author":[{"given":"Paul","family":"Manuel","sequence":"first","affiliation":[]},{"given":"Indra","family":"Rajasingh","sequence":"additional","affiliation":[]},{"given":"Bharati","family":"Rajan","sequence":"additional","affiliation":[]},{"given":"Joice","family":"Punitha","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"39_CR1","doi-asserted-by":"crossref","unstructured":"Alzoubi, K.M., Wan, P.J., Frieder, O.: New Distributed Algorithm for Connected Dominating Set in Wireless Ad Hoc Networks. In: Proc. 35th Hawaii Int. Conf. System Sciences, pp. 1\u20137 (2002)","DOI":"10.1109\/JCN.2002.6596929"},{"key":"39_CR2","first-page":"221","volume":"52","author":"S. Armugam","year":"1992","unstructured":"Armugam, S., Velammal, S.: Maximum size of a connected graph with given domination parameters. Ars Combin.\u00a052, 221\u2013227 (1992)","journal-title":"Ars Combin."},{"key":"39_CR3","volume-title":"Digraphs: Theory, Algorthims and Applications","author":"J. Bang-Jensen","year":"2000","unstructured":"Bang-Jensen, J., Gutin, G.: Digraphs: Theory, Algorthims and Applications. Springer, London (2000)"},{"key":"39_CR4","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0012-365X(90)90346-J","volume":"86","author":"C. Berge","year":"1990","unstructured":"Berge, C., Duchet, P.: Recent problems and results about kernels in directed graphs. Discrete Mathematics\u00a086, 27\u201331 (1990)","journal-title":"Discrete Mathematics"},{"key":"39_CR5","unstructured":"Chv\u00e0tal, V.: On the computational complexity of finding a kernel. Report No. CRM-300, Centre de Recherches Mathematiques, Universite de Montreal (1973)"},{"key":"39_CR6","volume-title":"Graphs","author":"C. Berge","year":"1985","unstructured":"Berge, C.: Graphs, vol.\u00a06. North Holland Publishing Co., Amsterdam (1985)"},{"key":"39_CR7","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/0166-218X(81)90003-2","volume":"3","author":"A.S. Fraenkel","year":"1981","unstructured":"Fraenkel, A.S.: Planar kernel and Grundy with d\u2009\u2264\u20093,d\n                  \u2009+\u2009\u2009\u2264\u20092,d\n                  \u2212\u2009\u2264\u20092 are NP\n                  -complete. Discrete Applied Mathematics\u00a03, 257\u2013262 (1981)","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"39_CR8","doi-asserted-by":"publisher","first-page":"67","DOI":"10.2307\/421076","volume":"6","author":"J.-M.L. Bars","year":"2000","unstructured":"Bars, J.-M.L.: Counter example of the 0\u2009\u2212\u20091 Law for fragments of existential second-order logic: an overview. The Bulletin of Symbolic Logic\u00a06(1), 67\u201382 (2000)","journal-title":"The Bulletin of Symbolic Logic"},{"issue":"9","key":"39_CR9","doi-asserted-by":"publisher","first-page":"866","DOI":"10.1109\/TPDS.2002.1036062","volume":"13","author":"J. Wu","year":"2002","unstructured":"Wu, J.: Extended Dominating-Set-Based Routing in Ad Hoc Wireless Networks with Unidirectional Links. IEEE Transactions on Parallel and Distributed Systems\u00a013(9), 866\u2013881 (2002)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"39_CR10","unstructured":"Ksw\u00e1snik, M.: The generalisation of Richardson theorem. Discussiones Math. IV, 11\u201314 (1981)"},{"key":"39_CR11","doi-asserted-by":"publisher","first-page":"573","DOI":"10.2307\/1969755","volume":"58","author":"M. Richardson","year":"1953","unstructured":"Richardson, M.: Solutions of irreflexive relations. Ann. of Math.\u00a058, 573\u2013590 (1953)","journal-title":"Ann. of Math."},{"key":"39_CR12","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0020-0190(94)00072-7","volume":"51","author":"J.L. Szwarcfiter","year":"1994","unstructured":"Szwarcfiter, J.L., Chaty, G.: Enumerating the kernels of a directed graph with no odd circuits. Inform. Process. Lett.\u00a051, 149\u2013153 (1994)","journal-title":"Inform. Process. Lett."},{"key":"39_CR13","unstructured":"Van Leeuwen, J.: Having a Grundy-numbering is NP-complete. Report No. 207, Computer Science Dept., Pennsylvania State University, University Park, PA (1976)"},{"key":"39_CR14","volume-title":"Theory of Games and Economic Behaviour","author":"J. Neumann Von","year":"1944","unstructured":"Von Neumann, J., Morgenstern, O.: Theory of Games and Economic Behaviour. Princeton University Press, Princeton (1944)"},{"key":"39_CR15","doi-asserted-by":"crossref","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","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10217-2_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T12:43:28Z","timestamp":1558269808000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10217-2_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642102165","9783642102172"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10217-2_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}