{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T07:00:52Z","timestamp":1775718052209,"version":"3.50.1"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T00:00:00Z","timestamp":1770854400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T00:00:00Z","timestamp":1770854400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12271210, 12071180"],"award-info":[{"award-number":["12271210, 12071180"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2026,4]]},"DOI":"10.1007\/s00373-026-03021-z","type":"journal-article","created":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T04:28:29Z","timestamp":1770870509000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Coefficients of the Matching Polynomial of a Self-Complementary Graph"],"prefix":"10.1007","volume":"42","author":[{"given":"Haiyan","family":"Chen","sequence":"first","affiliation":[]},{"given":"Yinxia","family":"Yuan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,2,12]]},"reference":[{"key":"3021_CR1","unstructured":"Broere, I., Hattingh, J. H.: On the construction of self-complementary circulant graphs, in Graph theory, combinatorics, and algorithms, Vol. 1, 2 (Kalamazoo, MI, 1992), Wiley, New York pp. 123-129 (1995)."},{"key":"3021_CR2","doi-asserted-by":"crossref","unstructured":"Cao, Y., Chen, H., Wang, S.: Self-complementary (Pseudo-)Split Graphs, In: Soto, J.A., Wiese, A.: (eds) LATIN 2024: Theoretical Informatics. Lecture Notes in Computer Science , Vol 14579. Springer, Cham, (2024)","DOI":"10.1007\/978-3-031-55601-2_1"},{"key":"3021_CR3","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/0012-365X(92)00469-8","volume":"127","author":"LD Carrillo","year":"1994","unstructured":"Carrillo, L.D.: Hamiltonian-connected self-complementary graphs, in Graph theory and applications (Hakone, 1990). Discrete Math. 127, 75\u201393 (1994)","journal-title":"Discrete Math."},{"issue":"B","key":"3021_CR4","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/0095-8956(76)90069-1","volume":"20","author":"CRJ Clapham","year":"1976","unstructured":"Clapham, C.R.J.: Potentially self-complementary degree sequences. J. Combin. Theory 20(B), 75\u201379 (1976)","journal-title":"J. Combin. Theory"},{"key":"3021_CR5","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1017\/S0013091500022276","volume":"27","author":"CRJ Clapham","year":"1984","unstructured":"Clapham, C.R.J.: An easier enumeration of self-complementary graphs. Proc. Edinburgh Math. Soc. (2) 27, 181\u2013183 (1984)","journal-title":"Proc. Edinburgh Math. Soc. (2)"},{"key":"3021_CR6","unstructured":"Farrugia, A.: Self-complementary graphs and generalisations: a comprehensive reference manual, Master thesis, University of Malta, (1999)"},{"key":"3021_CR7","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1006\/eujc.1996.0053","volume":"17","author":"D Fron\u010dek","year":"1996","unstructured":"Fron\u010dek, D., Rosa, A., \u0160ir\u00e1\u0148, J.: The existence of self-complementary circulant graphs. European J. Combin. 17, 625\u2013628 (1996)","journal-title":"European J. Combin."},{"key":"3021_CR8","volume-title":"Algebraic Combinatorics","author":"CD Godsil","year":"1993","unstructured":"Godsil, C.D.: Algebraic Combinatorics. Chapman and Hall, New York (1993)"},{"key":"3021_CR9","first-page":"75","volume":"6","author":"I Gutman","year":"1979","unstructured":"Gutman, I.: The matching polynomial. MATCH Commun. Math. Comput. Chem. 6, 75\u201391 (1979)","journal-title":"MATCH Commun. Math. Comput. Chem."},{"key":"3021_CR10","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1002\/jgt.3190110411","volume":"11","author":"N Hartsfield","year":"1987","unstructured":"Hartsfield, N.: On regular self-complementary graphs. J. Graph Theory 11, 537\u2013538 (1987)","journal-title":"J. Graph Theory"},{"key":"3021_CR11","doi-asserted-by":"publisher","first-page":"1093","DOI":"10.1006\/eujc.2001.0529","volume":"22","author":"R Jajcay","year":"2001","unstructured":"Jajcay, R., Li, C.H.: Constructions of self-complementary circulants with no multiplicative isomorphisms. European J. Combin. 22, 1093\u20131100 (2001)","journal-title":"European J. Combin."},{"key":"3021_CR12","doi-asserted-by":"publisher","first-page":"3903","DOI":"10.1080\/00927879708826094","volume":"25","author":"CH Li","year":"1997","unstructured":"Li, C.H.: On self-complementary vertex transitive graphs, Commun. Algebra 25, 3903\u20133908 (1997)","journal-title":"Algebra"},{"key":"3021_CR13","unstructured":"Lov\u00e1sz, L., Plummer, M. D.: Matching Theory, Annals Discrete Math. North-Holland, Amsterdam 29 (1986)."},{"key":"3021_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/s13226-025-00751-3","author":"P Manna","year":"2025","unstructured":"Manna, P., Mehatari, R.: On the self-complementary power graph of finite groups. Indian J. Pure Appl. Math. (2025). https:\/\/doi.org\/10.1007\/s13226-025-00751-3","journal-title":"Indian J. Pure Appl. Math."},{"key":"3021_CR15","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0012-365X(88)90055-6","volume":"69","author":"R Mathon","year":"1988","unstructured":"Mathon, R.: On self-complementary strongly regular graphs. Discrete Math. 69, 263\u2013281 (1988)","journal-title":"Discrete Math."},{"key":"3021_CR16","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/S0012-365X(96)00127-6","volume":"175","author":"PS Nair","year":"1997","unstructured":"Nair, P.S.: Construction of self-complementary graphs. Discrete Math. 175, 283\u2013287 (1997)","journal-title":"Discrete Math."},{"key":"3021_CR17","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.endm.2005.06.014","volume":"22","author":"N Trotignon","year":"2005","unstructured":"Trotignon, N.: On the structure of self-complementary graphs. Electron. Notes Discret. Math. 22, 79\u201382 (2005)","journal-title":"Electron. Notes Discret. Math."},{"key":"3021_CR18","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0012-365X(85)90063-9","volume":"54","author":"SB Rao","year":"1985","unstructured":"Rao, S.B.: On regular and strongly-rugular self-complementary graphs. Discrete Math. 54, 73\u201382 (1985)","journal-title":"Discrete Math."},{"key":"3021_CR19","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1112\/jlms\/s1-38.1.99","volume":"38","author":"RC Read","year":"1963","unstructured":"Read, R.C.: On the number of self-complementary graphs and digraphs. J. London Math. Soc. 38, 99\u2013104 (1963)","journal-title":"J. London Math. Soc."},{"key":"3021_CR20","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/BF01234967","volume":"14","author":"G Ringel","year":"1963","unstructured":"Ringel, G.: Selbstkomplement\u00e4re Graphen. Arch. Math. 14, 354\u2013358 (1963)","journal-title":"Arch. Math."},{"key":"3021_CR21","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1017\/S1446788700035357","volume":"53","author":"CA Rodger","year":"1992","unstructured":"Rodger, C.A.: Self-complementary graph decompositions. J. Aust. Math. Soc. (A) 53, 17\u201324 (1992)","journal-title":"J. Aust. Math. Soc. (A)"},{"key":"3021_CR22","first-page":"243","volume":"45","author":"V Rodl","year":"1995","unstructured":"Rodl, V., Sinajova, E.: Note on Ramsey numbers and self-complementary graphs. Math. Slovaca 45, 243\u2013249 (1995)","journal-title":"Math. Slovaca"},{"key":"3021_CR23","first-page":"279","volume":"9","author":"H Sachs","year":"1962","unstructured":"Sachs, H.: ber Selbstkomplementare Graphen. Publ. Math. Debrecen 9, 279\u2013288 (1962)","journal-title":"Publ. Math. Debrecen"},{"key":"3021_CR24","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1016\/0304-3975(79)90044-6","volume":"8","author":"LG Valiant","year":"1979","unstructured":"Valiant, L.G.: The complexity of computing the permanent. Theoret. Comput. Sci. 8, 410\u2013421 (1979)","journal-title":"Theoret. Comput. Sci."},{"key":"3021_CR25","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/S0012-365X(00)00020-0","volume":"223","author":"J Xu","year":"2000","unstructured":"Xu, J., Wong, C.K.: Self-complementary graphs and Ramsey numbers Part-I: the decomposition and construction of self-complementary graphs. Discrete Math. 223, 309\u2013326 (2000)","journal-title":"Discrete Math."},{"key":"3021_CR26","volume-title":"Self-complementary Graph Theory with Applications (in chinese)","author":"J Xu","year":"1999","unstructured":"Xu, J.: Self-complementary Graph Theory with Applications (in chinese). Xidian University Press, Xi\u2019an (1999)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-026-03021-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-026-03021-z","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-026-03021-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T06:17:16Z","timestamp":1775715436000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-026-03021-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,12]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,4]]}},"alternative-id":["3021"],"URL":"https:\/\/doi.org\/10.1007\/s00373-026-03021-z","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,12]]},"assertion":[{"value":"16 September 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 January 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 February 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"We declare that we have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of Interest"}}],"article-number":"22"}}