{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T06:36:30Z","timestamp":1723012590225},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,9,24]],"date-time":"2015-09-24T00:00:00Z","timestamp":1443052800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2016,5]]},"DOI":"10.1007\/s00373-015-1629-z","type":"journal-article","created":{"date-parts":[[2015,9,24]],"date-time":"2015-09-24T03:39:12Z","timestamp":1443065952000},"page":"987-996","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Nordhaus\u2013Gaddum Results for the Induced Path Number of a Graph When Neither the Graph Nor Its Complement Contains Isolates"],"prefix":"10.1007","volume":"32","author":[{"given":"J. H.","family":"Hattingh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"O. A.","family":"Saleh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L. C.","family":"van der Merwe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T. J.","family":"Walters","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,9,24]]},"reference":[{"key":"1629_CR1","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1016\/j.dam.2011.12.018","volume":"161","author":"M Aouchiche","year":"2013","unstructured":"Aouchiche, M., Hansen, P.: A survey of Nordhaus\u2013Gaddum type relations. Discret. Appl. Math. 161, 330\u2013335 (2013)","journal-title":"Discret. Appl. Math."},{"key":"1629_CR2","first-page":"15","volume":"33","author":"I Broere","year":"2005","unstructured":"Broere, I., Domke, G.S., Jonck, E., Markus, L.R.: The induced path number of the complements of some graphs. Australas. J. Comb. 33, 15\u201332 (2005)","journal-title":"Australas. J. Comb."},{"key":"1629_CR3","first-page":"191","volume":"37","author":"G Chartrand","year":"1994","unstructured":"Chartrand, G., Hashmi, J., Hossain, M., McCanna, J., Sherwani, N.: The induced path number of bipartite graphs. Ars Combin. 37, 191\u2013208 (1994)","journal-title":"Ars Combin."},{"key":"1629_CR4","volume-title":"Graphs & Digraphs","author":"G Chartrand","year":"1996","unstructured":"Chartrand, G., Lesniak, L.: Graphs & Digraphs, 3rd edn. Chapman & Hall, London (1996)","edition":"3"},{"key":"1629_CR5","doi-asserted-by":"crossref","unstructured":"Chartrand, G., Mitchem, J.: Graphical theorems of the Nordhaus\u2013Gaddum class. In: Recent Trends in Graph Theory. Lecture Notes in Math, vol. 186. Springer, Berlin pp. 55\u201361 (1971)","DOI":"10.1007\/BFb0059422"},{"key":"1629_CR6","doi-asserted-by":"crossref","unstructured":"Hattingh, J.H., Saleh, O.A., Van der Merwe, L.C., Walters, T.J.: Nordhaus\u2013Gaddum results for the sum of the induced path number of a graph and its complement. Acta Math. Sin. 28, 2365\u20132372 (2012)","DOI":"10.1007\/s10114-012-0727-6"},{"key":"1629_CR7","first-page":"275","volume":"94","author":"JH Hattingh","year":"2014","unstructured":"Hattingh, J.H., Saleh, O.A., Van der Merwe, L.C., Walters, T.J.: Product Nordhaus\u2013Gaddum-type results for the induced path number with relative complements in $$K_n$$ K n or $$K_{n, n}$$ K n , n . Util. Math. 94, 275\u2013285 (2014)","journal-title":"Util. Math."},{"key":"1629_CR8","first-page":"728","volume":"274","author":"F Jaeger","year":"1972","unstructured":"Jaeger, F., Payan, C.: Relations du type Nordhaus\u2013Gaddum pour le nombre d\u2019absorption d\u2019un simple. C. R. Acad. Sci. Ser. A 274, 728\u2013730 (1972)","journal-title":"C. R. Acad. Sci. Ser. A"},{"key":"1629_CR9","unstructured":"Joseph, J.P., Arumugam, S.: A note on domination in graphs (Submitted)"},{"key":"1629_CR10","doi-asserted-by":"crossref","first-page":"175","DOI":"10.2307\/2306658","volume":"63","author":"EA Nordhaus","year":"1956","unstructured":"Nordhaus, E.A., Gaddum, J.W.: On complementary graphs. Am. Math. Mon. 63, 175\u2013177 (1956)","journal-title":"Am. Math. Mon."},{"key":"1629_CR11","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1002\/jgt.3190060104","volume":"6","author":"C Payan","year":"1982","unstructured":"Payan, C., Xuong, N.H.: Domination-balanced graphs. J. Graph Theory 6, 23\u201332 (1982)","journal-title":"J. Graph Theory"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-015-1629-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-015-1629-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-015-1629-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:59:41Z","timestamp":1559055581000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-015-1629-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9,24]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,5]]}},"alternative-id":["1629"],"URL":"https:\/\/doi.org\/10.1007\/s00373-015-1629-z","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,9,24]]}}}