Related papers: From Singularities to Graphs
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…
We propose a new approach to text semantic analysis and general corpus analysis using, as termed in this article, a "bi-gram graph" representation of a corpus. The different attributes derived from graph theory are measured and analyzed as…
In this paper, we introduce some particular families of graphicable algebras obtained by following a relatively new line of research, initiated previously by some of the authors. It consists of the use of certain objects of Discrete…
We develop theory and methods that use the graph Laplacian to analyze the geometry of the underlying manifold of datasets. Our theory provides theoretical guarantees and explicit bounds on the functional forms of the graph Laplacian when it…
A graph is a data structure composed of dots (i.e. vertices) and lines (i.e. edges). The dots and lines of a graph can be organized into intricate arrangements. The ability for a graph to denote objects and their relationships to one…
The analysis of graphs has become increasingly important to a wide range of applications. Graph analysis presents a number of unique challenges in the areas of (1) software complexity, (2) data complexity, (3) security, (4) mathematical…
This work studies certain aspects of graphs embedded on surfaces. Initially, a colored graph model for a map of a graph on a surface is developed. Then, a concept analogous to (and extending) planar graph is introduced in the same spirit as…
New notions are introduced in algebra in order to better study the congruences in number theory. For example, the <special semigroups> makes an important such contribution.
Graph convexity has been used as an important tool to better understand the structure of classes of graphs. Many studies are devoted to determine if a graph equipped with a convexity is a {\em convex geometry}. In this work we survey…
Binary relations are one of the standard ways to encode, characterise and reason about graphs. Relation algebras provide equational axioms for a large fragment of the calculus of binary relations. Although relations are standard tools in…
We study countable graphs that -- up to isomorphism and with probability one -- arise from a random process, in a similar fashion as the Rado graph. Unlike in the classical case, we do not require that probabilities assigned to pairs of…
We present a form of algebraic reasoning for computational objects which are expressed as graphs. Edges describe the flow of data between primitive operations which are represented by vertices. These graphs have an interface made of…
While advances in computing resources have made processing enormous amounts of data possible, human ability to identify patterns in such data has not scaled accordingly. Efficient computational methods for condensing and simplifying data…
Let $\Gamma$ be a simple graph on a finite vertex set $V$ and let $A$ be its adjacency matrix. Then $\Gamma$ is said to be singular if and only if $0$ is an eigenvalue of $A.$ The nullity (singularity) of $\Gamma,$ denoted by ${\rm…
Special Bohr - Sommerfeld geometry, first formulated for simply connected symplectic manifolds (or for simple connected algebraic varieties), gives rise to some natural problems for the simplest example in non simply connected case. Namely…
Graph theory provides a language for studying the structure of relations, and it is often used to study interactions over time too. However, it poorly captures the both temporal and structural nature of interactions, that calls for a…
The main purpose of this note is to pose a couple of problems which are easily formulated thought some seem to be not yet solved. These problems are of general interest for discrete mathematics including a new twig of a bough of theory of…
In this paper, we study the computation of curvatures at the singular points of algebraic curves and surfaces. The idea is to convert the problem to compute the curvatures of the corresponding regular parametric curves and surfaces, which…
These lecture notes provide an introduction to automorphism groups of graphs. Some special families of graphs are then discussed, especially the families of Cayley graphs generated by transposition sets.
In this work, we introduce a new notion for representing graph classes with formal languages. In contrast to the seminal work by Kitaev and Pyatkin to represent graphs by words, we use formal binary languages in order to have a set of…