Related papers: Generalized spectral characterization of signed tr…

For a positive integer $n$ let $\mathcal{X}_n$ be either the algebra $M_n$ of $n \times n$ complex matrices, the set $N_n$ of all $n \times n$ normal matrices, or any of the matrix Lie groups $\mathrm{GL}(n)$, $\mathrm{SL}(n)$ and…

A tree $T$ on $2^n$ vertices is called set-sequential if the elements in $V(T)\cup E(T)$ can be labeled with distinct nonzero $(n+1)$-dimensional $01$-vectors such that the vector labeling each edge is the component-wise sum modulo $2$ of…

We establish relations between the bandwidth and the treewidth of bounded degree graphs G, and relate these parameters to the size of a separator of G as well as the size of an expanding subgraph of G. Our results imply that if one of these…

In this paper we generalize the $j$-invariant criterion for the semistable reduction type of an elliptic curve to superelliptic curves $X$ given by $y^{n}=f(x)$. We first define a set of tropical invariants for $f(x)$ using symmetrized…

In the past decades, graphs that are determined by their spectrum have received more attention, since they have been applied to several fields, such as randomized algorithms, combinatorial optimization problems and machine learning. An…

We show that for every $\Delta\in\mathbb N$, there exists a constant $C$ such that if $G$ is an $(n,d,\lambda)$-graph with $d/\lambda\ge C$ and $d$ is large enough, then $G^2$ contains every $n$-vertex tree with maximum degree bounded by…

The spectral properties of signed directed graphs, which may be naturally obtained by assigning a sign to each edge of a directed graph, have received substantially less attention than those of their undirected and/or unsigned counterparts.…

A bounded set $\Omega \subset \mathbb{R}^d$ is called a spectral set if the space $L^2(\Omega)$ admits a complete orthogonal system of exponential functions. We prove that a cylindric set $\Omega$ is spectral if and only if its base is a…

We study a representation-theoretic refinement of the ordinary Laplacian spectrum of a graph. Given a graph $G$ on $n$ vertices, one may associate to it the element \[ X_G=\sum_{ij\in E(G)} (ij)\in \C[S_n]. \] The action of $X_G$ in…

We investigate properties of signed graphs that have few distinct eigenvalues together with a symmetric spectrum. Our main contribution is to determine all signed $(0,2)$-graphs with vertex degree at most $6$ that have precisely two…

It has remained an open question for some time whether, given a set of not necessarily binary (i.e. "nonbinary") trees T on a set of taxa X, it is possible to determine in time f(r).poly(m) whether there exists a phylogenetic network that…

A tree T is invertible if and only if T has a perfect matching. Godsil considers an invertible tree T and finds that the inverse of the adjacency matrix of T has entries in {0, 1, -1} and is the signed adjacency matrix of a graph which…

Let $\chi(A)$ denote the characteristic polynomial of a matrix $A$ over a field; a standard result of linear algebra states that $\chi(A^{-1})$ is the reciprocal polynomial of $\chi(A)$. More formally, the condition $\chi^n(X)…

Let $T\_n$ denote the set of unrooted labeled trees of size $n$ and let $T\_n$ be a particular (finite, unlabeled) tree. Assuming that every tree of $T\_n$ is equally likely, it is shown that the limiting distribution as $n$ goes to…

We generalize Schwenk's result that almost all trees contain any given limb to trees with positive integer vertex weights. The concept of characteristic polynomial is extended to such weighted trees and we prove that the proportion of…

If a graph has a non-singular adjacency matrix, then one may use the inverse matrix to define a (labeled) graph that may be considered to be the inverse graph to the original one. It has been known that an adjacency matrix of a tree is…

A classical result by Otter shows that the complete graph has an exponential number of non-isomorphic spanning trees. This was recently extended by Lee to every almost regular graph of sufficiently large degree. In this paper, we consider…

Let $G$ be a graph with adjacency matrix $A(G)$ and let $D(G)$ be the diagonal matrix of the degrees of $G$. For every real $\alpha\in\left[ 0,1\right],$ define the matrix $A_{\alpha}\left(G\right) $ as \[ A_{\alpha}\left(G\right) =\alpha…

We show that P2T - the problem of deciding whether the edge set of a simple graph can be partitioned into two trees or not - is NP-complete.

For a given graph $G$, let $f:V(G)\to \{1,2,\ldots,n\}$ be a bijective mapping. For a given edge $uv \in E(G)$, $\sigma(uv)=+$, if $f(u)$ and $f(v)$ have the same parity and $\sigma(uv)=-$, if $f(u)$ and $f(v)$ have opposite parity. The…