Related papers: Unit distance graphs and algebraic integers
We give the characteristic polynomial of the distance or adjacency matrix of the strong power graph of a finite group, and compute its distance and adjacency spectrum.
We study finiteness (and vanishing) properties of the higher order degrees associated to complements of complex affine plane curves with mild singularities at infinity. Our results impose new obstructions on the class of groups that can be…
We provide a visual and intuitive introduction to effectively calculating in 2-groups along with explicit examples coming from non-abelian 1- and 2-form gauge theory. In particular, we utilize string diagrams, tools similar to tensor…
We investigate the general structure of the automorphism group and the Lie algebra of derivations of a finitely generated vertex operator algebra. The automorphism group is isomorphic to an algebraic group. Under natural assumptions, the…
For finite sequence $\underbar{\em d}$ of positive integers, we consider graphs that have $\underbar{\em d}$ as their list of vertex degrees, and bipartite graphs for which each part has $\underbar{\em d}$ as its list of vertex degrees. In…
The metric dimension of non-component graph, associated to a finite vector space, is determined. It is proved that the exchange property holds for resolving sets of the graph, except a special case. Some results are also related to an…
Given a positive definite even lattice and a commutative ring, there is a standard construction of a lattice vertex algebra over the commutative ring, and it admits a natural grading by non-negative integers. We describe the groups of…
In this dissertation, we explore the structure of inversion graphs of permutations--a class of graphs that naturally arises by representing each permutation as a graph, where vertices correspond to entries and edges encode inversions.…
The automorphisms groups and derivation algebras of all two-dimensional algebras over algebraically closed fields are described.
In this paper, we introduce the t-graphs defined on finitely-generate groups. We study some general aspects of the t-graphs on 2-generator groups, emphasising establishing necessary conditions for their connectedness. In particular, we…
The unit distance embeddability of a graph, like planarity, involves a mix of constraints that are combinatorial and geometric. We construct a unit distance embedding for $H-e$ in the hope that it will lead to an embedding for $H$. We then…
In this note we present eleven unit distance embeddings of the Heawood graph, i.e. the point-line incidence graph of the finite projective plane of order two, by way of pictures and 15 digit approximations of the coordinates of the…
The interplay between groups and graphs have been the most famous and productive area of algebraic graph theory. In this paper, we introduce and study the graphs whose vertex set is group G such that two distinct vertices a and b having…
We study a class of complex polynomial equations on a finite graph with a view to understanding how holistic phenomena emerge from combinatorial structure. Particular solutions arise from orthogonal projections of regular polytopes,…
The degree sequence of a graph is a numerical method to characterize the properties of graphs. Generalized forms of degree sequences exist for complete graphs and complete graphs. Nikolopolus et al. characterized the number of spanning…
Let $A$ be a connected commutative $\C$-algebra with derivation $D$, $G$ a finite linear automorphism group of $A$ which preserves $D$, and $R=A^G$ the fixed point subalgebra of $A$ under the action of $G$. We show that if $A$ is generated…
We indicate a natural generalization of the concept of subgroup commutativity degree of a finite group and a list of open problems on these new concepts.
Developing further Stein's recent notion of relative end degrees in infinite graphs, we investigate which degree assumptions can force a locally finite graph to contain a given finite minor, or a finite subgraph of given minimum degree.…
We study random graphs with arbitrary distributions of expected degree and derive expressions for the spectra of their adjacency and modularity matrices. We give a complete prescription for calculating the spectra that is exact in the limit…
A survey of problems, conjectures, and theorems about quasi-isometric classification and rigidity for finitely generated solvable groups.