Related papers: Arrow graphs and their focal curves
We define and investigate a geometric object, called an associative geometry, corresponding to an associative algebra (and, more generally, to an associative pair). Associative geometries combine aspects of Lie groups and of generalized…
We define and investigate a geometric object, called an associative geometry, corresponding to an associative algebra (and, more generally, to an associative pair). Associative geometries combine aspects of Lie groups and of generalized…
A geometric graph is a graph drawn in the plane so that its vertices and edges are represented by points in general position and straight line segments, respectively. A vertex of a geometric graph is called pointed if it lies outside of the…
In this paper, we discuss some problems of elementary plane differential geometry and kinematics. Although the results are not new, the consistent use of complex-valued functions (plane curves) of a real variable (parameter) allows to…
Geometric constructions are widely used in computer graphics and engineering drawing. A right generalized cylinder is a ruled surface whose base curve is a plane curve perpendicular to the rulings. The paper discusses relations between the…
The splitting number is effective to distinguish the embedded topology of plane curves, and it is not determined by the fundamental group of the complement of the plane curve. In this paper, we give a generalization of the splitting number,…
A graph is a structure composed of a set of vertices (i.e.nodes, dots) connected to one another by a set of edges (i.e.links, lines). The concept of a graph has been around since the late 19$^\text{th}$ century, however, only in recent…
Let $G$ be a group. The directed endomorphism graph, $\dend(G)$ of $G$ is a directed graph with vertex set $G$ and there is a directed edge from the vertex $a$ to the vertex $b$ if $a \neq b$ and there exists an endomorphism on $G$ mapping…
Given a digraph D, the complementarity spectrum of the digraph is defined as the set of complementarity eigenvalues of its adjacency matrix. This complementarity spectrum has been shown to be useful in several fields, particularly in…
Graph neural networks are deep neural networks designed for graphs with attributes attached to nodes or edges. The number of research papers in the literature concerning these models is growing rapidly due to their impressive performance on…
The derived graph of a voltage graph consisting of a single vertex and two loops of different voltages is a circulant graph with two generators. We characterize the automorphism groups of connected, two-generator circulant graphs, and give…
We introduce the class of rational plane curves parameterizable by conics as an extension of the family of curves parameterizable by lines (also known as monoid curves). We show that they are the image of monoid curves via suitable…
Geometric graphs are a special kind of graph with geometric features, which are vital to model many scientific problems. Unlike generic graphs, geometric graphs often exhibit physical symmetries of translations, rotations, and reflections,…
We consider core-periphery structured graphs, which are graphs with a group of densely and sparsely connected nodes, respectively, referred to as core and periphery nodes. The so-called core score of a node is related to the likelihood of…
A plane graph is called a rectangular graph if each of its edges can be oriented either horizontally or vertically, each of its interior regions is a four-sided region and all interior regions can be fitted in a rectangular enclosure. If…
An arithmetical structure on a finite and connected graph G is a pair (d, r) of positive integer vectors such that r is primitive (the gcd of its entries is 1) and (diag(d) - A)r = 0, where A is the adjacency matrix of G. In this article,…
Graph-level representations are crucial tools for characterising structural differences between graphs. However, comparing graphs with different cardinalities, even when sampled from the same underlying distribution, remains challenging.…
To investigate the topological structure of Morse flows on the 2-disk we use the planar graphs as destinguished graph of the flow. We assume, that the flow is transversal to the boundary of the 2-disk. We give a list of all planar graph…
This paper introduces and demonstrates a computational pipeline for the statistical analysis of shape graph datasets, namely geometric networks embedded in 2D or 3D spaces. Unlike traditional abstract graphs, our purpose is not only to…
Diagrams as a graphic expresion of derivatives is proposed for calculation of derivatives for composed function. The concret diagram is understood as a virtual derivative in contrast of concret derivative. In polynomial expression of…