{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T06:35:41Z","timestamp":1764570941611,"version":"3.37.3"},"reference-count":18,"publisher":"World Scientific Pub Co Pte Ltd","issue":"04","funder":[{"DOI":"10.13039\/501100006312","name":"South African Agency for Science and Technology Advancement","doi-asserted-by":"publisher","award":["126894"],"award-info":[{"award-number":["126894"]}],"id":[{"id":"10.13039\/501100006312","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2021,8]]},"abstract":"<jats:p>For [Formula: see text], we define the general eccentric distance sum of a connected graph [Formula: see text] as [Formula: see text], where [Formula: see text] is the vertex set of [Formula: see text], [Formula: see text] is the eccentricity of a vertex [Formula: see text] in [Formula: see text], [Formula: see text] and [Formula: see text] is the distance between vertices [Formula: see text] and [Formula: see text] in [Formula: see text]. This index generalizes several other indices of graphs. We present some bounds on the general eccentric distance sum for general graphs, bipartite graphs and trees of given order, graphs of given order and vertex connectivity and graphs of given order and number of pendant vertices. The extremal graphs are presented as well.<\/jats:p>","DOI":"10.1142\/s1793830921500464","type":"journal-article","created":{"date-parts":[[2020,12,12]],"date-time":"2020-12-12T03:35:46Z","timestamp":1607744146000},"page":"2150046","source":"Crossref","is-referenced-by-count":2,"title":["General eccentric distance sum of graphs"],"prefix":"10.1142","volume":"13","author":[{"given":"Tom\u00e1\u0161","family":"Vetr\u00edk","sequence":"first","affiliation":[{"name":"Department of Mathematics and Applied Mathematics, University of the Free State, Bloemfontein, South Africa"}]}],"member":"219","published-online":{"date-parts":[[2020,12,11]]},"reference":[{"key":"S1793830921500464BIB001","doi-asserted-by":"publisher","DOI":"10.1088\/1742-6596\/1375\/1\/012065"},{"key":"S1793830921500464BIB002","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2013.06.003"},{"key":"S1793830921500464BIB003","doi-asserted-by":"publisher","DOI":"10.1142\/S0218348X19500166"},{"key":"S1793830921500464BIB004","doi-asserted-by":"publisher","DOI":"10.1142\/S1793830920500159"},{"key":"S1793830921500464BIB005","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2013.05.023"},{"key":"S1793830921500464BIB006","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-247X(02)00373-6"},{"issue":"2","key":"S1793830921500464BIB007","first-page":"417","volume":"71","author":"Hemmasi M.","year":"2014","journal-title":"MATCH Commun. Math. Comput. Chem."},{"key":"S1793830921500464BIB008","first-page":"65","volume":"100","author":"Hua H.","year":"2016","journal-title":"Util. Math."},{"key":"S1793830921500464BIB009","doi-asserted-by":"publisher","DOI":"10.1016\/j.jmaa.2011.04.054"},{"key":"S1793830921500464BIB010","doi-asserted-by":"publisher","DOI":"10.1016\/j.jmaa.2011.02.086"},{"key":"S1793830921500464BIB011","doi-asserted-by":"publisher","DOI":"10.1016\/j.jmaa.2015.05.032"},{"issue":"4","key":"S1793830921500464BIB012","first-page":"231","volume":"9","author":"Mazorodze J. P.","year":"2020","journal-title":"Trans. Comb."},{"key":"S1793830921500464BIB013","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2014.05.019"},{"key":"S1793830921500464BIB014","doi-asserted-by":"publisher","DOI":"10.5614\/ejgta.2017.5.1.6"},{"key":"S1793830921500464BIB015","doi-asserted-by":"publisher","DOI":"10.1142\/S1793830920500524"},{"key":"S1793830921500464BIB016","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2020.03.051"},{"key":"S1793830921500464BIB017","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1016\/j.amc.2019.04.022","volume":"359","author":"Xie Y.-T.","year":"2019","journal-title":"Appl. Math. Comput."},{"key":"S1793830921500464BIB018","doi-asserted-by":"publisher","DOI":"10.1016\/j.jmaa.2010.08.054"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830921500464","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,27]],"date-time":"2023-10-27T23:49:19Z","timestamp":1698450559000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830921500464"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,12,11]]},"references-count":18,"journal-issue":{"issue":"04","published-print":{"date-parts":[[2021,8]]}},"alternative-id":["10.1142\/S1793830921500464"],"URL":"https:\/\/doi.org\/10.1142\/s1793830921500464","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2020,12,11]]}}}