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 17 of 17 for “"mixed graph"”.
-
Decompositions of the Complete Mixed Graph by Mixed Stars
In the study of mixed graphs, a common question is: What are the necessary and suffcient conditions for the existence of a decomposition of the complete mixed graph into isomorphic copies of a given mixed graph? Since the complete mixed graph has twice as many arcs as edges, then an obvious …
-
Mixed Graph Signal Analysis of Joint Image Denoising and Interpolation
… denoising and interpolation operations from a graph signal processing (GSP) perspective. Specifically, we first develop two theorems that show one-to-one mappings between (pseudo-)linear denoisers / interpolators and undirected / directed graph filters that are solutions to variational …
-
Gamma-Switchable 2-Colourings of (m,n)-Mixed Graphs
A $(m,n)$-mixed graph is a mixed graph whose edges are assigned one of $m$ colours, and whose arcs are assigned one of $n$ colours. Let $G$ be a $(m,n)$-mixed graph and $\pi=(\alpha,\beta,\gamma_1,\gamma_2,\ldots,\gamma_n)$ be a $(n+2)$-tuple of permutations from $S_m \times S_n \times S_2^n$. We …
-
The Last of the Mixed Triple Systems.
… we consider the decomposition of the complete mixed graph on v vertices denoted Mv, into every possible mixed graph on three vertices which has (like Mv) twice as many arcs as edges. Direct constructions are given in most cases. Decompositions of theλ-fold complete mixed graph λMv, are also …
-
Partially Oriented 6-star Decomposition of Some Complete Mixed Graphs
Let $M_v$ denotes a complete mixed graph on $v$ vertices, and let $S_6^i$ denotes the partial orientation of the 6-star with twice as many arcs as edges. In this work, we state and prove the necessary and sufficient conditions for the existence of $\lambda$-fold decomposition of a complete mixed …
-
On the Algebraicity of the Tic-Tac-Toe Matroid and Homogeneous Mixed Bowtie Systems
… we focus on decompositions of the complete mixed graph into mixed bowties. A complete mixed graph has between every pair of vertices an undirected edge and antiparallel arcs. A mixed bowtie is a graph consisting of two 3-cycles which share exactly one vertex, and contains exactly four arcs …
-
Homomorphisms of (j, k)-mixed graphs
A mixed graph is a simple graph in which a subset of the edges have been assigned directions to form arcs. For non-negative integers j and k, a (j, k)−mixed graph is a mixed graph with j types of arcs and k types of edges. The collection of (j, k)−mixed graphs contains simple graphs ((0,1)−mixed …
-
Matrix Formulations of Matching Problems
… the maximum size of a matching in an undirected graph and finding the maximum size of branching in a directed graph can be formulated as matrix rank problems. The Tutte matrix, introduced by Tutte as a representation of an undirected graph, has rank equal to the maximum number of vertices covered …
-
Decompositions of Mixed Graphs with Partial Orientations of the P<sub>4</sub>.
A decomposition D of a graph H by a graph G is a partition of the edge set of H such that the subgraph induced by the edges in each part of the partition is isomorphic to G. A mixed graph on V vertices is an ordered pair (V,C), where V is a set of vertices, |V| = v, and C is a set of ordered and …
-
Extremal Directed And Mixed Graphs
We consider three problems in extremal graph theory, namely the degree/diameter problem, the degree/geodecity problem and Tur\'{a}n problems, in the context of directed and partially directed graphs. A directed graph or mixed graph $G$ is $k$-geodetic if there is no pair of vertices $u,v$ of $G$ …
-
Chromatic polynomials of mixed graphs
Let G = (V,A,E) be a mixed graph and co : V → {1, 2,...,λ} a function such that co is a proper colouring of the underlying graph, Und(G), and co(u) ≠ co(y) when co(v) = co(x), for every pair of arcs (u,v) and (x,y). Such a function is called a proper oriented λ − colouring of G. The number of …
-
Algebraic and Combinatorial Applications in Systems and Evolutionary Biology
… differential equations given by directed graphs, optimal phylogenetic consensus trees, and singularities arising from linear structural equation models given by acyclic mixed graphs. Specifically, for the first algebraic problem, we introduce a polyhedral geometry tool called a mixed …
-
Postman Problems on Mixed Graphs
The <i>mixed postman problem</i> consists of finding a minimum cost tour of a mixed graph <i>M</i> = (<i>V</i>,<i>E</i>,<i>A</i>) traversing all its edges and arcs at least once. We prove that two well-known linear programming relaxations of this problem are equivalent. The <i>extra cost</i> of a …
-
Methods and Applications for Mixed Graphical Models
… efforts directed at statistically modeling such mixed data jointly. In this thesis, we address this by introducing a novel class of Mixed Markov Random Field (MRFs) and Mixed Chain Markov Random Field distributions, or graphical models. Mixed MRFs assume that each node-conditional distribution …
-
Algorithm design and engineering for graph connectivity problems
… deals with topics related to some notions of graph connectivity in directed graphs and mixed graphs. The edge and vertex connectivity of a graph are important measures of its resilience as a network. There is a great variety of real-life relations that can be modeled by graphs. A few of the …
-
Graph-Based Causal Topology Learning for Complex Dynamical Systems under Observational Non-Idealities
… or influences among interacting variables. These graph-based representations can support process monitoring, fault diagnosis, control, and biological interpretation. However, topology learned from observational data depends on how the system is measured. Temporal aggregation, subsampling, …
-
Propagation processes: Full throttling and probabilistic zero forcing
… including mathematical physics under the name ``graph infection", in graph searching problems in computer science, and in linear algebra as an upper bound on the multiplicity of an eigenvalue of a matrix described by a graph. With standard zero forcing, one colors some initial vertices of a graph …