✦ LIBER ✦

Theorem on directed graphs, applicable to logic

✍ Scribed by D. J. Shoesmith; T. J. Smiley

Publisher: John Wiley and Sons
Year: 1979
Tongue: English
Weight: 224 KB
Volume: 3
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190030412

No coin nor oath required. For personal study only.

✦ Synopsis

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 which it belongs; and we indicate the application of this result to mathematical logic through the modeling of arguments by graphs.

📜 SIMILAR VOLUMES

A theorem concerning cyclic directed gra

A theorem concerning cyclic directed graphs with applications to network reliability

✍ Randall R. Willie 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 363 KB

Structural theorem on plane graphs with

Structural theorem on plane graphs with application to the entire coloring number

✍ Borodin, Oleg V. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 477 KB 👁 1 views

In 1973, Kronk and Mitchem (Discrete Math. (5) 255-260) conjectured that the vertices, edges and faces of each plane graph G may be colored with D(G) + 4 colors, where D(G) is the maximum degree of G, so that any two adjacent or incident elements receive distinct colors. They succeeded in verifying

Polynomial Factorisation and an Applicat

Polynomial Factorisation and an Application to Regular Directed Graphs

✍ Stephen D. Cohen 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 441 KB

The main theme is the distribution of polynomials of given degree which split into a product of linear factors over a finite field. The work was motivated by the following problem on regular directed graphs. Extending a notion of Chung, Katz has defined a regular directed graph based on the k-algebr

Lagrange's Theorem and Integrality for F

Lagrange's Theorem and Integrality for Finite Commutative Hypergroups with Applications to Strongly Regular Graphs

✍ N.J. Wildberger 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 297 KB

On Structure of Some Plane Graphs with A

On Structure of Some Plane Graphs with Application to Choosability

✍ Peter Che Bor Lam; Wai Chee Shiu; Baogang Xu 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 180 KB

A graph G=(V, E) is (x, y)-choosable for integers x> y 1 if for any given family In this paper, structures of some plane graphs, including plane graphs with minimum degree 4, are studied. Using these results, we may show that if G is free of k-cycles for some k # [3,4,5,6], or if any two triangles

On a Theorem of Halphen and its Applicat

On a Theorem of Halphen and its Application to Integrable Systems

✍ F Gesztesy; K Unterkofler; R Weikard 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 166 KB

We extend Halphen's theorem which characterizes solutions of certain nth-order differential equations with rational coefficients and meromorphic fundamental systems to a first-order n × n system of differential equations. As an application of this circle of ideas we consider stationary rational alge