相关论文: Algorithms for computing linear invariants if dire…

Graph similarity measurement, which computes the distance/similarity between two graphs, arises in various graph-related tasks. Recent learning-based methods lack interpretability, as they directly transform interaction information between…

We study differential forms on an algebraic compactification of a moduli space of metric graphs. Canonical examples of such forms are obtained by pulling back invariant differentials along a tropical Torelli map. The invariant differential…

We show that the groupoids of two directed graphs are isomorphic if and only if the two graphs are orbit equivalent by an orbit equivalence that preserves isolated eventually periodic points. We also give a complete description of the…

We consider the ideal orientation problem in planar graphs. In this problem, we are given an undirected graph $G$ with positive edge lengths and $k$ pairs of distinct vertices $(s_1, t_1), \dots, (s_k, t_k)$ called terminals, and we want to…

In this paper, we study commutative zero-divisor semigroups determined by graphs. We prove a uniqueness theorem for a class of graphs. We show two classes of graphs that have no corresponding semigroups. In particular, any complete graph…

In this paper, all graphs are assumed to be finite. For $s\geq 1$ and a graph $\G$, if for every pair of isomorphic connected induced subgraphs on at most $s$ vertices there exists an automorphism of $\G$ mapping the first to the second,…

The Kronecker product is an invaluable tool for data-sparse representations of large networks and matrices with countless applications in machine learning, graph theory and numerical linear algebra. In some instances, the sparsity pattern…

Given a decorated planar graph $(G,\omega)$, where $G$ is a planar graph and $\omega\in H^1(|\mathcal{Q}G|,\mathbb{Z})$ with $\mathcal{Q}G$ the directed medial graph of $G$, we call some angular functions $\omega$-compatible and study two…

Mining subgraphs with interesting structural properties from networks (or graphs) is a computationally challenging task. In this paper, we propose two algorithms for enumerating all connected induced subgraphs of a given cardinality from…

We consider the existence of invariant curves of real analytic reversible mappings which are quasi-periodic in the angle variables. By the normal form theorem, we prove that under some assumptions, the original mapping is changed into its…

A graph $G$ is $r$-equitably $k$-colorable if its vertex set can be partitioned into $k$ independent sets, any two of which differ in size by at most $r$. The $r$-equitable chromatic threshold of a graph $G$, denoted by $\chi_{r=}^*(G)$, is…

A graph is called equimatchable if all of its maximal matchings have the same size. Due to Eiben and Kotrb\v{c}\'{i}k,, any connected graph with odd order and independence number $\alpha(G)$ at most $2$ is equimatchable. Akbari et al.…

It is a conjecture that for the class of Leavitt path algebras associated to finite directed graphs, their graded Grothendieck groups $K_0^{\mathrm{gr}}$ are a complete invariant. For a Leavitt path algebra $L_{\mathsf k}(E)$, with…

Assuming a unitarily invariant norm $|||\cdot|||$ is given on a two-sided ideal of bounded linear operators acting on a separable Hilbert space, it induces some unitarily invariant norms $|||\cdot|||$ on matrix algebras $\mathcal{M}_n$ for…

We give a general construction leading to different non-isomorphic families $\Gamma_{n,q}(\K)$ of connected $q$-regular semisymmetric graphs of order $2q^{n+1}$ embedded in $\PG(n+1,q)$, for a prime power $q=p^h$, using the linear…

This paper presents a concise tutorial on spectral clustering for broad spectrum graphs which include unipartite (undirected) graph, bipartite graph, and directed graph. We show how to transform bipartite graph and directed graph into…

Suppose we are given two graphs on $n$ vertices. We define an observable in the Hilbert space $\Co[(S_n \wr S_2)^m]$ which returns the answer ``yes'' with certainty if the graphs are isomorphic and ``no'' with probability at least…

Suppose $G$ is a undirected simple graph. A $k-$subset of edges in $G$ without common vertices is called a $k-$matching and the number of such subsets is denoted by $p(G,k)$. The aim of this paper is to present exact formulas for $p(G,3)$,…

Decay patterns of matrix inverses have recently attracted considerable interest, due to their relevance in numerical analysis, and in applications requiring matrix function approximations. In this paper we analyze the decay pattern of the…

We initiate the program of extending to higher-rank graphs ($k$-graphs) the geometric classification of directed graph $C^*$-algebras, as completed in the 2016 paper of Eilers, Restorff, Ruiz, and Sorensen [ERRS16]. To be precise, we…