Related papers: Galois points for a finite graph

Graph theory has provided a very useful tool, called topological indices which are a number obtained from the graph $G$ with the property that every graph $H$ isomorphic to $G$, value of a topological index must be same for both $G$ and…

We show all the possible structures of finite subgroups of the automorphism groups of elliptic curves. Here the automorphism means the biholomorphic transformation. Using the result, we determine every Galois group G at outer Galois point…

In this note, we define a new graph $\Gamma_d(G)$ on a finite group $G$, where $d$ is a divisor of $|G|$. The vertices of $\Gamma_d(G)$ are the subgroups of $G$ of order $d$ and two subgroups $H_1$ and $H_2$ of $G$ are said to be adjacent…

Some of the basic properties of any dynamical system can be summarized by a graph. The dynamical systems in our theory run from maps like the logistic map to ordinary differential equations to dissipative partial differential equations. Our…

A Galois theory of differential fields with parameters is developed in a manner that generalizes Kolchin's theory. It is shown that all connected differential algebraic groups are Galois groups of some appropriate differential field…

This paper presents a connection between Galois points and rational functions over a finite field with small value sets. This paper proves that the defining polynomial of any plane curve admitting two Galois points is an irreducible…

This introduction to graphs and graph algebras provides the optimal bound for the number of all paths of length $k$ in a graph with $N\geq k$ edges and no loops. Our proof relies on a construction of a number of terminating algorithms that…

In 1988, I. Beck introduced the notion of a zero-divisor graph of a commutative rings with $1$. There have been several generalizations in recent years. In particular, in 2007 J. Coykendall and J. Maney developed the irreducible divisor…

In this paper, we study commutative zero-divisor semigroups determined by graphs. We prove a uniqueness theorem for a class of graphs. We show two classes of graphs that have no corresponding semigroups. In particular, any complete graph…

For every graph that is mimimally rigid in the plane, its Galois group is defined as the Galois group generated by the coordinates of its planar realizations, assuming that the edge lengths are transcendental and algebraically independent.…

This paper stands at the intersection of two distinct lines of research. One line is "holographic algorithms," a powerful approach introduced by Valiant for solving various counting problems in computer science; the other is "normal factor…

We provide an algorithm, running in polynomial time in the number of vertices, computing the unique solution to the biased infinity Laplacian Boundary Problem on finite graphs. The algorithm is based on the general outline and approach…

In this paper, we study the genera of zero-divisor graphs with respect to ideals in finite rings.

In the branch of mathematics known as graph theory, graphs are considered as a set of points, called vertices, with connections between these points, called edges. The purpose of this paper is to study mappings between two graphs that have…

In this article we present a new method to obtain polynomial lower bounds for Galois orbits of torsion points of one dimensional group varieties.

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…

Linear finite dynamical systems play an important role, for example, in coding theory and simulations. Methods for analyzing such systems are often restricted to cases in which the system is defined over a field %and usually strive to…

In this paper we offer a metric similar to graph edit distance which measures the distance between two (possibly infinite)weighted graphs with finite norm (we define the norm of a graph as the sum of absolute values of its edges). The main…

Frank Harary introduced the concepts of sum and integral sum graphs. A graph $G$ is a \textit{sum graph} if the vertices of $G$ can be labeled with distinct positive integers so that $e = uv$ is an edge of $G$ if and only if the sum of the…

In this paper, we study new Cayley graphs over the additive group of Galois rings. First we prove that they are expander graphs by using a Weil-Carlitz-Uchiyama type estimation of character sums for Galois rings. We also show that Cayley…