Related papers: Galois points for a finite graph
A graph is closed when its vertices have a labeling by [n] with a certain property first discovered in the study of binomial edge ideals. In this article, we explore various aspects of closed graphs, including the number of closed labelings…
We characterise the form of all simple, finite graphs for which the girth of the graph is equal to the circumference of the graph. We apply this to prove a bound on the number of edges in such a graph.
In this mostly expository note we explain how Nori's theory of motives achieves the aim of establishing a Galois theory of periods, at least under the period conjecture. We explain and compare different notions periods, different versions…
In the present paper, we introduce the concept of universal graph series. We then present four invariants of graphs and discuss some of their properties. In particular, one of these invariants is a generalization of the chromatic symmetric…
The paper by M. Baker and S. Norine in 2007 introduced a new parameter on configurations of graphs and gave a new result in the theory of graphs which has an algebraic geometry flavour. This result was called Riemann-Roch formula for graphs…
We prove that Menger's theorem is valid for infinite graphs, in the following strong form: let $A$ and $B$ be two sets of vertices in a possibly infinite digraph. Then there exist a set $\cp$ of disjoint $A$-$B$ paths, and a set $S$ of…
A criterion for the existence of a birational embedding with two Galois points for quotient curves is presented. We apply our criterion to several curves, for example, some cyclic subcovers of the Giulietti-Korchmaros curve or of the curves…
We propose an algorithm for solving of the graph isomorphism problem. Also, we introduce the new class of graphs for which the graph isomorphism problem can be solved polynomially using the algorithm.
In the preprint we present an outline of the one dimensional version of topological Galois theory. The theory studies topological obstruction to solvability of equations "in finite terms" (i.e. to their solvabilty by radicals, by elementary…
We present simple graph-theoretic characterizations of Cayley graphs for left-cancellative monoids, groups, left-quasigroups and quasigroups. We show that these characterizations are effective for the end-regular graphs of finite degree.
A criterion for the existence of a birational embedding of an algebraic curve into a projective plane with two Galois points is presented. Several novel examples of plane curves with two inner Galois points as an application are described.
Applying Baaz's Generalization Method and a new technique to, respectively, proofs and denumerable simple graphs, diverse arithmetical patterns are observed. In particular, sufficient conditions for a number to be a divisor of a Fermat…
Frames are the most natural generalization of orthonormal bases that allow the inclusion of redundant systems. In this article, we introduce the concept of frames generated by graphs in finite-dimensional spaces and study their properties.…
A method of constructing algebraic-geometric codes with many automorphisms arising from Galois points for algebraic curves is presented.
A criterion for the existence of a plane model with two non-smooth Galois points for algebraic curves is presented, which is a generalization of Fukasawa's criterion for two smooth Galois points. Owing to this generalized criterion,…
We suggest a measure of "Eulerianness" of a finite directed graph and define a class of "coEulerian" graphs. These are the graphs whose Laplacian lattice is as large as possible. As an application, we address a question in chip-firing posed…
In this note we prove that every closed graph $G$ is up to isomorphism a proper interval graph. As a consequence we obtain that there exist linear-time algorithms for closed graph recognition.
Galois theory is developed using elementary polynomial and group algebra. The method follows closely the original prescription of Galois, and has the benefit of making the theory accessible to a wide audience. The theory is illustrated by a…
By a finite type-graph we mean a graph whose set of vertices is the set of all $k$-subsets of $[n]=\{1,2,\ldots, n\}$ for some integers $n\ge k\ge 1$, and in which two such sets are adjacent if and only if they realise a certain order type…
There are two purposes in this article. One is to present a criterion for the existence of a birational embedding into a projective plane with inner and outer Galois points for algebraic curves. Another is to classify plane curves of degree…