{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:49:05Z","timestamp":1759063745214},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,6,2]],"date-time":"2011-06-02T00:00:00Z","timestamp":1306972800000},"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":[[2012,5]]},"DOI":"10.1007\/s00373-011-1052-z","type":"journal-article","created":{"date-parts":[[2011,6,1]],"date-time":"2011-06-01T08:50:54Z","timestamp":1306918254000},"page":"393-406","source":"Crossref","is-referenced-by-count":3,"title":["s-Vertex Pancyclic Index"],"prefix":"10.1007","volume":"28","author":[{"given":"Zhang","family":"Lili","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yehong","family":"Shao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guihai","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xinping","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ju","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,6,2]]},"reference":[{"key":"1052_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph Theory with Applications","author":"J.A. Bondy","year":"1976","unstructured":"Bondy J.A., Murty U.S.R.: Graph Theory with Applications. American Elsevier, New York (1976)"},{"key":"1052_CR2","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1002\/jgt.3190110314","volume":"11","author":"H.J. Broersma","year":"1987","unstructured":"Broersma H.J., Veldman H.J.: 3-connected line graphs of triangular graphs are panconnected and 1-hamiltonian. J. Graph Theory 11, 399\u2013407 (1987)","journal-title":"J. Graph Theory"},{"key":"1052_CR3","first-page":"38","volume":"8","author":"G. Chartrand","year":"1973","unstructured":"Chartrand G., Wall C.E.: On the Hamiltonian index of a graph. Stud. Sci. Math. Hung 8, 38\u201343 (1973)","journal-title":"Stud. Sci. Math. Hung"},{"key":"1052_CR4","first-page":"131","volume":"15","author":"L.H. Clark","year":"1983","unstructured":"Clark L.H., Wormald N.C.: Hamiltonian-like indices of the graphs. Ars Combin. 15, 131\u2013148 (1983)","journal-title":"Ars Combin."},{"key":"1052_CR5","doi-asserted-by":"crossref","first-page":"701","DOI":"10.4153\/CMB-1965-051-3","volume":"9","author":"F. Harary","year":"1965","unstructured":"Harary F., Nash-Williams C.St.J.A.: On Eulerian and Hamiltonian graphs and line graphs. Can. Math. Bull 9, 701\u2013710 (1965)","journal-title":"Can. Math. Bull"},{"key":"1052_CR6","first-page":"275","volume":"69","author":"S. Hartke","year":"2003","unstructured":"Hartke S., Higgins A.: Minimum degree growth of the iterated line graph. Ars Combin. 69, 275\u2013283 (2003)","journal-title":"Ars Combin."},{"key":"1052_CR7","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/S0166-218X(02)00197-X","volume":"125","author":"M. Knor","year":"2003","unstructured":"Knor M., Niepel L\u2019.: Connectivity of iterated line graphs. Discret. Appl. Math. 125, 255\u2013266 (2003)","journal-title":"Discret. Appl. Math."},{"key":"1052_CR8","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0012-365X(88)90176-8","volume":"69","author":"H.-J. Lai","year":"1988","unstructured":"Lai H.-J.: On the Hamiltonian index. Discret. Math. 69, 43\u201353 (1988)","journal-title":"Discret. Math."},{"key":"1052_CR9","doi-asserted-by":"crossref","first-page":"4779","DOI":"10.1016\/j.disc.2007.08.073","volume":"308","author":"L. Zhang","year":"2008","unstructured":"Zhang L., Eschen E., Lai H.-J., Shao Y.: The s-Hamiltonian index. Discret Math. 308, 4779\u20134785 (2008)","journal-title":"Discret Math."},{"key":"1052_CR10","doi-asserted-by":"crossref","first-page":"2081","DOI":"10.1016\/j.dam.2010.08.024","volume":"158","author":"Y. Shao","year":"2010","unstructured":"Shao Y.: Connectivity of iterated line graphs. Discret. Appl. Math. 158, 2081\u20132087 (2010)","journal-title":"Discret. Appl. Math."},{"key":"1052_CR11","volume-title":"Introduction to Graph Theory","author":"D. West","year":"2001","unstructured":"West D.: Introduction to Graph Theory. Prentice Hall, New Jersey (2001)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-011-1052-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-011-1052-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-011-1052-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:58:32Z","timestamp":1559055512000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-011-1052-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,2]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,5]]}},"alternative-id":["1052"],"URL":"https:\/\/doi.org\/10.1007\/s00373-011-1052-z","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,6,2]]}}}