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 35 for “"Algebraic Graph Theory"”.
-
Incidence geometry from an algebraic graph theory point of view
… goal of this thesis is to apply techniques from algebraic graph theory to finite incidence geometry. The incidence geometries under consideration include projective spaces, polar spaces and near polygons. These geometries give rise to one or more graphs. By use of eigenvalue techniques, we obtain …
-
Analysis of probabilistic information dissemination in wireless networks employing algebraic graph theory elements
Information dissemination constitutes a large field of study in the scientific community. In the past, the networks consisted mainly of a relatively small number of nodes with a preconstructed structure and hierarchy. Over the years, both their form and their size have been changed radically …
-
Algebraic Digraph Theory
… the adjacency matrix plays a fundamental role in algebraic graph theory. Much of the literature in algebraic graph theory studies undirected 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 …
-
Automorphism Groups of the Augmented Distance Graphs of Trees
In algebraic graph theory one studies algebraic variants of graphs by forming matrices and groups relating to the graph. One example of this is the distance matrices, $\Gamma\sb{\rm i}$, and their associated groups.
-
A Linear Algebraic Method on the Chromatic Symmetric Function
… chromatic symmetric functions of unit-interval graphs, this conjecture has served as a significant motivator of research in algebraic graph theory in recent years. We summarize a great deal of the existing work done in favor of this conjecture, giving an overview of the various techniques that …
-
Graph Coverings with Few Eigenvalues or No Short Cycles
This thesis addresses the extent of the covering graph construction. How much must a cover X resemble the graph Y that it covers? How much can X deviate from Y? The main statistics of X and Y which we will measure are their regularity, the spectra of their adjacency matrices, and the length of …
-
Formation Control and Path Planning Strategies for Unmanned Aerial Vehicle Swarms
… two such models and analyzes them both from theory and practice. In the first method, a distributed formation control strategy for UAV swarm based on consensus law is presented. This model makes use of the fundamental concepts of leader-follower structure, social potential functions, and …
-
Geometric Approaches for 3D Shape Denoising and Retrieval
… retrieval by incorporating insights gained from algebraic graph theory and spectral geometry. We first present a regularized kernel diffusion for 3D shape denoising by solving partial differential equations in the weighted graph-theoretic framework. Then, we introduce a computationally fast …
-
OPTIMAL LEADER-FOLLOWER FORMATION CONTROL USING DYNAMIC GAMES
… to the research in this field. Dynamic game theory is a powerful method to study dynamic interactions among intelligent, rational, and self-interested agents. Differential game is among the most important sub-classes of dynamic games, because many important problems in engineering can be …
-
Forest Generating Functions of Directed Graphs
… the vertex and edge sets of a given directed graph. In this thesis, we establish a general framework to study spanning forest polynomials, associating them with a generalized Laplacian matrix and studying its properties. We introduce a novel proof of the famous matrix-tree theorem and show how …
-
Trellis Decoding And Applications For Quantum Error Correction
Compact, graphical representations of error-correcting codes called trellises are a crucial tool in classical coding theory, establishing both theoretical properties and performance metrics for practical use. The idea was extended to quantum error-correcting codes by Ollivier and Tillich in 2005. …
-
Entropic Characterization and Time Evolution of Complex Networks
… encountered in complex network analysis using graph theoretic methods. The thesis specifically centers on the challenge of how to characterize the structural properties and time evolution of graphs. We commence by providing a brief roadmap for our research in Chapter 1, followed by a review of …
-
Qualitative and quantitative research on graphs via matrices: Gram mates, Fiedler vectors, Kemeny's constant, and perfect state transfer
A fundamental mathematical approach uses graphs to understand networks representing objects with their interrelationships. This thesis is dedicated to qualitative and quantitative research through a bridge---the connections in a graph---with Gram mates arising in social networks; Fiedler vectors in …
-
Quantum Walks and Pretty Good State transfer on Paths
… In this thesis, we use techniques from algebraic graph theory and number theory to analyze the mathematical model for continuous time quantum walks on graphs. For the continuous time quantum walk model, we define a transition operator, which is a function of a Hamiltonian. We focus on …
-
Spatial Formation Control
… of the proposed estimation scheme using algebraic graph theory. In addition, we derive a distributed identifiability condition and use it for the construction of distributed extremum seeking control laws. In particular, we show that for a network of connected agents, if each agent …
-
On the 𝑘-Independence Number and Laplacian Toughness of Graphs
… and quotient matrices are crucial tools in algebraic graph theory, essential for analyzing and proving bounds for critical graph parameters. This work focuses on themes of independence number, connectivity, graph toughness, and closed walks in infinite regular trees. Computing the …
-
Bipartite Quantum Walks and the Hamiltonian
… matrix S such that H = iS, we say there is a H-digraph associated to the walk and S is the skew-adjacency matrix of the H-digraph. The underlying unweighted non-oriented graph of the H-digraph is H-graph. Let G be a simple bipartite graph with no isolated vertices. The bipartite walk on G is the …
-
Discrete Quantum Walks on Graphs and Digraphs
… various models of discrete quantum walks on graphs and digraphs via a spectral approach. A discrete quantum walk on a digraph $X$ is determined by a unitary matrix $U$, which acts on complex functions of the arcs of $X$. Generally speaking, $U$ is a product of two sparse unitary matrices, …
-
Self-Complementary Arc-Transitive Graphs and Their Imposters
… families of self-complementary arc-transitive graphs: the familiar Paley graphs and the newly discovered Peisert graphs. After studying both families, we examine a result of Peisert which proves the Paley and Peisert graphs are the only self-complementary arc transitive graphs other than one …
-
Constructing Cospectral and Comatching Graphs
The matching polynomial is a graph polynomial that does not only have interesting mathematical properties, but also possesses meaningful applications in physics and chemistry. For a simple graph, the matching polynomial enumerates the number of matchings of different sizes in it. Two graphs are …
Page 1 of 2