✦ LIBER ✦

Metric properties of the functions of distances between molecular graphs

✍ Scribed by L. I. Makarov

Book ID: 106427359
Publisher: SP MAIK Nauka/Interperiodica
Year: 2007
Tongue: English
Weight: 96 KB
Volume: 48
Category: Article
ISSN: 0022-4766
DOI: 10.1007/s10947-007-0035-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Distances between the graphs of matrices

✍ Roger A. Horn; Chi-Kwong Li; Dennis I. Merino 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 605 KB

On Properties of a Graph that Depend on

On Properties of a Graph that Depend on its Distance Function

✍ Ladislav Nebeský 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 127 KB

Testing properties of graphs and functio

Testing properties of graphs and functions

✍ László Lovász; Balázs Szegedy 📂 Article 📅 2010 🏛 The Hebrew University Magnes Press 🌐 English ⚖ 426 KB

On the average distance property of comp

On the average distance property of compact connected metric spaces

✍ Sidney A. Morris; Peter Nickolas 📂 Article 📅 1983 🏛 Springer 🌐 English ⚖ 245 KB

Properties of graphs of functions in the

Properties of graphs of functions in the Grzegorczyk hierarchy

✍ S. V. Pakhomov 📂 Article 📅 1976 🏛 Springer US 🌐 English ⚖ 132 KB

On the average Steiner distance of graph

On the average Steiner distance of graphs with prescribed properties

✍ Peter Dankelmann; Henda C. Swart; Ortrud R. Oellermann 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 703 KB

The average n-distance of a connected graph G, p,,(G), is the average of the Steiner distances of all n-sets of vertices of G. In this paper, we give bounds on pn for two-connected graphs and for k-chromatic graphs. Moreover, we show that pn(G) does not depend on the n-diameter of G.