Related papers: Arithmetical Structures on Paths With a Doubled Ed…
The concept of viewing graph solvability has gained significant interest in the context of structure-from-motion. A viewing graph is a mathematical structure where nodes are associated to cameras and edges represent the epipolar geometry…
In this paper we introduce a new technique to analyze families of rankings focused on the study of structural properties of a new type of graphs. Given a finite number of elements and a family of rankings of those elements, we say that two…
Testing a graph on 2-vertex- and 2-edge-connectivity are two fundamental algorithmic graph problems. For both problems, different linear-time algorithms with simple implementations are known. Here, an even simpler linear-time algorithm is…
In this paper we study underlying graphs corresponding to a set of halving lines. We establish many properties of such graphs. In addition, we tighten the upper bound for the number of halving lines.
We determine which properties of 2-layer drawings characterise bipartite graphs of bounded pathwidth.
Diagonalizability plays an important role in the analysis and design of multivariable systems. A structured matrix is called structurally diagonalizable if almost all of its numerical realizations, obtained by assigning real values to its…
Graph labeling is a technique that assigns unique labels or weights to the vertices or edges of a graph, often used to analyze and solve various graph-related problems. There are few methods with certain limitations conducted by researchers…
Consider two families of closed oriented curves in a d-manifold. At each point of intersecction of a curve of one family with a curve of the other family, form a new closed curve by going around the first curve and then going around the…
A bisection of a graph is a bipartition of its vertex set in which the number of vertices in the two parts differ by at most 1, and its size is the number of edges which go across the two parts. In this paper, motivated by several questions…
One describes those double structures on rational normal curves which are defined scheme theoretically by quadratic equations and have linear syzygies, generalizing this way the double line in the plane
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…
We study the basic properties of a prime sum graph, which is a simple graph defined on $\mathbb N$ where two vertices are adjacent if and only if their sum is a prime number. Further, we investigate some specific structures that appear…
Pairs of graded graphs, together with the Fomin property of graded graph duality, are rich combinatorial structures providing among other a framework for enumeration. The prototypical example is the one of the Young graded graph of integer…
Graphs on integer points of polytopes whose edges come from a set of allowed differences are studied. It is shown that any simple graph can be embedded in that way. The minimal dimension of such a representation is the fiber dimension of…
In this article, a framework for defining and analysing a family of graphs or networks from symbolic music information is discussed. Such graphs concern different types of elements, such as pitches, chords and rhythms, and the relations…
A degeneration of a smooth projective curve to a strongly stable curve gives rise to a specialization map from divisors on curves to divisors on graphs. In this paper we show that this specialization behaves well under the presence of real…
With this work we aim to show how Mathematica can be a useful tool to investigate properties of combinatorial structures. Specifically, we will face enumeration problems on independent subsets of powers of paths and cycles, trying to…
Metric graphs are often introduced based on combinatorics, upon "associating" each edge of a graph with an interval; or else, casually "gluing" a collection of intervals at their endpoints in a network-like fashion. Here we propose an…
In this paper, we use a partition of the links of a network in order to uncover its community structure. This approach allows for communities to overlap at nodes, so that nodes may be in more than one community. We do this by making a node…
Data processing systems impose multiple views on data as it is processed by the system. These views include spreadsheets, databases, matrices, and graphs. Associative arrays unify and simplify these different approaches into a common…