Related papers: A Multigraph Characterization of Permutiple String…
Given a finite word $w$ over a finite alphabet $V$, consider the graph with vertex set $V$ and with an edge between two elements of $V$ if and only if the two elements alternate in the word $w$. Such a graph is said to be word-representable…
This report presents an expression for the number of a multiset's sub-multisets of a given cardinality as a function of the multiplicity of its elements. This is also the number of distinct samples of a given size that may be produced by…
Letters $x$ and $y$ alternate in a word $w$ if after deleting in $w$ all letters but the copies of $x$ and $y$ we either obtain a word $xyxy\cdots$ (of even or odd length) or a word $yxyx\cdots$ (of even or odd length). A graph $G=(V,E)$ is…
A mixed graph can be seen as a type of digraph containing some edges (two opposite arcs). Here we introduce the concept of sequence mixed graphs, which is a generalization of both sequence graphs and iterated line digraphs. These structures…
Graph-based modeling plays a fundamental role in many areas of computer science. In this paper, we introduce systems of graph formulas with variables for specifying graph properties; this notion generalizes the graph formulas introduced in…
The degree sequence of a graph is a numerical method to characterize the properties of graphs. Generalized forms of degree sequences exist for complete graphs and complete graphs. Nikolopolus et al. characterized the number of spanning…
A permutation may be represented by a collection of paths in the plane. We consider a natural class of such representations, which we call tangles, in which the paths consist of straight segments at 45 degree angles, and the permutation is…
A superpermutation on $n$ symbols is a string that contains each of the $n!$ permutations of the $n$ symbols as a contiguous substring. The shortest superpermutation on $n$ symbols was conjectured to have length $\sum_{i=1}^n i!$. The…
Natural numbers satisfying an unusual property are mentioned by the author in [5], in which their infinitude is also proved. In this paper, we start with an arbitrary natural number which is not a multiple of 10 and non-palindromic, form…
The coupling complexity index is an information measure introduced within the framework of ordinal symbolic dynamics. This index is used to characterize the complexity of the relationship between dynamical system components. In this work,…
Multiplicative invariance is a well-studied property of subsets of the unit interval. The theory in the complex plane is less developed. This paper introduces an analogous definition for multiplicative invariance in the complex plane…
A natural representation of random graphs is the random measure. The collection of product random measures, their transformations, and non-negative test functions forms a general representation of the collection of non-negative weighted…
We characterise the quartic (i.e. 4-regular) multigraphs with the property that every edge lies in a triangle. The main result is that such graphs are either squares of cycles, line multigraphs of cubic multigraphs, or are obtained from…
A sum graph is a finite simple graph whose vertex set is labeled with distinct positive integers such that two vertices are adjacent if and only if the sum of their labels is itself another label. The spum of a graph $G$ is the minimum…
A calligraph is a graph that for almost all edge length assignments moves with one degree of freedom in the plane, if we fix an edge and consider the vertices as revolute joints. The trajectory of a distinguished vertex of the calligraph is…
A composition of a nonnegative integer (n) is a sequence of positive integers whose sum is (n). A composition is palindromic if it is unchanged when its terms are read in reverse order. We provide a generating function for the number of…
Bigraphs are a universal computational modelling formalism for the spatial and temporal evolution of a system in which entities can be added and removed. We extend bigraphs to probablistic bigraphs, and then again to action bigraphs, which…
Permutation symmetries of multipartite quantum states are defined only when the constituent subsystems are of equal dimensions. In this work we extend this notion of permutation symmetry to heterogeneous systems, that is, systems composed…
The commuting graph of a non-commutative ring $R$ with center $Z(R)$ is a simple undirected graph whose vertex set is $R\setminus Z(R)$ and two vertices $x, y$ are adjacent if and only if $xy = yx$. In this paper, we compute the spectrum…
In order to define graph transformations by the simultaneous application of concurrent rules, we have adopted in previous work a structure of attributed graphs stable by unions. We analyze the consequences on parallel independence, a…