{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,27]],"date-time":"2024-07-27T21:10:01Z","timestamp":1722114601019},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,10,20]],"date-time":"2021-10-20T00:00:00Z","timestamp":1634688000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,10,20]],"date-time":"2021-10-20T00:00:00Z","timestamp":1634688000000},"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":["Front. Comput. Sci."],"published-print":{"date-parts":[[2022,6]]},"DOI":"10.1007\/s11704-021-0415-8","type":"journal-article","created":{"date-parts":[[2021,10,20]],"date-time":"2021-10-20T20:50:08Z","timestamp":1634763008000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Full friendly index sets of mCn"],"prefix":"10.1007","volume":"16","author":[{"given":"Yurong","family":"Ji","sequence":"first","affiliation":[]},{"given":"Jinmeng","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Yujie","family":"Bai","sequence":"additional","affiliation":[]},{"given":"Shufei","family":"Wu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,10,20]]},"reference":[{"key":"415_CR1","first-page":"1","volume":"19","author":"J A Gallian","year":"2009","unstructured":"Gallian J A. A dynamic survey of graph labeling. Electronic Journal of Combinatorics, 2009, 19: 1\u2013219","journal-title":"Electronic Journal of Combinatorics"},{"key":"415_CR2","first-page":"201","volume":"23","author":"I Cahit","year":"1987","unstructured":"Cahit I. Cordial graphs: a weaker version of graceful and harmonious graphs. Ars Combinatoria, 1987, 23: 201\u2013207","journal-title":"Ars Combinatoria"},{"issue":"2\u20133","key":"415_CR3","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0012-365X(91)90254-Y","volume":"93","author":"M Hovey","year":"1991","unstructured":"Hovey M. A-cordial graphs. Discrete Mathematics, 1991, 93(2\u20133): 183\u2013194","journal-title":"Discrete Mathematics"},{"issue":"8\u20139","key":"415_CR4","doi-asserted-by":"publisher","first-page":"726","DOI":"10.1016\/j.disc.2005.11.025","volume":"306","author":"G Chartrand","year":"2006","unstructured":"Chartrand G, Lee S M, Zhang P. Uniformly cordial graphs. Discrete Mathematics, 2006, 306(8\u20139): 726\u2013737","journal-title":"Discrete Mathematics"},{"issue":"16","key":"415_CR5","doi-asserted-by":"publisher","first-page":"3688","DOI":"10.1016\/j.disc.2007.07.002","volume":"308","author":"W C Shiu","year":"2008","unstructured":"Shiu W C, Kwong H. Full friendly index sets of P2\u00d7Pn. Discrete Mathematics, 2008, 308(16): 3688\u20133693","journal-title":"Discrete Mathematics"},{"issue":"1","key":"415_CR6","doi-asserted-by":"publisher","first-page":"111590","DOI":"10.1016\/j.disc.2019.07.006","volume":"343","author":"J Hou","year":"2020","unstructured":"Hou J, Yan J. Max-Bisections of H-free graphs. Discrete Mathematics, 2020, 343(1): 111590","journal-title":"Discrete Mathematics"},{"issue":"6","key":"415_CR7","doi-asserted-by":"publisher","first-page":"1076","DOI":"10.1007\/s11704-016-6109-y","volume":"12","author":"Q Liu","year":"2018","unstructured":"Liu Q, Dong X, Chen H, Wang Y. IncPregel: an incremental graph parallel computation model. Frontiers of Computer Science, 2018, 12(6): 1076\u20131089","journal-title":"Frontiers of Computer Science"},{"issue":"5","key":"415_CR8","doi-asserted-by":"publisher","first-page":"960","DOI":"10.1007\/s11704-018-6586-2","volume":"13","author":"Z Wang","year":"2019","unstructured":"Wang Z, Chen Q, Suo B, Pan W, Li Z. Reducing partition skew on MapReduce: an incremental allocation approach. Frontiers of Computer Science, 2019, 13(5): 960\u2013975","journal-title":"Frontiers of Computer Science"},{"key":"415_CR9","first-page":"1","volume":"45","author":"B Xu","year":"2016","unstructured":"Xu B. Graph partitions: recent progresses and some open problems. Advances in Mathematics (China), 2016, 45: 1\u201320","journal-title":"Advances in Mathematics (China)"},{"issue":"9","key":"415_CR10","doi-asserted-by":"publisher","first-page":"1262","DOI":"10.1016\/j.dam.2012.10.028","volume":"161","author":"D Sinha","year":"2013","unstructured":"Sinha D, Kaur J. Full friendly index set-I. Discrete Applied Mathematics, 2013, 161(9): 1262\u20131274","journal-title":"Discrete Applied Mathematics"},{"issue":"7","key":"415_CR11","doi-asserted-by":"publisher","first-page":"1233","DOI":"10.1007\/s10114-010-8517-5","volume":"26","author":"W C Shiu","year":"2010","unstructured":"Shiu W C, Ling M H. Full friendly index sets of Cartesian products of two cycles. Acta Mathematica Sinica-English Series, 2010, 26(7): 1233\u20131244","journal-title":"Acta Mathematica Sinica-English Series"},{"key":"415_CR12","first-page":"141","volume":"52","author":"W C Shiu","year":"2012","unstructured":"Shiu W C, Wong F S. Full friendly index sets of cylinder graphs. Australasian Journal of Combinatorics, 2012, 52: 141\u2013162","journal-title":"Australasian Journal of Combinatorics"},{"issue":"3","key":"415_CR13","first-page":"227","volume":"5","author":"W C Shiu","year":"2013","unstructured":"Shiu W C, Ho M H. Full friendly index sets and full product-cordial index sets of some permutation Petersen graphs. Journal of Combinatorics and Number Theory, 2013, 5(3): 227\u2013244","journal-title":"Journal of Combinatorics and Number Theory"},{"issue":"4","key":"415_CR14","first-page":"63","volume":"2","author":"W C Shiu","year":"2013","unstructured":"Shiu W C, Ho M H. Full friendly index sets of slender and flat cylinder graphs. Transactions on Combinatorics, 2013, 2(4): 63\u201380","journal-title":"Transactions on Combinatorics"}],"container-title":["Frontiers of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-021-0415-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11704-021-0415-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-021-0415-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,20]],"date-time":"2023-07-20T21:04:46Z","timestamp":1689887086000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11704-021-0415-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,20]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,6]]}},"alternative-id":["415"],"URL":"https:\/\/doi.org\/10.1007\/s11704-021-0415-8","relation":{},"ISSN":["2095-2228","2095-2236"],"issn-type":[{"value":"2095-2228","type":"print"},{"value":"2095-2236","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,10,20]]},"assertion":[{"value":"18 August 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 July 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 October 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"163403"}}