相关论文: Signed graphs and inverses of their incidence matr…

The incidence energy $\mathscr{IE}(G)$ of a graph $G$, defined as the sum of the singular values of the incidence matrix of a graph $G$, is a much studied quantity with well known applications in chemical physics. The Laplacian-energy-like…

The (torsion) complexity of a finite signed graph is defined to be the order of the torsion subgroup of the abelian group presented by its Laplacian matrix. When $G$ is $d$-periodic (i.e., $G$ has a free ${\mathbb Z}^d$-action by graph…

This paper investigates spectral properties of the deformed Laplacian matrix, which merges the Laplacian and signless Laplacian matrices of a graph through a one-parameter family of matrices. We present general results on the eigenvalues of…

Let $G$ be a simple finite connected graph. The line graph $L(G)$ of graph $G$ is the graph whose vertices are the edges of $G$, where $ef \in E(L(G))$ when $e \cap f \neq \emptyset$. Iteratively, the higher order line graphs are defined…

Restrictions of incidence-preserving path maps produce an oriented hypergraphic All Minors Matrix-tree Theorems for Laplacian and adjacency matrices. The images of these maps produce a locally signed graphic, incidence generalization, of…

Signed graphs are equipped with both positive and negative edge weights, encoding pairwise correlations as well as anti-correlations in data. A balanced signed graph has no cycles of odd number of negative edges. Laplacian of a balanced…

Let $G$ be an undirected graph on $n$ vertices and let $S(G)$ be the set of all $n \times n$ real symmetric matrices whose nonzero off-diagonal entries occur in exactly the positions corresponding to the edges of $G$. The inverse eigenvalue…

We consider the following problem for oriented graphs and digraphs: Given an oriented graph (digraph) $G$, does it contain an induced subdivision of a prescribed digraph $D$? The complexity of this problem depends on $D$ and on whether $G$…

Let $G$ be a permutation graph. We show that $G$ is Cohen-Macaulay if and only if $G$ is unmixed and vertex decomposable. When this is the case, we obtain a combinatorial description for the $a$-invariant of $G$. Moreover, we characterize…

For a graph $G$ and a non-zero real number $\alpha$, the graph invariant $S_{\alpha}(G)$ is the sum of the $\alpha^{th}$ power of the non-zero signless Laplacian eigenvalues of $G$. In this paper, we obtain the sharp bounds of…

We provide a new decomposition of the Laplacian matrix (for labeled directed graphs with strongly connected components), involving an invertible $\textit{core matrix}$, the vector of tree constants, and the incidence matrix of an auxiliary…

Four results are given that address the existence, ambiguities and construction of a classical R-matrix given a Lax pair. They enable the uniform construction of R-matrices in terms of any generalized inverse of $ad L$. For generic $L$ a…

In this short note we make a few remarks on a class of generalized incidence matrices whose matroids do not depend on the orientation of the underlying graph and natural commutative algebras associated to such matrices.

A signed graph product is defined for a new product, and initially the unsigned graph product's Laplacian spectrum and signless Laplacian spectrum are found. Next, for the signed graph product, the adjacency spectrum, Laplacian spectrum,…

From any directed graph $E$ one can construct the graph inverse semigroup $G(E)$, whose elements, roughly speaking, correspond to paths in $E$. Wang and Luo showed that the congruence lattice $L(G(E))$ of $G(E)$ is upper-semimodular for…

Real-world data is often represented through the relationships between data samples, forming a graph structure. In many applications, it is necessary to learn this graph structure from the observed data. Current graph learning research has…

For a graph G, M(G) denotes the maximum multiplicity occurring of an eigenvalue of a symmetric matrix whose zero-nonzero pattern is given by edges of G. We introduce two combinatorial graph parameters T^-(G) and T^+(G) that give a lower and…

The spectra of signed matrices have played a fundamental role in social sciences, graph theory, and control theory. In this work, we investigate the computational problems of identifying symmetric signings of matrices with natural spectral…

A complex unit gain graph is a graph where each orientation of an edge is given a complex unit, which is the inverse of the complex unit assigned to the opposite orientation. We extend some fundamental concepts from spectral graph theory to…

Signed graphs have appeared in a broad variety of applications, ranging from social networks to biological networks, from distributed control and computation to power systems. In this paper, we investigate spectral properties of signed…