𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Complexity of Defining a Relation on a Finite Graph

✍ Scribed by L. Babai; Gy. Turán

Publisher
John Wiley and Sons
Year
1987
Tongue
English
Weight
702 KB
Volume
33
Category
Article
ISSN
0044-3050

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Number of Slopes of the Graph of
On the Number of Slopes of the Graph of a Function Defined on a Finite Field
✍ A. Blokhuis; S. Ball; A.E. Brouwer; L. Storme; T. Szőnyi 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 116 KB

Given a set U of size q in an affine plane of order q, we determine the possibilities for the number of directions of secants of U, and in many cases characterize the sets U with given number of secant directions.

Constructing a Short Defining Set of Rel
Constructing a Short Defining Set of Relations for a Finite Group
✍ Volker Gebhardt 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 142 KB

An algorithm for the construction of a defining set of relations w.r.t. a given set of generators of a finite group G is presented. Compared with previously known methods it yields fewer relations and is better suited for iterated application to large groups. These improvements are achieved by consi

On the hamiltonian path graph of a graph
On the hamiltonian path graph of a graph
✍ George R. T. Hendry 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 491 KB 👁 1 views

The hamiltonian path graph H(F) of a graph F is that graph having the same vertex set as F and in which two vertices u and u are adjacent if and only if F contains a hamiltonian u -u path. First, in response to a conjecture of Chartrand, Kapoor and Nordhaus, a characterization of nonhamiltonian grap