Related papers: Gonality of algebraic curves and graphs
A graph $G$ is a $D\!D_2$-graph if it has a pair $(D,D_2)$ of disjoint sets of vertices of $G$ such that $D$ is a dominating set and $D_2$ is a 2-dominating set of $G$. We provide several characterizations and hardness results concerning…
Modern methods of graph theory describe a graph up to isomorphism, which makes it difficult to create mathematical models for visualizing graph drawings on a plane. The topological drawing of the planar part of a graph allows representing…
Edge-weighted graphs play an important role in the theory of Robinsonian matrices and similarity theory, particularly via the concept of level graphs, that is, graphs obtained from an edge-weighted graph by removing all sufficiently light…
Let $p$ be an odd prime, and $D_{2p}=\langle a,b\mid a^p=b^2=1,bab=a^{-1}\rangle$ the dihedral group of order $2p$. In this paper, we completely classify the cubic Cayley graphs on $D_{2p}$ up to isomorphism by means of spectral method. By…
By associating to a curve C of genus g=2k and a pencil of degree d=k+1 the so-called trace curve (resp. the reduced trace curve) we define a rational map from the Hurwitz space of admissible covers of genus g=2k and degree d=k+1 to a moduli…
An isomorphism between two graphs is a bijection between their vertices that preserves the edges. We consider the problem of determining whether two finite undirected weighted graphs are isomorphic, and finding an isomorphism relating them…
An investigation of morphisms that coincide topologically is used to generalize to all characteristics and partly reprove Tamagawa's theorem on the Grothendieck conjecture in anabelian geometry for affine hyperbolic curves. The theorem now…
It is known that isomorphisms of graph Jacobians induce cyclic bijections on the associated graphs. We characterize when such cyclic bijections can be strengthened to graph isomorphisms, in terms of an easily computed divisor. The result…
We examine ordered graphs, defined as graphs with linearly ordered vertices, from the perspective of homomorphisms (and colorings) and their complexities. We demonstrate the corresponding computational and parameterized complexities, along…
We define an algebraic setup of homology for hypergraphs, which defaults to simplicial homology in the case of graphs, and study its basic properties. As part of our study we define algebraic spanning trees of hypergraphs, along with…
An integral homology theory on the category of undirected reflexive graphs was constructed in [2]. A geometrical method to understand behaviors of $1$- and $2$-simplices under differential maps of the theory was developed in [3] and led us…
Partial duality generalizes the fundamental concept of the geometric dual of an embedded graph. A partial dual is obtained by forming the geometric dual with respect to only a subset of edges. While geometric duality preserves the genus of…
Abstractly, tropical hyperelliptic curves are metric graphs that admit a two-to-one harmonic morphism to a tree. They also appear as embedded tropical curves in the plane arising from triangulations of polygons with all interior lattice…
Let $\mathbb{D}$ be a division ring, and let ${\mathbb{D}}^{m\times n}$ be the set of $m\times n$ matrices over $\mathbb{D}$. Two matrices $A,B\in {\mathbb{D}}^{m\times n}$ are adjacent if ${\rm rank}(A-B)=1$. By the adjacency,…
We introduce the notion of a topological higher-rank graph, a unified generalization of the higher-rank graph and the topological graph. Using groupoid techniques, we define the Toeplitz and Cuntz-Krieger algebras of topological higher-rank…
Bases, mappings, projections and metrics, natural for Neural network training, are introduced. Graph-theoretical interpretation is offered. Non-Gaussianity naturally emerges, even in relatively simple datasets. Training statistics,…
We give a non-abelian analogue of Whitney's 2-isomorphism theorem for graphs. Whitney's theorem states that the cycle space determines a graph up to 2-isomorphism. Instead of considering the cycle space of a graph which is an abelian…
In this article we survey recent results on rigid dualizing complexes over commutative algebras. We begin by recalling what are dualizing complexes. Next we define rigid complexes, and explain their functorial properties. Due to the…
For a set-endofunctor $F$, we extend the notion of universal $F$-coalgebras to $F$-graphs. These generalized coalgebras are models for various types of graphs, such as (un)directed (hyper)graphs, relational structures or fuzzy graphs. The…
Homotopy Lie algebras are a generalization of differential graded Lie algebras encoding both the kinematics and dynamics of a given field theory. Focusing on kinematics, we show that these algebras provide a natural framework for the…