summary:The well known types of routes in graphs and directed graphs, such as walks, trails, paths, and induced paths, are characterized using axioms on vertex sequences. Thus non-graphic characterizations of the various types of routes are obtained
Coordinated Science Laboratory was formerly known as Control Systems LaboratoryContract DA-28-043-AM...
In this paper, we introduce a path algebra well suited for navigation in environments that can be ab...
summary:A (finite) acyclic connected graph is called a tree. Let $W$ be a finite nonempty set, and l...
summary:The well known types of routes in graphs and directed graphs, such as walks, trails, paths, ...
summary:The concept of a route system was introduced by the present author in [3].Route systems of a...
One of the main advantages of the Logic of Nested Conditions, defined by Habel and Pennemann, for re...
A simple graph G = (V, E) consists of V , a nonempty set of vertices, and E, a set of unordered pair...
summary:A transit function $R$ on a set $V$ is a function $R\:V\times V\rightarrow 2^{V}$ satisfying...
The geodesic structure of a graphs appears to be a very rich structure. There are many ways to descr...
AbstractAn ordered pair (U,R) is called a signpost system if U is a finite nonempty set, R⊆U×U×U, an...
Binary relations are one of the standard ways to encode, characterise and reason about graphs. Rela...
summary:By a chordal graph is meant a graph with no induced cycle of length $\ge 4$. By a ternary sy...
summary:Let $G$ be a (finite undirected) connected graph (with no loop or multiple edge). The set $\...
summary:In [3], the present author used a binary operation as a tool for characterizing geodetic gra...
This paper describes the general concept of Route Graphs, to be used for navigation by various agent...
Coordinated Science Laboratory was formerly known as Control Systems LaboratoryContract DA-28-043-AM...
In this paper, we introduce a path algebra well suited for navigation in environments that can be ab...
summary:A (finite) acyclic connected graph is called a tree. Let $W$ be a finite nonempty set, and l...
summary:The well known types of routes in graphs and directed graphs, such as walks, trails, paths, ...
summary:The concept of a route system was introduced by the present author in [3].Route systems of a...
One of the main advantages of the Logic of Nested Conditions, defined by Habel and Pennemann, for re...
A simple graph G = (V, E) consists of V , a nonempty set of vertices, and E, a set of unordered pair...
summary:A transit function $R$ on a set $V$ is a function $R\:V\times V\rightarrow 2^{V}$ satisfying...
The geodesic structure of a graphs appears to be a very rich structure. There are many ways to descr...
AbstractAn ordered pair (U,R) is called a signpost system if U is a finite nonempty set, R⊆U×U×U, an...
Binary relations are one of the standard ways to encode, characterise and reason about graphs. Rela...
summary:By a chordal graph is meant a graph with no induced cycle of length $\ge 4$. By a ternary sy...
summary:Let $G$ be a (finite undirected) connected graph (with no loop or multiple edge). The set $\...
summary:In [3], the present author used a binary operation as a tool for characterizing geodetic gra...
This paper describes the general concept of Route Graphs, to be used for navigation by various agent...
Coordinated Science Laboratory was formerly known as Control Systems LaboratoryContract DA-28-043-AM...
In this paper, we introduce a path algebra well suited for navigation in environments that can be ab...
summary:A (finite) acyclic connected graph is called a tree. Let $W$ be a finite nonempty set, and l...
DOI
Add to ORKG