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

A simple proof of the multiplicativity of directed cycles of prime power length

โœ Scribed by Xuding Zhu

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
346 KB
Volume
36
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A simple proof of the Delsarte inequalit
A simple proof of the Delsarte inequalities
โœ Juriaan Simonis; Cornelis Vroedt ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Springer ๐ŸŒ English โš– 149 KB

The Delsarte inequalities for a code e are proved in two steps: The first inequality for e is derived by a Plotldn-type argument. Then the k-th inequality for C turns out to be :he first inequallty for another code whose codeword list is obtained by taking the sums of k columns from a codeword list

Bounds of the longest directed cycle len
Bounds of the longest directed cycle length for minimal strong digraphs
โœ Zhi-bo Chen; Fu-ji Zhang ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 532 KB

In this paper we present the upper and lower bounds of the longest directed cycle length for minimal strr,ng digraphs in terms of the numbers of vertices and arcs. These bounds are both sharp. In addition, we give analogous results for minimal 2-edge connected graphs.

A simple proof of the characterization o
A simple proof of the characterization of antipodal graphs
โœ Garry Johns ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 88 KB

The antipodal graph A(G) of a graph G is defined as the graph on the same vertex set as G with two vertices being adjacent in A(G) if the distance between them in G is the diameter of G. (If G is disconnected then we define &am(G) = co.) Aravamudhan and Rajendran [l, 21 gave the following character