𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Monochromatic directed walks in arc-colored directed graphs

✍ Scribed by N. Alon

Publisher
Akadmiai Kiad
Year
1987
Tongue
English
Weight
258 KB
Volume
49
Category
Article
ISSN
1588-2632

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Arc-disjoint in-trees in directed graphs
Arc-disjoint in-trees in directed graphs
✍ Naoyuki Kamiyama; Naoki Katoh; Atsushi Takizawa πŸ“‚ Article πŸ“… 2009 πŸ› Springer-Verlag 🌐 English βš– 752 KB
Walks on Directed Graphs and Matrix Poly
Walks on Directed Graphs and Matrix Polynomials
✍ Miguel A. MΓ©ndez πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 166 KB

We give a matrix generalization of the family of exponential polynomials in one variable , k (x). Our generalization consists of a matrix of polynomials 8 k (X)= (8 (k) i, j (X)) n i, j=1 depending on a matrix of variables X=(x i, j ) n i, j=1 . We prove some identities of the matrix exponential pol

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

Directed triangles in directed graphs
Directed triangles in directed graphs
✍ M. de Graaf; A. Schrijver; P.D. Seymour πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 212 KB

de Graaf, M., A. Schrijver and P.D. Seymour, Directed triangles in directed graphs, Discrete Mathematics 110 (1992) 279-282. h on n vertices, each with indegree and outdegree at least n/t, contains a directed circuit of length at most