{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T14:18:11Z","timestamp":1753885091872,"version":"3.41.2"},"reference-count":19,"publisher":"World Scientific Pub Co Pte Ltd","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2025,2]]},"abstract":"<jats:p> The deficiency [Formula: see text] of a vertex [Formula: see text] is the deviation between the degree of the vertex [Formula: see text] and the maximum degree of the graph. The maximum deficiency matrix [Formula: see text] of a simple graph [Formula: see text] is square matrix whose [Formula: see text]th entry is max([Formula: see text], if the vertices [Formula: see text] and [Formula: see text] are adjacent and [Formula: see text], otherwise. Maximum deficiency energy [Formula: see text] is the absolute sum of eigenvalues of maximum deficiency matrix [Formula: see text]. In this paper, we find maximum deficiency energy of some classes of graphs. Moreover, we construct an algorithm and Python 3.8 program to find out spectrum and maximum deficiency energy of [Formula: see text]. <\/jats:p>","DOI":"10.1142\/s1793830924500162","type":"journal-article","created":{"date-parts":[[2024,2,2]],"date-time":"2024-02-02T09:37:00Z","timestamp":1706866620000},"source":"Crossref","is-referenced-by-count":0,"title":["An algorithm and maximum deficiency energy of some graphs"],"prefix":"10.1142","volume":"17","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5224-9321","authenticated-orcid":false,"given":"Omendra","family":"Singh","sequence":"first","affiliation":[{"name":"Department of Mathematics, University of Rajasthan, Jaipur-302004, Rajasthan, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5836-6521","authenticated-orcid":false,"given":"Pravin","family":"Garg","sequence":"additional","affiliation":[{"name":"Department of Mathematics, University of Rajasthan, Jaipur-302004, Rajasthan, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9577-1294","authenticated-orcid":false,"given":"Neha","family":"Kansal","sequence":"additional","affiliation":[{"name":"Department of Mathematics, University of Rajasthan, Jaipur-302004, Rajasthan, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2024,3,19]]},"reference":[{"key":"S1793830924500162BIB001","first-page":"385","volume":"4","author":"Adiga C.","year":"2009","journal-title":"Int. J. Contemp. Math. Sci."},{"key":"S1793830924500162BIB002","first-page":"1823","volume":"5","author":"Adiga C.","year":"2010","journal-title":"Int. Math. Forum"},{"key":"S1793830924500162BIB003","first-page":"722","volume":"269","author":"Alikhani S.","year":"2015","journal-title":"Appl. Math. Comput."},{"key":"S1793830924500162BIB004","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2004.02.038"},{"key":"S1793830924500162BIB005","first-page":"227","volume":"72","author":"Das K. C.","year":"2014","journal-title":"MATCH Commun. Math. Comput. Chem."},{"volume-title":"The Theory of Matrices","year":"1959","author":"Gantmacher F. R.","key":"S1793830924500162BIB006"},{"key":"S1793830924500162BIB007","first-page":"1","volume":"103","author":"Gutman I.","year":"1978","journal-title":"Ber. Math.-Statist. Sekt. Forsch. Graz."},{"key":"S1793830924500162BIB008","first-page":"85","volume":"2","author":"Gutman I.","year":"2017","journal-title":"Math. Interdisc. Res."},{"key":"S1793830924500162BIB009","doi-asserted-by":"publisher","DOI":"10.5562\/cca3189"},{"key":"S1793830924500162BIB010","doi-asserted-by":"publisher","DOI":"10.21236\/AD0705364"},{"key":"S1793830924500162BIB011","first-page":"5","volume":"7","author":"Naji M. A.","year":"2016","journal-title":"Int. J. Sci. Eng. Res."},{"key":"S1793830924500162BIB012","first-page":"371","volume":"79","author":"Jafari Rad N.","year":"2018","journal-title":"MATCH Commun. Math. Comput. Chem."},{"key":"S1793830924500162BIB013","doi-asserted-by":"publisher","DOI":"10.22457\/apam.v13n1a12"},{"key":"S1793830924500162BIB014","first-page":"209","volume":"2","author":"Sharda B.","year":"2017","journal-title":"Math. Interdisc. Res."},{"key":"S1793830924500162BIB015","first-page":"76","volume":"29","author":"Singh O.","year":"2021","journal-title":"Comput. Sci. J. Moldava."},{"key":"S1793830924500162BIB016","first-page":"293","volume":"5","author":"Sowaity M. I.","year":"2017","journal-title":"Int. J. Rec. Innovation Trends Comput. Commun."},{"key":"S1793830924500162BIB017","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2019.05.033"},{"key":"S1793830924500162BIB018","first-page":"441","volume":"60","author":"Zhou B.","year":"2008","journal-title":"MATCH Commun. Math. Comput. Chem."},{"key":"S1793830924500162BIB019","first-page":"513","volume":"57","author":"Zhou B.","year":"2010","journal-title":"Acta Chim. Slov."}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830924500162","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,28]],"date-time":"2025-01-28T04:32:01Z","timestamp":1738038721000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S1793830924500162"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,19]]},"references-count":19,"journal-issue":{"issue":"02","published-print":{"date-parts":[[2025,2]]}},"alternative-id":["10.1142\/S1793830924500162"],"URL":"https:\/\/doi.org\/10.1142\/s1793830924500162","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2024,3,19]]},"article-number":"2450016"}}