{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T04:31:44Z","timestamp":1648701104564},"reference-count":4,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2012,4,20]],"date-time":"2012-04-20T00:00:00Z","timestamp":1334880000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2013,7]]},"DOI":"10.1007\/s00373-012-1176-9","type":"journal-article","created":{"date-parts":[[2012,4,19]],"date-time":"2012-04-19T09:59:08Z","timestamp":1334829548000},"page":"1101-1111","source":"Crossref","is-referenced-by-count":0,"title":["Some Results on Weighted Graphs without Induced Cycles of Nonpositive Weights"],"prefix":"10.1007","volume":"29","author":[{"given":"G. R.","family":"Vijayakumar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,4,20]]},"reference":[{"key":"1176_CR1","volume-title":"Graph Theory, Electronic Edition","author":"R. Diestel","year":"2005","unstructured":"Diestel R.: Graph Theory, Electronic Edition. Springer, Heidelberg (2005)"},{"issue":"14","key":"1176_CR2","doi-asserted-by":"crossref","first-page":"1385","DOI":"10.1016\/j.disc.2011.03.027","volume":"311","author":"G.R. Vijayakumar","year":"2011","unstructured":"Vijayakumar G.R.: A property of weighted graphs without induced cycles of nonpositive weights. Discrete Math. 311(14), 1385\u20131387 (2011)","journal-title":"Discrete Math."},{"key":"1176_CR3","volume-title":"Introduction to graph theory","author":"D.B. West","year":"2001","unstructured":"West D.B.: Introduction to graph theory, 2nd edn. Printice Hall, New Jersey (2001)","edition":"2"},{"issue":"4","key":"1176_CR4","doi-asserted-by":"crossref","first-page":"1007","DOI":"10.1016\/j.disc.2008.01.007","volume":"309","author":"B. Xu","year":"2009","unstructured":"Xu B.: On signed cycle domination in graphs. Discrete Math. 309(4), 1007\u20131012 (2009)","journal-title":"Discrete Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1176-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-012-1176-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1176-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:59:33Z","timestamp":1559055573000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-012-1176-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,4,20]]},"references-count":4,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,7]]}},"alternative-id":["1176"],"URL":"https:\/\/doi.org\/10.1007\/s00373-012-1176-9","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,4,20]]}}}