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 14 of 14 for “"equitable partitions"”.
-
Fourier Decompositions of Graphs with Symmetries and Equitable Partitions
We show that equitable partitions, which are generalizations of graph symmetries, and Fourier transforms are fundamentally related. For a partition of a graph's vertices we define a Fourier similarity transform of the graph's adjacency matrix built from the matrices used to carryout discrete …
-
Modeling Network Growth via Generalized Isospectral Reductions
… a variety of symmetries. In this thesis we study equitable partitions and isospectral reductions, both of which are generalizations of symmetries. We formalize the relationship between these two types of generalized symmetry through the study of invariant subspaces. We then use recent results …
-
Spectral Aspects of Cocliques in Graphs
… fixed prime. Cocliques are closely related to equitable partitions of a graph, and to parallel faces of the eigenpolytopes of a graph. We develop this connection and give a relation between the existence of quadratic polynomials that vanish on the vertices of an eigenpolytope of a graph, and …
-
Eigenvalues of Matrices and Graphs
… extension of the well known concept of equitable partitions to weighted graphs, i.e. complex matrices. It provides a method to divide the eigenproblem into smaller parts corresponding to the front divisor and its complementary factor in an easy and stable way with complexity which is …
-
Determining the likelihood of un-controllability in large scale systems
… trajectory. Graphic tools, in particular, the equitable partitions technique have been used to investigate the controllability for such systems. In these studies authors have utilized static gains to describe the interconnection behavior. However, we focus on a more general class of systems …
-
(Relaxed) Product Structures of Graphs and Hypergraphs
… to \\mbox{(quasi-)covers} of graphs and equitable partitions. Thereby, we characterize the existence of non-trivial RSP-relations by means of the existence of spanning subgraphs that yield quasi-covers of the graph under investigation. We show, how equitable partitions on the vertex set …
-
The Graphs of HU+00E4ggkvist & Hell
… many of our results. Using the theory of equitable partitions we compute some eigenvalues of these graphs. Moving on to independent sets we give several bounds including the ratio bound, which is computed using the least eigenvalue. A bound for the chromatic number is given using the …
-
Minimal Specialization: The Coevolution of Network Structure and Dynamics
… the small-world property, and non-trivial equitable partitions. Additionally, when compared to other growth models, the integrated specialization model creates networks with small diameter, minimizing distances across the network. Along with producing these structural features, this model …
-
Exploiting Symmetry in Linear and Integer Linear Programming
… involving a generalization of symmetries, equitable partitions, has made the upfront cost much more manageable.</p> <p>The motivation for orbital crossover is that many highly symmetric integer linear programs exist, and thus, solving symmetric linear programs is of major interest in order …
-
Forest Generating Functions of Directed Graphs
… D. This leads us to the study of externally equitable partitions (EEPs), which are objects of recent interest in the control theory literature. We prove that for graphs with EEPs satisfying an additional criteria, the specialized forest polynomials may be factored into a product of forest …
-
Special Block-Colourings of Steiner 2-Designs
… In particular, we focus on 8(2,4,v)s and the partitions (2, 1, 1, ... , 1), (3, 1, 1 ... , 1), and partitions of the form π = (π1, π2, ... , πs), where |πj -πil ≤ 1 for all 1 ≤ i < j ≤ s. These latter partitions are called equitable partitions and the corresponding block-colourings are called …
-
Equitable Decompositions: A Gateway to Spectral Theory Through Graph Automorphisms
… summands is always the quotient matrix of an equitable partition, this procedure is called an equitable decomposition.
-
Pretty Good State Transfer and Fractional Revival in Double Extended Star Graphs
Much research has been done in the realm of quantum walks over networks of qubits. We primarily study a type of graph consisting of a path with two stars connected to the leaves which we call a Double Extended Star. We find that Pretty Good State Transfer can occur in many ways in a Double Extended …