English
Related papers

Related papers: The Reidemeister graph is a complete knot invarian…

200 papers

A graph $\G$ with a group $H$ of automorphisms acting semiregularly on the vertices with two orbits is called a {\em bi-Cayley graph} over $H$. When $H$ is a normal subgroup of $\Aut(\G)$, we say that $\G$ is {\em normal} with respect to…

Combinatorics · Mathematics 2016-07-15 Jin-Xin Zhou

Color refinement is a classical technique used to show that two given graphs G and H are non-isomorphic; it is very efficient, although it does not succeed on all graphs. We call a graph G amenable to color refinement if it succeeds in…

Computational Complexity · Computer Science 2015-05-05 V. Arvind , Johannes Köbler , Gaurav Rattan , Oleg Verbitsky

We characterize which automorphisms of an arbitrary complete bipartite graph $K_{n,m}$ can be induced by a homeomorphism of some embedding of the graph in $S^3$.

Geometric Topology · Mathematics 2018-08-14 Erica Flapan , Nicole Lehle , Blake Mellor , Matt Pittluck , Xan Vongsathorn

For any k which is at least 2, we exhibit complete k-curvature homogeneous neutral signature pseudo-Riemannian manifolds which are not k+1-affine curvature homogeneous, and hence not locally homogeneous. All the local scalar Weyl invariants…

Differential Geometry · Mathematics 2007-05-23 P. Gilkey , S. Nikcevic

This is the fourth in a series of papers where we prove a conjecture of Deser and Schwimmer regarding the algebraic structure of ``global conformal invariants''; these are defined to be conformally invariant integrals of geometric scalars.…

Differential Geometry · Mathematics 2009-12-21 Spyros Alexakis

We observe that any knot invariant extends to virtual knots. The isotopy classification problem for virtual knots is reduced to an algebraic problem formulated in terms of an algebra of arrow diagrams. We introduce a new notion of finite…

Geometric Topology · Mathematics 2007-05-23 M. Goussarov , M. Polyak , O. Viro

In this paper, we generalize the notions of perfect matchings, perfect 2-matchings to perfect k-matchings and give a necessary and sufficient condition for existence of perfect k-matchings. For bipartite graphs, we show that this k-matching…

Combinatorics · Mathematics 2010-08-26 Hongliang Lu

Graphons are symmetric measurable functions that arise from a sequence of graphs. A graphon variety is the a set of all graphons defined by a condition of the form $t(g, W) = 0$ for a fixed quantum graph $g$, where $t(.,.)$ is the…

Algebraic Geometry · Mathematics 2026-05-18 Madelyn Andersen

A graph $G$ is $k$-edge geodetic graph if every edge of $G$ lies in at least one geodesic of length $k$. We studied some basic properties of $k$-edge geodetic graphs. We investigated the $k$ edge-geodeticity of complete bipartite graph…

Combinatorics · Mathematics 2024-08-13 Satyam Guragain , Ravi Srivastava

This paper investigates the class of k-universal finite graphs, a local analog of the class of universal graphs, which arises naturally in the study of finite variable logics. The main results of the paper, which are due to Shelah,…

Logic · Mathematics 2016-09-06 Eric Rosen , Saharon Shelah , Scott Weinstein

We show that certain right-invariant metrics endow the infinite-dimensional Lie group of all smooth orientation-preserving diffeomorphisms of the circle with a Riemannian structure. The study of the Riemannian exponential map allows us to…

Mathematical Physics · Physics 2015-06-26 Adrian Constantin , Boris Kolev

Reed showed that, if two graphs are $P_4$-isomorphic, then either both are perfect or none of them is. In this note we will derive an analogous result for perfect digraphs.

Combinatorics · Mathematics 2019-06-14 Stephan Dominique Andres , Helena Bergold , Winfried Hochstättler , Johanna Wiehe

Let $S, K$ be two subrings of a finite ring $R$. Then the generalized non-commuting graph of subrings $S, K$ of $R$, denoted by $\Gamma_{S, K}$, is a simple graph whose vertex set is $(S \cup K) \setminus (C_K(S) \cup C_S(K))$ and two…

Rings and Algebras · Mathematics 2016-04-14 Jutirekha Dutta , Dhiren Kumar Basnet , Rajat Kanti Nath

We introduce a two-parameter framework that refines several classical graph invariants by imposing higher-order constraints along bounded-length geodesics. For integers $k,d\ge1$, a vertex set is called $k,d$-independent if every shortest…

Combinatorics · Mathematics 2026-01-09 Brent Cody , Rose Detore

Bidirected graphs generalize directed and undirected graphs in that edges are oriented locally at every node. The natural notion of the degree of a node that takes into account (local) orientations is that of net-degree. In this paper, we…

Combinatorics · Mathematics 2017-04-11 Laura Gellert , Raman Sanyal

We describe an algorithm that recognizes some (perhaps all) intrinsically knotted (IK) graphs, and can help find knotless embeddings for graphs that are not IK. The algorithm, implemented as a Mathematica program, has already been used by…

Geometric Topology · Mathematics 2013-10-10 Jonathan Miller , Ramin Naimi

We consider the group of isotopy classes of automorphisms of the 3-sphere that preserve a spatial graph or a handlebody-knot embedded in it. We prove that the group is finitely presented for an arbitrary spatial graph or a reducible…

Geometric Topology · Mathematics 2014-12-10 Yuya Koda

This paper deals with random perturbations of diffeomorphisms on n-dimensional Riemannian manifolds with distributions supported on k-dimensional disks, where k<n. First we demonstrate general but not very intuitive conditions which…

Dynamical Systems · Mathematics 2013-01-21 Tatiana Yarmola

A graph ${\mathcal G}$ is locally X if the graphs induced on the neighbours of every vertex of ${\mathcal G}$ are isomorphic to the graph $X$. We prove that the infinite family of incidence graphs of the $r$-rank incidence geometries,…

Combinatorics · Mathematics 2018-11-29 Natalia Garcia-Colin , Dimitri Leemans

Let $G=(V,E)$ be a graph of order $n$ and let $1\leq k< n$ be an integer. The $k$-token graph of $G$ is the graph whose vertices are all the $k$-subsets of $V$, two of which are adjacent whenever their symmetric difference is a pair of…

Combinatorics · Mathematics 2018-02-21 Walter Carballosa , Ruy Fabila-Monroy , Jesús Leaños , Luis Manuel Rivera