Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 157 for “"Digraph"”.
-
Algebraic Digraph Theory
… graphs. In this thesis, we consider the case of digraphs. We show that it is not the spectrum of the adjacency matrix that is important but rather the unitary equivalence class to which it belongs. For undirected graphs, the adjacency matrix is symmetric and therefore its unitary equivalence …
-
DIGRAPH GROUPS AND RELATED GROUPS
This thesis investigates finite digraph groups and related groups like the generalization of Johnson and Mennicke groups. Cuno and Williams introduced the term "digraph group" for the first time in [9], 2020. The groups are defined by non-empty presentations and each relator is in the form R(x, y), …
-
Digraph Algebras over Discrete Pre-ordered Groups
… of G generated by G⁺, and C_i = A(Q_i) are digraph algebras defined by considering certain pre-ordered subsets Q_i of G. The 16-dimensional algebra A₄ of real sedenions is obtained by applying the Cayley-Dickson doubling process to the real division algebra of octonions. The classification …
-
On the domination number of a digraph
Thesis (Ph. D.)--Michigan State University. Department of Mathematics, 1994
-
A Study on Graph Coloring and Digraph Connectivity
… problems in graphs and connectivity problems in digraphs. We obtain the following advances in both directions.;1. Results in graph coloring. For integers k,r > 0, a (k,r)-coloring of a graph G is a proper coloring on the vertices of G with k colors such that every vertex v of degree d( v) is …
-
On locating the simple cycles in a digraph
… is stated for finding the simple cycles in a digraph which is believed to be superior to previous algorithms. The algorithm is stated in a way which lends itself to use on a digital computer. Suitable modifications are presented which allow the algorithm to be applied to coalesced graphs. …
-
The Angel Problem, Positional Games, and Digraph Roots
… strategies for either player. The complexity of digraph root computation Multiplication of square Boolean matrices, if interpreted as adjacency matrices of directed graphs, induces a notion of powers for digraphs. We show that computing roots of Boolean matrices or, equivalently, of directed …
-
Causal digraph reasoning for fault diagnosis in paper making applications
… applications with complex processes. The causal digraph method has been subjected to three development phases: signed digraph, fuzzy digraph and dynamic digraph. Being versatile with cause-effect models, the causal digraph method is able to utilize the benefits of both qualitative and …
-
The complexity of digraph homomorphisms: Local tournaments, injective homomorphisms and polymorphisms
… examine the computational complexity of certain digraph homomorphism problems. A homomorphism between digraphs, denoted by $f: G \to H$, is a mapping from the vertices of $G$ to the vertices of $H$ such that the arcs of $G$ are preserved. The problem of deciding whether a homomorphism to a fixed …
-
Computational complexity of digraph decomposition and the congruence extension property for algebras
… to find the prime factorizations of such digraphs. This is an extension of Feigenbaum and Schaffer's work on factoring undirected graphs under the strong direct product and Imrich's work on factoring undirected graphs with respect to the weak direct product. We also investigate the problem …
-
A Machine Learning Based Approach for Fast Demand Characterization of Digraph Tasks
… such as self-driving cars can be modeled using digraph tasks. A digraph task consists of vertices, which denote computations, and directed edges, which capture inter-task dependencies. In contrast to simpler real-time task models such as the sporadic task model, digraphs are more expressive and …
-
Some Results for FO-definable Constraint Satisfaction Problems Described by Digraph Homomorphisms
… and give characterization results based on digraph properties. Where previous studies focused on CSPs defined by a single digraph with lists we extend our relational structures to consist of many binary relations which each individually describe a distinct digraph on the structures universe. …
-
MODELING AN ISLAMIC ECONOMIC SYSTEM: AN INTERACTION DELIVERY MATRIX AND BOOLEAN DIGRAPH APPROACH
… relations, transitivity, binary matrices, digraphs, adjacent matrix are used and the obtained adjacent matrix is transformed into Boolean reachability matrix. The reachability matrix with regard to each contextual relation and their related hierarchial digraph are shown. Finally, the impact …
-
Intersection representations of graphs and digraphs
A digraph is an interval digraph if each vertex can be assigned a source interval and a sink interval on the real line such that there is an edge from u to v if and only if the source interval for u intersects the sink interval for v. A digraph is an indifference digraph or unit interval digraph if …
-
A study on supereulerian digraphs and spanning trails in digraphs
A strong digraph D is eulerian if for any v ∈ V (D), d+D (v) = d−D (v). A digraph D is supereulerian if D contains a spanning eulerian subdigraph, or equivalently, a spanning closed directed trail. A digraph D is trailable if D has a spanning directed trail. This dissertation focuses on a study of …
-
A study on Dicycles and Eulerian Subdigraphs
… oriented graphs. A dicycle cover of a digraph D is a family F of dicycles of D such that each arc of D lies in at least one dicycle in F. We investigate the problem of determining the upper bounds for the minimum number of dicycles which cover all arcs in a strong digraph. Best possible …
-
Synchronizable test sequence generation for protocol conformance testing.
… of such a sequence for a given FSM. A duplex digraph method is developed which transforms the order-specified digraph representing an FSM into a duplex digraph. Using the duplex digraph representation of a given FSM, a polynomial time algorithm is developed to generate a synchronizable test …
-
ASPECTS OF UNIQUE D-COLORABILITY FOR DIGRAPHS
We prove that for every digraph $C$ and every choice of positive integers $k$ and $\ell$ there exists a digraph $D$ with girth at least $\ell$ together with a surjective acyclic homomorphism $c:D\rightarrow C$ such that (i) for every digraph $C'$ with at most $k$ vertices, there exists an acyclic …
-
ASPECTS OF UNIQUE D-COLORABILITY FOR DIGRAPHS
We prove that for every digraph $C$ and every choice of positive integers $k$ and $\ell$ there exists a digraph $D$ with girth at least $\ell$ together with a surjective acyclic homomorphism $c:D\rightarrow C$ such that (i) for every digraph $C'$ with at most $k$ vertices, there exists an acyclic …
Page 1 of 8