相关论文: Arrow graphs and their focal curves

The discrete Fourier transform and the FFT algorithm are extended from the circle to continuous graphs with equal edge lengths.

The paper investigates relationship between algebraic expressions and graphs. We consider a digraph called a Fibonacci graph which gives a generic example of non-series-parallel graphs. Our intention in this paper is to simplify the…

Filters are fundamental in extracting information from data. For time series and image data that reside on Euclidean domains, filters are the crux of many signal processing and machine learning techniques, including convolutional neural…

We introduce and prove basic results about several graph-theoretic notions relevant to the multiresolution analysis of flow graphs that represent the transfer of control in computer programs. We take a category-theoretical viewpoint to…

A connected graph can be associated with two distinct evolution algebras. In the first case, the structural matrix is the adjacency matrix of the graph itself. In the second case, the structural matrix is the transition probabilities matrix…

We present in this article the model Function-described graph (FDG), which is a type of compact representation of a set of attributed graphs (AGs) that borrow from Random Graphs the capability of probabilistic modelling of structural and…

In this paper, we define several measures induced by a finite directed graph. The study themselves is interesting ont only in the noncommutative probability point of view but also in the algebraic structure point of view, since to define…

Neural networks are often represented as graphs of connections between neurons. However, despite their wide use, there is currently little understanding of the relationship between the graph structure of the neural network and its…

The divisor theory for graphs is compared to the theory of linear series on curves through the correspondence associating a curve to its dual graph. An algebro-geometric interpretation of the combinatorial rank is proposed, and proved in…

In this paper, we first summarize the existing algorithms for computing all the generalized asymptotes of a plane algebraic curve implicitly or parametrically defined. From these previous results, we derive a method that allows to easily…

A proper vertex coloring of a graph is a mapping of its vertices on a set of colors, such that two adjacent vertices are not mapped to the same color. This constraint may be interpreted in terms of the distance between to vertices and so a…

A middle-cube is an induced subgraph consisting of nodes at the middle two layers of a hypercube. The middle-cubes are related to the well-known Revolving Door (Middle Levels) conjecture. We study the middle-cube graph by completely…

In this paper, we provide a characterization of uniquely representable two-directional orthogonal ray graphs, which are defined as the intersection graphs of rightward and downward rays. The collection of these rays is called a…

Graphs have a superior ability to represent relational data, like chemical compounds, proteins, and social networks. Hence, graph-level learning, which takes a set of graphs as input, has been applied to many tasks including comparison,…

We introduce a recursive procedure for computing the number of realizations of a minimally rigid graph on the sphere up to rotations. We accomplish this by combining two ingredients. The first is a framework that allows us to think of such…

We prove that two quiver operator algebras can be isometrically isomorphic only if the quivers (=directed graphs) are isomorphic. We also show how the graph can be recovered from certain representations of the algebra.

A projective variety whose Gauss map has positive dimensional fibres corresponds to a special kind of scroll called \emph{Gaussian}. A Gaussian scroll is a member of a canonical derived \emph{ Gaussian flag}. We introduce a duality in the…

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…

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…

We study the parameter space of a family of planar maps, which are linear on each of the right and left half-planes. We consider the set of parameters for which every orbit recurs to the boundary between half-planes. These parameters…