On the canonical metric representation, average distance, and partial Hamming graphs

Abstract

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.

Keywords

matematika;teorija grafov;kanonična metrična reprezentacija;Hammingovi grafi;delni Hammingovi grafi;Wienerjev indeks;algoritem prepoznavanja;ne zaključna dela;mathematics;graph theory;cononical metric representation;Hamming graphs;partial Hamming graphs;Wiener index;recognition algorithm;

Data

Language:	English
Year of publishing:	2006
Typology:	1.01 - Original Scientific Article
Organization:	UM PEF - Faculty of Education
UDC:	519.17
COBISS:	13858905
ISSN:	0195-6698
Views:	27
Downloads:	10
Average score:	0 (0 votes)
Metadata:

Other data

Secondary language:	Unknown
Secondary title:	O kanonični metrični reprezentaciji, povprečni razdalji in delnih Hammingovih grafih
Secondary abstract:	Average 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.
Secondary keywords:	Teorija grafov;
Type (COBISS):	Not categorized
Pages:	str. 68-73
Volume:	ǂVol. ǂ27
Issue:	ǂno. ǂ1
Chronology:	2006
DOI:	10.1016/j.ejc.2004.07.008
ID:	1472438