𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Arithmetic graphs

✍ Scribed by B. D. Acharya; S. M. Hegde


Publisher
John Wiley and Sons
Year
1990
Tongue
English
Weight
849 KB
Volume
14
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis


Abstract

A (p, q)‐graph G is said to be (k, d)‐arithmetic if its vertices can be assigned distinct nonnegative integers so that the values of the edges, obtained as the sums of the numbers assigned to their end vertices, can be arranged in the arithmetic progression k, k + d, k + 2__d__, …, k + (q ‐ 1)d. In this paper we initiate a study on the structures of finite (k, d)‐arithmetic graphs.


πŸ“œ SIMILAR VOLUMES


Geometry of arithmetic graphs
✍ Yu. G. Grigor'yan πŸ“‚ Article πŸ“… 1983 πŸ› Springer US 🌐 English βš– 504 KB
On Zeta Functions of Arithmetically Defi
✍ Ortwin Scheja πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 262 KB

We study the graph X(n) that is de"ned as the "nite part of the quotient (n)!T, with T the Bruhat}Tits tree over % O ((1/ΒΉ )) and (n) the principal congruence subgroup of "GΒΈ(% We give concrete realizations of the ΒΈ-functions of the "nite part of the hal#ine !T for "nite unitary representations of