✦ LIBER ✦

Line digraphs and coreflexive vertex sets

✍ Scribed by Xinming Liu; Douglas B. West

Book ID: 108316242
Publisher: Elsevier Science
Year: 1998
Tongue: English
Weight: 441 KB
Volume: 188
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(98)00022-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Large vertex symmetric digraphs

✍ J. Gómez 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 189 KB

Functions and line digraphs

✍ Amine El Sahili 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 84 KB

## Abstract Consider two maps __f__ and __g__ from a set __E__ into a set __F__ such that __f__(__x__) ≠ g(__x__) for every __x__ in __E__. Suppose that there exists a positive integer __n__ such that for any element __z__ in __F__ either __f__^−1^(__z__) or __g__^−1^(__z__) has at most __n__ eleme

Polynomial addition sets and polynomial

Polynomial addition sets and polynomial digraphs

✍ S.L. Ma 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 872 KB

Permutation Groups, Vertex-transitive Di

Permutation Groups, Vertex-transitive Digraphs and Semiregular Automorphisms

✍ D. Maru s̆c̆; R. Scapellato 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 120 KB

A nonidentity element of a permutation group is said to be semiregular if all of its orbits have the same length. The work in this paper is linked to [6] where the problem of existence of semiregular automorphisms in vertex-transitive digraphs was posed. It was observed there that every vertextransi

Kernels and partial line digraphs

✍ C. Balbuena; M. Guevara 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 274 KB

Vertex heaviest paths and cycles in quas

Vertex heaviest paths and cycles in quasi-transitive digraphs

✍ Jørgen Bang-Jensen; Gregory Gutin 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 381 KB

A digraph D is called a quasi-transitive digraph (QTD) if for any triple x,y,z of distinct vertices of D such that (x,y) and (y,z) are arcs of D there is at least one at': from x to z or from z to x. Solving a conjecture by Bangdensen and Huang (1995), Gutin (1995) described polynomial algorithms fo