Related papers: Quadratic starlike trees

Let $M=Q(i\sqrt{d})$ be any imaginary quadratic field with a positive square-free $d$. Consider the polynomial \[ f(x)=x^3-ax^2-(a+3)x-1, \] with a parameter $a\in Z$. Let $K=M(\alpha)$, where $\alpha$ is a root of $f$. This is an infinite…

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.…

As a generalization of orbit-polynomial and distance-regular graphs, we introduce the concept of a quotient-polynomial graph. In these graphs every vertex $u$ induces the same regular partition around $u$, where all vertices of each cell…

We determine all graphs whose matching polynomials have at most five distinct zeros. As a consequence, we find new families of graphs which are determined by their matching polynomial.

The theory of algebras with polynomial identities has developed significantly, with special attention devoted to the classification of varieties according to the asymptotic behavior of their codimension sequences. This sequence is a…

We prove that a hereditary graph class $\mathcal{G}$ defined by finitely many excluded induced subgraphs has bounded tree-$\alpha$ if and only if it is "$(\mathrm{tw},\omega)$-bounded" (that is, for all $t\in \mathbb N$, the class of all…

Bidirected graphs are multigraphs where every edge has an independent direction at each end. In the paper, with an arbitrary bidirected graph we associate a non-negative integral quadratic form (called the incidence form of the graph), and…

Given a graph $G$, the family of all independent sets of size $k$ containing a fixed vertex $v$ is called a star with centre $v$, and is denoted by $\mathcal{I}_G^k(v)$. Motivated by a generalisation of the Erd\H{o}s-Ko-Rado Theorem to the…

One of the important features of an interconnection network is its ability to efficiently simulate programs or parallel algorithms written for other architectures. Such a simulation problem can be mathematically formulated as a graph…

Let $(\Sigma,p)$ be a pointed Riemann surface of genus $g\geq 1$. For any integer $k\geq 1$, we parametrize the space of meromorphic quadratic differentials on $\Sigma$ with a pole of order $(k+2)$ at $p$, having a connected critical graph…

We define a class of bipartite graphs that correspond naturally with Ferrers diagrams. We give expressions for the number of spanning trees, the number of Hamiltonian paths when applicable, the chromatic polynomial, and the chromatic…

An integral quadratic polynomial (with positive definite quadratic part) is called almost universal if it represents all but finitely many positive integers. In this paper, we provide a characterization of almost universal ternary quadratic…

A phylogenetic tree is a tree with a fixed set of leaves that has no vertices of degree two. In this paper, we axiomatically define four other discrete structures on the set of leaves. We prove that each of these structures is an equivalent…

A graph is called an integral graph when all eigenvalues of its adjacency matrix are integers. We study which Cayley graphs over a nonabelian group $$ T_{8n}=\left\langle a,b\mid a^{2n}=b^8=e,a^n=b^4,b^{-1}ab=a^{-1} \right \rangle $$ are…

We introduce jacobian graphs, which are explicit families of regular graphs that are spectrally indistinguishable from random graphs, but whose local structure is very different from that of random graphs. The construction relies on the…

Quadratic algebras are generalizations of Lie algebras; they include the symmetry algebras of 2nd order superintegrable systems in 2 dimensions as special cases. The superintegrable systems are exactly solvable physical systems in classical…

There are several common ways to encode a tree as a matrix, such as the adjacency matrix, the Laplacian matrix (that is, the infinitesimal generator of the natural random walk), and the matrix of pairwise distances between leaves. Such…

While the notion of arboricity of a graph is well-known in graph theory, very few results are dedicated to the minimal number of trees covering the edges of a graph, called the tree number of a graph.

In this paper, we revisit the theory of perfect unary forms over real quadratic fields. Specifically, we deduce an infinite family of real quadratic fields $\mathbb{Q}(\sqrt{d})$ when $d=2$ or $3$ mod $4$, such that there are three classes…

Unigraphs are graphs identifiable up to isomorphism from their degree sequences. Given a class $\mathcal{A}$ of graphs, we define the class of $\mathcal{A}$-unigraphs to be graphs identifiable from degree sequence and membership in…