Related papers: A Structural Characterization for Certifying Robin…
A graph $\Gamma$ is called $G$-symmetric if it admits $G$ as a group of automorphisms acting transitively on the set of ordered pairs of adjacent vertices. We give a classification of $G$-symmetric graphs $\Gamma$ with $V(\Gamma)$ admitting…
Let $S_{n}$ denote the space of all $n \times n$ real symmetric matrices. For n=2 or n>2 we characterize maps F from $S_{n}$ to $S_{m}$ which preserve adjacency, i.e. if rank(A-B)=1, then rank(F(A)-F(B))=1.
We consider an algebra with non-standard operations on the class of row monomial matrices (having one unit and rest of zeros in every row). The class of row monomial matrices is closed under multiplication, but not closed under ordinary…
A graph is an opposition graph, respectively, a coalition graph, if it admits an acyclic orientation which puts the two end-edges of every chordless 4-vertex path in opposition, respectively, in the same direction. Opposition and coalition…
A Moebius structure (on a set X) is a class of metrics having the same cross-ratios. A Moebius structure is ptolemaic if it is invariant under inversion operations. The boundary at infinity of a CAT(-1) space is in a natural way a Moebius…
Combinatorial transition matrices arise frequently in the theory of symmetric functions and their generalizations. The entries of such matrices often count signed, weighted combinatorial structures such as semistandard tableaux, rim-hook…
A bar-joint framework $(G,p)$ in Euclidean $d$-space is rigid if the only edge-length-preserving continuous motions arise from isometries of $\mathbb{R}^d$. In the generic case, rigidity is determined by the generic $d$-dimensional rigidity…
Graph structure learning aims to learn connectivity in a graph from data. It is particularly important for many computer vision related tasks since no explicit graph structure is available for images for most cases. A natural way to…
In the present paper we investigate the faithfulness of certain linear representations of groups of automorphisms of a graph $X$ in the group of symmetries of the Jacobian of $X$. As a consequence we show that if a $3$-edge-connected graph…
Given a Poisson process on a bounded interval, its random geometric graph is the graph whose vertices are the points of the Poisson process and edges exist between two points if and only if their distance is less than a fixed given…
A graph is an instrument which is extensively utilized to model various problems in different fields. Up to date, many graphs have been developed to represent algebraic structures, particularly rings in order to study their properties. In…
Let $B$ be some invertible Hermitian or skew-Hermitian matrix. A matrix $A$ is called $B$-normal if $AA^\star = A^\star A$ holds for $A$ and its adjoint matrix $A^\star := B^{-1}A^HB$. In addition, a matrix $Q$ is called $B$-unitary, if…
Most existing popular methods for learning graph embedding only consider fixed-order global structural features and lack structures hierarchical representation. To address this weakness, we propose a novel graph embedding algorithm named…
The problem of diagonalization of Hamiltonians of N-dimensional boson systems by means of time-dependent canonical transformations (CT) is considered, the case of quadratic Hamiltonians being treated in greater detail. The unitary generator…
A consistent path system in a graph $G$ is an intersection-closed collection of paths, with exactly one path between any two vertices in $G$. We call $G$ metrizable if every consistent path system in it is the system of geodesic paths…
Monographs are graph-like structures with directed edges of unlimited length that are freely adjacent to each other. The standard nodes are represented as edges of length zero. They can be drawn in a way consistent with standard graphs and…
In this review we discuss the relationship between random matrix theories and symmetric spaces. We show that the integration manifolds of random matrix theories, the eigenvalue distribution, and the Dyson and boundary indices characterizing…
We provide a solution to the problem of simultaneous $diagonalization$ $via$ $congruence$ of a given set of $m$ complex symmetric $n\times n$ matrices $\{A_{1},\ldots,A_{m}\}$, by showing that it can be reduced to a possibly…
The interval graph for a set of intervals on a line consists of one vertex for each interval, and an edge for each intersecting pair of intervals. A probe interval graph is a variant that is motivated by an application to genomics, where…
An intuitive property of a random graph is that its subgraphs should also appear randomly distributed. We consider graphs whose subgraph densities exactly match their expected values. We call graphs with this property for all subgraphs with…