610 KB38 KB200820252014Brankovic, LjiljanaLópez, NachoMiller, MirkaSebé, Francescštevilka:2letnik:7str. 461-477COBISSID:17067353ISSN:1855-3966URN:URN:NBN:SI:doc-QXT9JDA9enDruštvo matematikov, fizikov in astronomov SlovenijeArs mathematica contemporaneadistanceeccentricityproximityradiusremotenessTriangle randomization for social network data anonymization|Let ?$G = (V, E)$? be a connected graph on n vertices. Denote by ?$\overline{l}(G)$? the average distance between all pairs of vertices in ?$G$?. The remoteness ?$\rho(G)$? of a connected graph? $G$? is the maximum average distance from a vertex of ?$G$? to all others. The aim of this paper is to show that two conjectures in M. Aouchiche and P. Hansen, Proximity and remoteness in graphs: results and conjectures, Networks 58 (2011), 95-102. concerned with average distance, radius and remoteness of a graph are trueTEXTznanstveno časopisjejournalsSlovenian National E-content AggregatorNational and University Library of SloveniaUniverza na Primorskem, Fakulteta za naravoslovje, matematiko in informacijske tehnologije