相关论文: A new way to evaluate MOY graphs
In this paper we present new proofs of the Conway-Gordon-Sachs and Sachs Theorems on the linked cycles in graphs embedded in $\R^3$. We reduce these theorems to certain property of graphs mapped to the plane.
In modern mathematics, graphs figure as one of the better-investigated class of mathematical objects. Various properties of graphs, as well as graph-processing algorithms, can be useful if graphs of a certain kind are used as denotations…
We investigate some basic questions about the interaction of regular and rational relations on words. The primary motivation comes from the study of logics for querying graph topology, which have recently found numerous applications. Such…
Mutual visibility in graphs provides a framework for analysing how vertices can observe one another along shortest paths free of internal obstructions. The visibility polynomial, which enumerates mutual-visibility sets of all orders, has…
We study the spectrum of the join of several circulant matrices. We apply our results to compute explicitly the spectrum of certain graphs obtained by joining several circulant graphs.
The definition of edge-regularity in graphs is a relaxation of the definition of strong regularity, so strongly regular graphs are edge-regular and, not surprisingly, the family of edge-regular graphs is much larger and more diverse than…
A new state-sum formula for the evaluation of the Yang-Mills measure in the Kauffman bracket skein algebra of a closed surface is derived. The formula extends the Kauffman bracket to diagrams that lie in surfaces other than the plane. It…
Graph comparison is a certain type of condition on metric space encoded by a finite graph. We show that any nontrivial graph comparison implies one of Alexandrov's comparisons. The proof gives a complete description of graphs with trivial…
Human beings are fundamentally sociable -- that we generally organize our social lives in terms of relations with other people. Understanding social relations from an image has great potential for intelligent systems such as social chatbots…
Graph topology inference, i.e., learning graphs from a given set of nodal observations, is a significant task in many application domains. Existing approaches are mostly limited to learning a single graph assuming that the observed data is…
A new approach to find all the transitive orientations for a comparability graph (finite or infinite) is presented. This approach is based on the link between the notion of ``strong'' partitive set and the forcing theory (notions of…
We introduce a switching operation, inspired by the Godsil-McKay switching, in order to obtain pairs of $G$-cospectral gain graphs, that are gain graphs cospectral with respect to every representation of the gain group $G$. For instance,…
In this paper, we consider various graphs, namely: power graph, cyclic graph, enhanced power graph and commuting graph, on a finite semigroup $S$. For an arbitrary pair of these four graphs, we classify finite semigroups such that the…
We introduce new skein invariants of links based on a procedure where we first apply the skein relation only to crossings of distinct components, so as to produce collections of unlinked knots. We then evaluate the resulting knots using a…
We propose a modal logic in which counting modalities appear in linear inequalities. We show that each formula can be transformed into an equivalent graph neural network (GNN). We also show that a broad class of GNNs can be transformed…
The problem of node-similarity in networks has motivated a plethora of such measures between node-pairs, which make use of the underlying graph structure. However, higher-order relations cannot be losslessly captured by mere graphs and…
The concept of viewing graph solvability has gained significant interest in the context of structure-from-motion. A viewing graph is a mathematical structure where nodes are associated to cameras and edges represent the epipolar geometry…
The complexity of a graph is the number of its labeled spanning trees. In this work complexity is studied in settings that admit regular graphs. An exact formula is established linking complexity of the complement of a regular graph to…
Recently, subgraphs-enhanced Graph Neural Networks (SGNNs) have been introduced to enhance the expressive power of Graph Neural Networks (GNNs), which was proved to be not higher than the 1-dimensional Weisfeiler-Leman isomorphism test. The…
We consider two notions describing how one finite graph may be larger than another. Using them, we prove several theorems for such pairs that compare the number of spanning trees, the return probabilities of random walks, and the number of…