On the canonical metric representation, average distance, and partial Hamming graphsKlavžar, Sandi (Avtor) matematikateorija grafovkanonična metrična reprezentacijaHammingovi grafidelni Hammingovi grafiWienerjev indeksalgoritem prepoznavanjamathematicsgraph theorycononical metric representationHamming graphspartial Hamming graphsWiener indexrecognition algorithmAverage distance of a graph is expressed in terms of its canonical metric representation. The equality can be modified to an inequality in such a way that it characterizes isometric subgraphs of Hamming graphs. This approach simplifies recognition of these graphs and computation of their average distance. Povprečna razdalja grafa je izražena s pomočjo kanonične metrične reprezentacije. Enakost lahko preoblikujemo v neenakost tako, da karakterizira izometrične podgrafe Hammingovih grafov. Ta pristop poenostavlja prepoznavanje teh grafov ter izračun povprečne razdalje.20062015-07-10 14:51:14Članek v reviji51488UDK: 519.17OceCobissID: 25427968COBISS_ID: 13858905ISSN pri članku: 0195-6698NUK URN: URN:SI:UM:DK:SFSYQGVWsl