相关论文: A measure of similarity between graph vertices

Recently, one has seen a surge of interest in developing such methods including ones for learning such representations for (undirected) graphs (while preserving important properties). However, most of the work to date on embedding graphs…

A graph $G$ is said to be determined by its generalized spectrum (DGS for short) if for any graph $H$, $H$ and $G$ are cospectral with cospectral complements implies that $H$ is isomorphic to $G$. It turns out that whether a graph $G$ is…

W.Specht (1940) proved that two $n\times n$ complex matrices $A$ and $B$ are unitarily similar if and only if $\operatorname{trace} w(A,A^{\ast}) = \operatorname{trace} w(B,B^{\ast})$ for every word $w(x,y)$ in two noncommuting variables.…

Two graphs are co-spectral if their respective adjacency matrices have the same multi-set of eigenvalues. A graph is said to be determined by its spectrum if all graphs that are co-spectral with it are isomorphic to it. We consider these…

Let $G$ be a simple graph and $A(G)$ be the adjacency matrix of $G$. The matrix $S(G) = J -I -2A(G)$ is called the Seidel matrix of $G$, where $I$ is an identity matrix and $J$ is a square matrix all of whose entries are equal to 1.…

Two emerging topics in graph theory are the study of cospectral vertices of a graph, and the study of isospectral reductions of graphs. In this paper, we prove a fundamental relationship between these two areas, which is that two vertices…

Quasi-isometry is a measure of how similar two graphs are at `large-scale'. Nguyen, Scott, and Seymour [arXiv:2501.09839] and Hickingbotham [arXiv:2501.10840] independently gave a characterisation of graphs quasi-isometric to graphs of…

Graphs are used in almost every scientific discipline to express relations among a set of objects. Algorithms that compare graphs, and output a closeness score, or a correspondence among their nodes, are thus extremely important. Despite…

Let $G_n$ be a simple graph on $V_n=\{v_1,\dots, v_n\}$. The Seidel matrix $S(G_n)$ of $G_n$ is the $n\times n$ matrix whose $(ij)$'th entry, for $i\neq j$ is $-1$ if $v_i\sim v_j$ and $1$ otherwise, and whose diagonal entries are $0$. We…

Measures of complex network analysis, such as vertex centrality, have the potential to unveil existing network patterns and behaviors. They contribute to the understanding of networks and their components by analyzing their structural…

We show that every subset of vertices of a directed graph E gives a Morita equivalence between a subalgebra and an ideal of the associated Leavitt path algebra. We use this observation to prove an algebraic version of a theorem of Crisp and…

Let $G=(V,E)$ be a finite, simple, connected, combinatorial graph on $n$ vertices and let $D \in \mathbb{R}^{n \times n}$ be its graph distance matrix $D_{ij} = d(v_i, v_j)$. Steinerberger (J. Graph Theory, 2023) empirically observed that…

In this paper, a new measurement to compare two large-scale graphs based on the theory of quantum probability is proposed. An explicit form for the spectral distribution of the corresponding adjacency matrix of a graph is established. Our…

Graph isomorphism is an important problem as its worst-case time complexity is not yet fully understood. In this study, we try to draw parallels between a related optimization problem called point set registration. A graph can be…

The main approach to defining equivalence among acyclic directed causal graphical models is based on the conditional independence relationships in the distributions that the causal models can generate, in terms of the Markov equivalence.…

Graph edit distance / similarity is widely used in many tasks, such as graph similarity search, binary function analysis, and graph clustering. However, computing the exact graph edit distance (GED) or maximum common subgraph (MCS) between…

The Graph Edit Distance (GED) is an important metric for measuring the similarity between two (labeled) graphs. It is defined as the minimum cost required to convert one graph into another through a series of (elementary) edit operations.…

Here, the structural symmetries of a hypergraph are represented through equivalence relations on the vertex set of the hypergraph. A matrix associated with the hypergraph may not reflect a specific structural symmetry. In the context of a…

In traditional graph retrieval tools, graph matching is commonly used to retrieve desired graphs from extensive graph datasets according to their structural similarities. However, in real applications, graph nodes have numerous attributes…

For a compact set $E \subset \mathbb R^d$ and a connected graph $G$ on $k+1$ vertices, we define a $G$-framework to be a collection of $k+1$ points in $E$ such that the distance between a pair of points is specified if the corresponding…