{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T18:41:55Z","timestamp":1751913715951},"reference-count":6,"publisher":"Wiley","issue":"4","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":6311,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1989,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The <jats:italic>mean distance<\/jats:italic>, \u03bc(<jats:italic>G<\/jats:italic>), of a graph <jats:italic>G<\/jats:italic> is the arithmetic mean of the distances in <jats:italic>G<\/jats:italic>. Upper and lower bounds for the mean distance of a self\u2010complementary graph of given order are obtained and the extremal grpahs are determined. It is shown that if <jats:italic>t<\/jats:italic> \u2265 2 is rational, then there exist (1) graphs with arbitrarily low or high edge density, (2) bipartite graphs and (3) oriented graphs with mean distance equal to <jats:italic>t<\/jats:italic>, and also (4) trees and (5) tournaments with mean distance arbitrarily close to <jats:italic>t<\/jats:italic>. A number of open problems are mentioned.<\/jats:p>","DOI":"10.1002\/net.3230190405","type":"journal-article","created":{"date-parts":[[2007,5,12]],"date-time":"2007-05-12T03:18:02Z","timestamp":1178939882000},"page":"451-457","source":"Crossref","is-referenced-by-count":8,"title":["On mean distance in certain classes of graphs"],"prefix":"10.1002","volume":"19","author":[{"given":"George R. T.","family":"Hendry","sequence":"first","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(77)90144-3"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(74)90053-7"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190100205"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190080102"},{"key":"e_1_2_1_6_2","first-page":"619","article-title":"A graph with mean distance being a given rational","volume":"18","author":"Truszczy\u0144ski M.","year":"1985","journal-title":"Demonstratio Math."},{"key":"e_1_2_1_7_2","unstructured":"P.Winkler(personal communication)."}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230190405","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230190405","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,22]],"date-time":"2023-10-22T08:44:35Z","timestamp":1697964275000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230190405"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,7]]},"references-count":6,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1989,7]]}},"alternative-id":["10.1002\/net.3230190405"],"URL":"https:\/\/doi.org\/10.1002\/net.3230190405","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,7]]}}}