{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:09:24Z","timestamp":1750219764938,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,10,21]],"date-time":"2022-10-21T00:00:00Z","timestamp":1666310400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100010026","name":"Beijing Higher Education Young Elite Teacher Project","doi-asserted-by":"publisher","award":["YETP1851"],"award-info":[{"award-number":["YETP1851"]}],"id":[{"id":"10.13039\/501100010026","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,10,21]]},"DOI":"10.1145\/3565387.3565394","type":"proceedings-article","created":{"date-parts":[[2022,12,14]],"date-time":"2022-12-14T01:47:11Z","timestamp":1670982431000},"page":"1-5","source":"Crossref","is-referenced-by-count":0,"title":["The Relative Extrema of Vertex Degree Distances of Dumbbell Graphs"],"prefix":"10.1145","author":[{"given":"Haili","family":"Guo","sequence":"first","affiliation":[{"name":"Beijing City University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,12,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1010767517079"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1021\/ci00021a008"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1021\/ci00021a009"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.7151\/dmgt.1868"},{"key":"e_1_3_2_1_5_1","first-page":"779","article-title":"Steiner Gutman index","volume":"79","author":"Mao Y.","year":"2018","unstructured":"Y. Mao , K.C. Das ( 2018 ), Steiner Gutman index . MATCH Communications in Mathematical and in Computer Chemistry , 79. 779 - 794 Y. Mao, K.C. Das (2018), Steiner Gutman index. MATCH Communications in Mathematical and in Computer Chemistry, 79. 779-794","journal-title":"MATCH Communications in Mathematical and in Computer Chemistry"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/SYNASC49474.2019.00023"},{"key":"e_1_3_2_1_7_1","unstructured":"Z. Du B. Zhou Maximum degree distance of graphs with exactly two cycles Bull. Math. Soc. Sci. Math. Roumanie (N.S.) 54 (102) (2011) 119\u2013136.  Z. Du B. Zhou Maximum degree distance of graphs with exactly two cycles Bull. Math. Soc. Sci. Math. Roumanie (N.S.) 54 (102) (2011) 119\u2013136."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"L. Feng W. Liu A. Ilic\u00b4 G. Yu The degree distance of unicyclic graphs with given matching number Graphs Combin. 29 (2013) 449\u2013462.  L. Feng W. Liu A. Ilic\u00b4 G. Yu The degree distance of unicyclic graphs with given matching number Graphs Combin. 29 (2013) 449\u2013462.","DOI":"10.1007\/s00373-012-1143-5"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1088\/1742-6596\/1302\/4\/042041"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2011.01.013"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2007.09.010"},{"key":"e_1_3_2_1_12_1","first-page":"161","article-title":"Unicyclic connected graphs having smallest degree distances","volume":"97","author":"Tomescu J.","year":"2015","unstructured":"J. Tomescu , S. Kanwal ( 2015 ). Unicyclic connected graphs having smallest degree distances . Utilitas Mathematica , 97 , 161 - 181 . J. Tomescu, S. Kanwal (2015). Unicyclic connected graphs having smallest degree distances. Utilitas Mathematica, 97,161-181.","journal-title":"Utilitas Mathematica"},{"key":"e_1_3_2_1_13_1","first-page":"18","article-title":"The unicyclic graphs with maximum degree distance","volume":"39","author":"Yuan H.","year":"2006","unstructured":"H. Yuan , A. Chang ( 2006 ). The unicyclic graphs with maximum degree distance , J. Math. Study 39 , 18 \u2013 24 . H. Yuan, A. Chang (2006). The unicyclic graphs with maximum degree distance, J. Math. Study 39,18\u201324.","journal-title":"J. Math. Study"},{"key":"e_1_3_2_1_14_1","first-page":"741","article-title":"Ihara zeta function of the dumbbell graph","volume":"26","author":"Kwon S.","year":"2018","unstructured":"S. Kwon and J.-H. Park ( 2018 ). Ihara zeta function of the dumbbell graph . Korean J. Math. 26 , 741 \u2013 746 . S. Kwon and J.-H. Park (2018). Ihara zeta function of the dumbbell graph. Korean J. Math. 26, 741\u2013746.","journal-title":"Korean J. Math."},{"key":"e_1_3_2_1_15_1","volume-title":"A note on the spectral characterization of dumbbell graphs. Linear Algebra and its Applications. 437, 1707\u20131714","author":"Wang J.","year":"2009","unstructured":"J. Wang , Q. Huang , F. Belardo , ( 2009 ). A note on the spectral characterization of dumbbell graphs. Linear Algebra and its Applications. 437, 1707\u20131714 . J. Wang, Q. Huang, F. Belardo, (2009). A note on the spectral characterization of dumbbell graphs. Linear Algebra and its Applications. 437, 1707\u20131714."}],"event":{"name":"CSAE 2022: The 6th International Conference on Computer Science and Application Engineering","acronym":"CSAE 2022","location":"Virtual Event China"},"container-title":["The 6th International Conference on Computer Science and Application Engineering"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3565387.3565394","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3565387.3565394","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:37:13Z","timestamp":1750178233000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3565387.3565394"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,21]]},"references-count":15,"alternative-id":["10.1145\/3565387.3565394","10.1145\/3565387"],"URL":"https:\/\/doi.org\/10.1145\/3565387.3565394","relation":{},"subject":[],"published":{"date-parts":[[2022,10,21]]}}}