๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Enumeration of finite field labels on graphs

โœ Scribed by Hirobumi Mizuno; Iwao Sato

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
276 KB
Volume
176
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

โœฆ Synopsis

Let G be a graph, let R be a finite field and F a subgroup of the automorphism group Aut G of G. For a labeling of the vertices of G with elements of R, we consider labelings of the edges of G with elements of R such that the label on each edge is equal to the sum of labels on the two incident vertices. Such an edge labeling is called induced from some vertex labeling. We enumerate the number of F-isomorphism classes of induced edge labelings for G and R.

๐Ÿ“œ SIMILAR VOLUMES

On Parameters of Some Graphs from Finite
On Parameters of Some Graphs from Finite Fields
โœ I.E. Shparlinski ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 79 KB

We generalize the construction of F. R. Chung of graphs from finite fields and estimate their parameters with the help of a new bound of exponential sums due to G. I. Perel'muter and the author.

Computer enumeration of walks on directe
Computer enumeration of walks on directed graphs
โœ K. Balasubramanian ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 526 KB

A vectorized computer code is developed for the enumeration of walks through the matrix power method for directed graphs. Application of this code to several graphs is considered. It is shown that the coefficients in the generating functions for signed graphs are much smaller in magnitude. It is sho