Related papers: Hermitian adjacency matrices of mixed multigraphs
A main challenge in mining network-based data is finding effective ways to represent or encode graph structures so that it can be efficiently exploited by machine learning algorithms. Several methods have focused in network representation…
It is shown that shift graphs can be realized as disjointness graphs of 1-intersecting curves in the plane. This implies that the latter class of graphs is not $\chi$-bounded.
A set of Hamiltonians that are not self-adjoint but have the spectrum of the harmonic oscillator is studied. The eigenvectors of these operators and those of their Hermitian conjugates form a bi-orthogonal system that provides a…
We classify the connected-homogeneous digraphs with more than one end. We further show that if their underlying undirected graph is not connected-homogeneous, they are highly-arc-transitive.
Finding coarse representations of large graphs is an important computational problem in the fields of scientific computing, large scale graph partitioning, and the reduction of geometric meshes. Of particular interest in all of these fields…
The spectral properties of traditional (dyadic) graphs, where an edge connects exactly two vertices, are widely studied in different applications. These spectral properties are closely connected to the structural properties of dyadic…
It is well known that a graph is bipartite if and only if the spectrum of its adjacency matrix is symmetric. In the present paper, this assertion is dissected into three separate matrix results of wider scope, which are extended also to…
In this short note, we introduce cospectral graphons, paralleling the notion of cospectral graphs. As in the graph case, we give three equivalent definitions: by equality of spectra, by equality of cycle densities, and by a unitary…
Fix $m \in \mathbb N$. A new generalization of the $H$-join operation of a family of graphs $\{G_1, G_2, \dots, G_k\}$ constrained by indexing maps $I_1,I_2,\dots,I_k$ is introduced as $H_m$-join of graphs, where the maps $I_i:V(G_i)$ to…
Hypergraphs, increasingly utilised for modelling complex and diverse relationships in modern networks, gain much attention representing intricate higher-order interactions. Among various challenges, cohesive subgraph discovery is one of the…
This paper introduces a nonparametric framework for the setting where multiple networks are observed on the same set of nodes, also known as multiplex networks. Our objective is to provide a simple parameterization which explicitly captures…
Hermitian symmetric manifolds are Hermitian manifolds which are homogeneous and such that every point has a symmetry preserving the Hermitian structure. The aim of these notes is to present an introduction to this important class of…
Matchings and coverings are central topics in graph theory. The close relationship between these two has been key to many fundamental algorithmic and polyhedral results. For mixed graphs, the notion of matching forest was proposed as a…
Cluster automorphisms have been shown to have links to the mapping class groups of surfaces, maximal green sequences and to exchange graph automorphisms for skew-symmetric cluster algebras. In this paper we aim to generalise these results…
Extending a classic result of Johnson and Newman, this paper provides a matrix characterization for two generalized cospectral graphs with a pair of generalized cospectral vertex-deleted subgraphs. As an application, we present a new…
We study isospectrality for mixed Dirichlet-Neumann boundary conditions, and extend the previously derived graph-theoretic formulation of the transplantation method. Led by the theory of Brownian motion, we introduce vertex-colored and…
In this paper the main results in arXiv:0901.3179v3, related to the matrix representation of polynomial maps, are restated in traditional way of linear algebra assuming that variable vectors are presented as column vectors. Some new results…
In this paper, a lot of examples of four-dimensional manifolds with an almost hypercomplex pseudo-Hermitian structure are constructed in several explicit ways. The received 4-manifolds are characterized by their linear invariants in the…
The first paper in this series introduced a new family of nonasymptotic matrix concentration inequalities that sharply capture the spectral properties of very general random matrices in terms of an associated noncommutative model. These…
A conjugate skew gain graph is a skew gain graph with the labels (also called, the conjugate skew gains) from the field of complex numbes on the oriented edges such that they get conjugated when we reverse the orientation. In this paper we…