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 51 for “"Bipartite graphs"”.
-
Efficient Computation of Cohesive Subgraphs in Uncertain Bipartite Graphs
Bipartite graphs are extensively used to model relationships between two different types of entities. In many real-world bipartite graphs, relationships are naturally uncertain due to various reasons such as data noise, measurement error and imprecision of data, leading to uncertain bipartite …
-
Restricted and Unrestricted Coverings of Complete Bipartite Graphs with Hexagons
… conditions for minimal coverings of complete bipartite graph with 6-cycles, which we call minimal unrestricted coverings. We also give necessary and sufficient conditions for minimal coverings of the complete bipartite graph with 6-cycles with the added condition the edge set of H<sub>i</sub> …
-
Hamiltonian cycles through specified edges in bipartite graphs, domination game, and the game of revolutionaries and spies
Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2011-07-10T16:04:32Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 2 thesis.pdf: 580482 bytes, checksum: 33853047e47046b466c6e010e8cbbd38 (MD5) Zamani Nasab_Reza.pdf: 580482 bytes, checksum: …
-
Hamiltonian cycles in subset and subspace graphs.
… and the uniform-Hamiltonicity of subset graphs, subspace graphs, and their associated bipartite graphs. In 1995 paper "The Subset-Subspace Analogy," Kung states the subspace version of a conjecture. The study of this problem led to a more general class of graphs. Inspired by Clark and …
-
PLANAR GRAPHS, BIPLANAR GRAPHS AND GRAPH THICKNESS
… edges cross. The smallest complete and complete bipartite graphs that are not planar are K5 and K{3,3}. A biplanar graph is a graph whose edges can be colored using red and blue such that the red edges induce a planar subgraph and the blue edges induce a planar subgraph. In this thesis, we …
-
Coloring of Metric Spaces and L(2,1)-Labeling of Graphs
… convert the problem to a problem of packing of bipartite graphs into a complete bipartite graph. We also bound lambda(G) when G is the Kneser graph K(2k + 1, k).
-
Property testing for distributions on partially ordered sets
… Our results apply to various partial orders: bipartite graphs, lines,, trees, grids, and hypercubes.
-
Properties and Recent Applications in Spectral Graph Theory
… theory are introduced. Important aspects of graphs, such as the walks and the adjacency matrix are explored. In addition, bipartite graphs are discussed along with properties that apply strictly to bipartite graphs. The main focus is on the characteristic polynomial and the eigenvalues that …
-
Packings and Coverings of Complete Graphs with a Hole with the 4-Cycle with a Pendant Edge
… packings and coverings of various complete graphs with the 4-cycle with a pendant edge. We consider both restricted and unrestricted coverings. Necessary and sufficient conditions are given for such structures for (1) complete graphs K<sub>v, </sub>(2) complete bipartite graphs …
-
Combinatorial aspects of low-rank matrix factorization and two applications in bioinformatics
… They arise in applications that involve a bipartite network of sources that are emitting some signals over discrete time and sensors that are monitoring these signals. In this context, Y contains sensor measurements over several time points, X contains source signals over time points and A …
-
Minimal PMU placement for graph observability: a decomposition approach
… The NP-completeness of PMU placement for planar bipartite graphs is shown. PMU placement algorithms are developed for graphs of bounded tree width, such as trees and outer planar graphs. Graph decompositions are used to develop efficient algorithms that produce minimal PMU covers. These …
-
A q-analogue of spanning trees : nilpotent transformations over finite fields
… about this bijection in the cases of complete graphs, complete bipartite graphs, and cycles. It gives some refinements of the q-analogue relationship. As a corollary, we find the total number of nilpotent transformations with some restrictions on Jordan block sizes.
-
Optimizing tensor contractions for nuclear correlation functions
… a correlation function as a sum of functions of bipartite graphs, and use isomorph-free exhaustive generation techniques to find a minimal set of graphs that represents the computation.
-
Distances in planar graphs
… results and methods of papers studying planar graphs, particularly those solving the degree diameter problem for various kinds of ρ-facedegree regular graphs. In this review, we provide a correction to an error in The degree/diameter problem in maximal planar bipartite graphs by Dalf´o, Huemer …
-
The Absolute Galois Group of the Rationals, Grothendieck's Dessin D'Enfants, and Galois Invariants
… of A. Grothendieck's dessins d'enfants: finite bipartite graphs embedded on smooth, oriented, compact topological surfaces. Through these categorical equivalences, one obtains a highly non-trivial action of the absolute Galois group of the rationals on a collection of relatively simple …
-
Stochastic Methods for One-Sided Bipartite Crossing Minimization and its Variants
The one-sided bipartite graph drawing problem has been extensively studied in the graph drawing literature, with numerous papers appearing over the years showing novel algorithms and heuristics for minimizing associated edge crossings. Although stochastic methods have been highly successful when …
-
Specht modules and Schubert varieties for general diagrams
… arbitrary collections of boxes or, equally well, bipartite graphs. We will then provide evidence for a conjecture that the relation between the areas described above can be extended to these general diagrams. In particular, we will prove the conjecture for forests. Along the way, we will use a …
-
Lower Bounds and Algorithms for Searching Networks
… and extend the results to a broader class of graphs including toroidal grids. In addition, we examine the complete k-partite graphs and provide lower bounds and upper bounds on their fast search number. We also investigate some special classes of complete k-partite graphs, such as complete …
-
Generalized nowhere zero flow
… G is A-connected{rcub} for certain families of graphs including complete bipartite graphs, chordal graphs, wheels and biwheels. We also give some general results and methods to approach nowhere zero flow and group connectivity problems.
Page 1 of 3