Related papers: Arrow graphs and their focal curves
The main aim of this note is to provide characterization theorems concerning real derivations. Among others the following implication will be verified: Assume that $\xi\colon \mathbb{R}\to \mathbb{R}$ is a given differentiable function and…
A graphical model is a statistical model that is associated to a graph whose nodes correspond to variables of interest. The edges of the graph reflect allowed conditional dependencies among the variables. Graphical models admit…
Graph aggregation is the process of computing a single output graph that constitutes a good compromise between several input graphs, each provided by a different source. One needs to perform graph aggregation in a wide variety of…
We address the problem of defining graph transformations by the simultaneous application of direct transformations even when these cannot be applied independently of each other. An algebraic approach is adopted, with production rules of the…
In this paper, we introduce the concepts of the plain eigenvalue, the main-plain index and the refined spectrum of graphs. We focus on the graphs with two main and two plain eigenvalues and give some characterizations of them.
Flow fields are often represented by a set of static arrows to illustrate scientific vulgarization, documentary film, meteorology, etc. This simple schematic representation lets an observer intuitively interpret the main properties of a…
The characterization of local regularity is a fundamental issue in signal and image processing, since it contains relevant information about the underlying systems. The 2-microlocal frontier, a monotone concave downward curve in $\mathbb…
The traditional study of plane and space algebraic curves by looking at their tangent vectors, curvatures and torsions provides geometric, but unfortunately not sufficient information about individual curves in order to be able to…
The purpose of this article is to find a family of curves parametrized by arc length and that depend on an angular function and an intrinsic fraction function, which is defined as the quotient between torsion and curvature. We find for this…
A rectangular dual of a plane graph $G$ is a contact representations of $G$ by interior-disjoint axis-aligned rectangles such that (i) no four rectangles share a point and (ii) the union of all rectangles is a rectangle. A rectangular dual…
Highly-regular graphs can be regarded as a combinatorial generalization of distance-regular graphs. From this standpoint, we study combinatorial aspects of highly-regular graphs. As a result, we give the following three main results in this…
We study complex analytic (possibly singular) projective connections on the plane. We characterize some of them in terms of their families of integral curves. We also give a beginning of classification of second order odes polynomial in the…
Digraphs are generalizations of graphs in which each edge is assigned with a direction or two directions. In this paper, we define discrete Morse functions on digraphs, and prove that the homology of the Morse complex and the path homology…
Graph polynomials are graph parameters invariant under graph isomorphisms which take values in a polynomial ring with a fixed finite number of indeterminates. We study graph polynomials from a model theoretic point of view. In this paper we…
We study the relation between the type of a double point of a plane curve and the curvilinear 0-dimensional subschemes of the curve at the point. An Algorithm related to a classical procedure for the study of double points via osculating…
We develop a notion of a dual of a graph, generalizing the definition of Goulden and Yong (which only applied to trees), and reproving their main result using our new notion. We in fact give three definitions of the dual: a graph-theoretic…
In 2010, Joyce et. al defined the leverage centrality of vertices in a graph as a means to analyze functional connections within the human brain. In this metric a degree of a vertex is compared to the degrees of all it neighbors. We…
This paper is concerned with long-time interest of us, especially, the author, in realizing graphs as Reeb graphs of real algebraic functions of certain nice classes. The Reeb graph of a differentiable function is the set consisting of all…
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…
There is a well-documented research programme on graph operators which addresses questions such as `Which graphs appear as images of graphs?'; `Which graphs are fixed under the operator?'; `What happens if the operator is iterated?' In this…