✦ LIBER ✦

The spectrum of the averaging operator for a finite homogeneous graph

✍ Scribed by A. M. Nikitin

Publisher: Springer US
Year: 1996
Tongue: English
Weight: 586 KB
Volume: 80
Category: Article
ISSN: 1573-8795
DOI: 10.1007/bf02362780

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Eigenvalues of the neutron transport ope

Eigenvalues of the neutron transport operator for a homogeneous finite moderator

✍ Seiji Ukai 📂 Article 📅 1967 🏛 Elsevier Science 🌐 English ⚖ 794 KB

The interchange graph of a finite graph

✍ A. C. M. van Rooij; H. S. Wilf 📂 Article 📅 1965 🏛 Akadmiai Kiad 🌐 English ⚖ 284 KB

Justification of the averaging method fo

Justification of the averaging method for weakly nonlinear operator equations

✍ A. Shtaras 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 398 KB

The average Steiner distance of a graph

✍ Dankelmann, Peter; Oellermann, Ortrud R.; Swart, Henda C. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 384 KB 👁 2 views

The average distance p(G) of a graph G is the average among the distances between all pairs of vertices in G. For n 2 2, the average Steiner n-distance ,4G) of a connected graph G is the average Steiner distance over all sets of n vertices in G. It is shown that for a connected weighted graph G, pu,

On the average genus of a graph

✍ Jonathan L. Gross; E. Ward Klein; Robert G. Rieper 📂 Article 📅 1993 🏛 Springer Japan 🌐 English ⚖ 535 KB

A discreteness criterion for the spectru

A discreteness criterion for the spectrum of a quasielliptic operator

✍ M. G. Gimadislamov 📂 Article 📅 1971 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 235 KB