{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T10:59:32Z","timestamp":1778497172513,"version":"3.51.4"},"reference-count":17,"publisher":"World Scientific Pub Co Pte Ltd","issue":"06","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2024,8]]},"abstract":"<jats:p> The entropy of a graph is an information-theoretic quantity which expresses the complexity of a graph. Entropy functions have been used successfully to capture different aspects of graph complexity. The generalized graph entropies result from applying information measures to a graph using various schemes for defining probability distributions over the elements of the graph. In this paper, we investigate the complexity of a class of composite graphs based on subdivision graphs and corona product evaluating the generalized graph entropies, and we present explicit formulae for the complexity of subdivision-corona type product graphs. <\/jats:p>","DOI":"10.1142\/s1793830923500799","type":"journal-article","created":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T15:31:02Z","timestamp":1694619062000},"source":"Crossref","is-referenced-by-count":1,"title":["Generalized entropies of subdivision-corona networks"],"prefix":"10.1142","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9179-3648","authenticated-orcid":false,"given":"Zeynep Ni\u0307han","family":"Berberler","sequence":"first","affiliation":[{"name":"Department of Computer Science, Dokuz Eylul University, Izmir 35160, Turkey"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2023,9,26]]},"reference":[{"key":"S1793830923500799BIB001","first-page":"65","volume":"7","author":"Bonchev D.","year":"1979","journal-title":"MATCH Commun. Math. Comput. Chem."},{"key":"S1793830923500799BIB002","volume-title":"Information Theoretic Indices for Characterization of Chemical Structures","author":"Bonchev D.","year":"1983"},{"key":"S1793830923500799BIB003","volume-title":"An Introduction to the Theory of Graph Spectra","author":"Cvetkovi\u0107 D. M.","year":"2010"},{"key":"S1793830923500799BIB004","doi-asserted-by":"publisher","DOI":"10.1007\/BF01902599"},{"key":"S1793830923500799BIB005","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2007.12.010"},{"key":"S1793830923500799BIB006","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2010.08.041"},{"key":"S1793830923500799BIB007","first-page":"147","volume":"67","author":"Dehmer M.","year":"2012","journal-title":"MATCH Commun. Math. Comput. Chem."},{"key":"S1793830923500799BIB008","doi-asserted-by":"publisher","DOI":"10.5562\/cca2294"},{"key":"S1793830923500799BIB009","doi-asserted-by":"publisher","DOI":"10.1016\/0009-2614(72)85099-1"},{"key":"S1793830923500799BIB010","first-page":"411","volume-title":"Transactions of the 6th Prague Conf. Information Theory","author":"K\u00f6rner J.","year":"1973"},{"key":"S1793830923500799BIB011","first-page":"470","volume":"259","author":"Li X.","year":"2015","journal-title":"Appl. Math. Comput."},{"key":"S1793830923500799BIB012","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2012.12.033"},{"key":"S1793830923500799BIB014","doi-asserted-by":"publisher","DOI":"10.1007\/BF02476948"},{"key":"S1793830923500799BIB015","first-page":"547","volume-title":"Proc. 4th Berkeley Symp. Mathematics Statistics and Probability","author":"R\u00e9nyi P.","year":"1961"},{"key":"S1793830923500799BIB016","volume-title":"The Mathematical Theory of Communication","author":"Shannon C. E.","year":"1949"},{"key":"S1793830923500799BIB017","volume-title":"Introduction to Graph Theory","author":"West D. B.","year":"2001"},{"key":"S1793830923500799BIB018","first-page":"461","volume":"71","author":"Xu K.","year":"2014","journal-title":"MATCH Commun. Math. Comput. Chem."}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830923500799","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,23]],"date-time":"2024-07-23T03:01:15Z","timestamp":1721703675000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S1793830923500799"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,26]]},"references-count":17,"journal-issue":{"issue":"06","published-print":{"date-parts":[[2024,8]]}},"alternative-id":["10.1142\/S1793830923500799"],"URL":"https:\/\/doi.org\/10.1142\/s1793830923500799","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,9,26]]},"article-number":"2350079"}}