𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On persistent directed graphs

✍ Scribed by Jorgen Bang-Jensen; Tibor Jordán

Publisher
John Wiley and Sons
Year
2008
Tongue
English
Weight
209 KB
Volume
52
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On antimagic directed graphs
On antimagic directed graphs
✍ Dan Hefetz; Torsten Mütze; Justus Schwartz 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 139 KB

## Abstract An antimagic labeling of an undirected graph __G__ with __n__ vertices and __m__ edges is a bijection from the set of edges of __G__ to the integers {1, …, __m__} such that all __n__ vertex sums are pairwise distinct, where a vertex sum is the sum of labels of all edges incident with th

Directed hamiltonian graphs
Directed hamiltonian graphs
✍ Yannis Manoussakis 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 386 KB

## Abstract We give a new condition involving degrees sufficient for a digraph to be hamiltonian.

Theorem on directed graphs, applicable t
Theorem on directed graphs, applicable to logic
✍ D. J. Shoesmith; T. J. Smiley 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 224 KB

## Abstract A semicycle is said to turn at a point __a__ if the arcs incident to __a__ are both to it or both from it. We prove that if a nonempty set of points of a finite directed graph contains a turning point of each semicycle, then one of its members is a turning point of every semicycle to wh

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