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 140 for “"digraphs"”.
-
On chordal digraphs and semi-strict chordal digraphs
… Haskins and Rose introduced the class of chordal digraphs as a digraph analogue of chordal graphs. Chordal digraphs can be defined in terms of vertex orderings and several results about chordal graphs can be extended to chordal digraphs. However, a forbidden subdigraph characterization of chordal …
-
Interval Digraphs
… introduced directed interval graphs or interval digraphs as a natural extension of the undirected interval graph. In this dissertation, we introduce a second type of interval digraphs and demonstrate that there exist separating examples for the two classes of graphs. We study properties of and …
-
A study on supereulerian digraphs and spanning trails in digraphs
… dissertation focuses on a study of trailable digraphs and supereulerian digraphs from the following aspects. 1. Strong Trail-Connected, Supereulerian and Trailable Digraphs. For a digraph D, D is trailable digraph if D has a spanning trail. A digraph D is strongly trail- connected if for any …
-
Chronological rectangle digraphs
… interval graphs, called chronological interval digraphs, has recently been identified and studied. We introduce the class of chronological rectangle digraphs, and show that they are a higher dimensional analogue of chronological interval digraphs. A main goal of this thesis is to establish a …
-
On Supereulerian Digraphs
… which has been verified in several families of digraphs. There have been investigations on supereulerian properties of a graph G with given inequality constraints on kappa'(G), alpha(G) and alpha'( G), as seen in [1], [15], [18], [22] and [23], among others. In [5], Bang-Jensen and Maddaloni …
-
Zero Divisors among Digraphs
This thesis generalizes to digraphs certain recent results about graphs. There are special digraphs C such that AxC is isomorphic to BxC for some pair of distinct digraphs A and B. Lovasz named these digraphs C zero-divisors and completely characterized their structure. Knowing that all directed …
-
On highly regular digraphs
… between the finite incidence structures and digraphs, we verify the existence and non-existence of $1\frac{1}{2}$-designs with certain parameters by the existence and non-existence of corresponding digraphs, and vice versa. We also classify DSRGs of given parameters according to isomorphism …
-
Digraphs modulo primitive positive constructability
… In this way, we define the poset of all finite digraphs ordered by primitive positive constructability. This poset, which is the object studied in this dissertation, is important for studying the complexity of constraint satisfaction problems and for studying clones ordered by minion …
-
Energy of graphs and digraphs
… comprehensive study on the energy of graphs and digraphs. In Chapter 3, we review some existing upper and lower bounds for the energy of a graph. We come up with some new results in this chapter. A graph with n vertices is hyper-energetic if its energy is greater than 2n−2. Some classes of graphs …
-
Zero Forcing in Graphs and Digraphs
No abstract prepared.
-
Minors and planar embeddings of digraphs
… local rotation at each vertex. Clustered planar digraphs have planar embeddings in which, at each vertex, all of the in-arcs occur sequentially in the local rotation. Three different variations of minors are presented, each of which produces a finite set of obstructions to clustered planarity. …
-
Paths and cycles in semicomplete digraphs.
… these theorems are also true for semicomplete digraphs. The focus is on theorems pertaining to the arc-pancyclic property of semicomplete digraphs. Three very useful lemmas are presented: Thomassen's Hamiltonian Path Lemma, The Crossing Arcs Lemma for Reduction, and The Crossing Arcs Lemma for …
-
D-colorable digraphs with large girth
… in a digraph setting.</p> <p>Let C and D be digraphs. A mapping f:V(D)&rarr V(C) is a C-coloring if for every arc uv of D, either f(u)f(v) is an arc of C or f(u)=f(v), and the preimage of every vertex of C induces an acyclic subdigraph in D. We say that D is C-colorable if it admits a …
-
D-colorable digraphs with large girth
… in a digraph setting.</p> <p>Let C and D be digraphs. A mapping f:V(D)&rarr V(C) is a C-coloring if for every arc uv of D, either f(u)f(v) is an arc of C or f(u)=f(v), and the preimage of every vertex of C induces an acyclic subdigraph in D. We say that D is C-colorable if it admits a …
Page 1 of 7