{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T13:28:57Z","timestamp":1753882137879,"version":"3.41.2"},"reference-count":6,"publisher":"World Scientific Pub Co Pte Ltd","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2023,5]]},"abstract":"<jats:p> If [Formula: see text] is a simple graph on [Formula: see text] vertices [Formula: see text] and [Formula: see text] be the degree of [Formula: see text]th vertex [Formula: see text] then the average degree matrix of graph [Formula: see text], [Formula: see text] is of order [Formula: see text] whose [Formula: see text]th entry is [Formula: see text] if the vertices [Formula: see text] and [Formula: see text] are adjacent and zero otherwise. The average degree energy of [Formula: see text], [Formula: see text] is the sum of all absolute value of eigenvalues of average degree matrix of a graph [Formula: see text]. In this paper, bounds for average degree energy [Formula: see text] and the relation between average degree energy [Formula: see text] and energy [Formula: see text] is discussed. <\/jats:p>","DOI":"10.1142\/s1793830922501014","type":"journal-article","created":{"date-parts":[[2022,4,28]],"date-time":"2022-04-28T09:43:54Z","timestamp":1651139034000},"source":"Crossref","is-referenced-by-count":0,"title":["Average degree matrix and average degree energy"],"prefix":"10.1142","volume":"15","author":[{"given":"H. S.","family":"Sujatha","sequence":"first","affiliation":[{"name":"Department of Mathematics, Manipal Institute of Technology, Manipal Academy of Higher Education, Manipal 576104, India"}]}],"member":"219","published-online":{"date-parts":[[2022,5,20]]},"reference":[{"key":"S1793830922501014BIB001","first-page":"385","volume":"4","author":"Adiga C.","year":"2009","journal-title":"Int. J. Contemp. Math. Sci."},{"key":"S1793830922501014BIB002","first-page":"239","volume":"64","author":"Bozkurt S. B.","year":"2010","journal-title":"MATCH Commun. Math. Comput. Chem."},{"key":"S1793830922501014BIB003","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1007\/978-3-642-59448-9_13","volume-title":"Algebraic Combinatorics and Applications","author":"Gutman I.","year":"2001"},{"key":"S1793830922501014BIB004","doi-asserted-by":"crossref","first-page":"640","DOI":"10.1063\/1.1674889","volume":"54","author":"McClelland B. J.","year":"1971","journal-title":"J. Chem. Phys."},{"key":"S1793830922501014BIB005","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1155\/2016\/4341919","volume":"2016","author":"Shigehalli V. S.","year":"2016","journal-title":"J. Math."},{"key":"S1793830922501014BIB006","volume-title":"Chemical Graph Theory","author":"Trinajsti\u0107 N.","year":"2019","edition":"2"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830922501014","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,30]],"date-time":"2023-04-30T10:36:45Z","timestamp":1682851005000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S1793830922501014"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,20]]},"references-count":6,"journal-issue":{"issue":"04","published-print":{"date-parts":[[2023,5]]}},"alternative-id":["10.1142\/S1793830922501014"],"URL":"https:\/\/doi.org\/10.1142\/s1793830922501014","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2022,5,20]]},"article-number":"2250101"}}