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.
β¦ LIBER β¦
On the modeling and design of piezocomposites with prescribed properties
β Scribed by I. Sevostianov; V. Levin; M. Kachanov
- Publisher
- Springer
- Year
- 2001
- Tongue
- English
- Weight
- 215 KB
- Volume
- 71
- Category
- Article
- ISSN
- 0939-1533
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
On the average Steiner distance of graph
β
Peter Dankelmann; Henda C. Swart; Ortrud R. Oellermann
π
Article
π
1997
π
Elsevier Science
π
English
β 703 KB
On the asymptotic properties of extremal
β
J. L. Walsh
π
Article
π
1960
π
Springer-Verlag
π
French
β 350 KB
Design and application of layered compos
β
Jae Seok Choi; Jeonghoon Yoo
π
Article
π
2009
π
John Wiley and Sons
π
English
β 964 KB
## Abstract This research aims to design the microstructure with the prescribed magnetic permeability and proposes a design method to control the magnetic flux flow using layered microstructures. In the optimization problem for the microstructure design, the objective function is set up to minimize
On 2βFactors with Prescribed Properties
β
Jin Yan; Gui Zhen Liu
π
Article
π
2006
π
Institute of Mathematics, Chinese Academy of Scien
π
English
β 154 KB
Universal models of linear operators wit
β
V. A. Zolotarev
π
Article
π
1990
π
Springer US
π
English
β 299 KB
On the modeling and solving of the truss
β
R. Levy; H.-H. Su; M. KoΔvara
π
Article
π
2004
π
Springer-Verlag
π
English
β 448 KB