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 5 of 5 for “"mixed graphs"”.
-
Decompositions of Mixed Graphs with Partial Orientations of the P<sub>4</sub>.
… the partition is isomorphic to <em>G</em>. A <em>mixed graph</em> on <em>V</em> vertices is an ordered pair (<em>V</em>,<em>C</em>), where <em>V</em> is a set of vertices, |<em>V</em>| = <em>v</em>, and <em>C</em> is a set of ordered and unordered pairs, denoted (<em>x</em>, <em>y</em>) and …
-
Bicyclic Mixed Triple Systems.
… condition for the existence of a <em>bicyclic mixed triple system</em> based on the three possible partial orientations of the 3-cycle with twice as many arcs as edges. We also explore the existence of <em>rotational</em> and <em>reverse mixed triple systems</em>. Our principal proof technique …
-
Diameter, Girth And Other Properties Of Highly Symmetric Graphs
… with the unifying theme being the properties of graphs which have a high degree of symmetry. In the degree-diameter problem, we consider the question of finding asymptotically large graphs of given degree and diameter. We improve a number of the current best published results in the case of …
-
Statistical Methods for Off-Policy Learning
… in problems described by acyclic directed mixed graphs (ADMGs). The conditions generalise the existing notion of “sequential ignorability” from the DTR literature by introducing a collection of variables—referred to as the “state”—that fully summarises the system dynamics and allows the …
-
The Last of the Mixed Triple Systems.
… we consider the decomposition of the complete mixed graph on <em>v</em> vertices denoted <em>M<sub>v</sub></em>, into every possible mixed graph on three vertices which has (like <em>M<sub>v</sub></em>) twice as many arcs as edges. Direct constructions are given in most cases. Decompositions of …