Related papers: Note on power hypergraphs with equal domination an…
A numbering $f$ of a graph $G$ of order $n$ is a labeling that assigns distinct elements of the set $\left\{ 1,2,\ldots ,n\right\} $ to the vertices of $G$. The strength $\textrm{str}_{f}\left( G\right)$ of a numbering $f:V\left( G\right)…
In this paper, we investigate the relation between the (fractional) domination number of a digraph $G$ and the independence number of its underlying graph, denoted by $\alpha(G)$. More precisely, we prove that every digraph $G$ has…
In this paper, we obtain the exact values of several domination parameters for the direct product of a complete graph with a path or a cycle. Specifically, we determine the domination number, independent domination number,…
Gassert's paper "A NOTE ON THE MONOGENEITY OF POWER MAPS" is cited at least by $17$ papers in the context of monogeneity of pure number fields despite some errors that it contains and remarks on it. In this note, we point out some of these…
Pareto distributions, and power laws in general, have demonstrated to be very useful models to describe very different phenomena, from physics to finance. In recent years, the econophysical literature has proposed a large amount of papers…
We extend the concept of the law of a finite graph to graphings, which are, in general, infinite graphs whose vertices are equipped with the structure of a probability space. By doing this, we obtain a vast array of new unimodular measures.…
The concept of generalized domination unifies well-known variants of domination-like and independence problems, such as Dominating Set, Independent Set, Perfect Code, etc. A generalized domination (also called $[\sigma,\rho]$-Dominating…
The different notions of matings of pairs of equal degree polynomials are introduced and are related to each other as well as known results on matings. The possible obstructions to matings are identified and related. Moreover the relations…
We collect some statements regarding equivalence of the parities of various class numbers and signature ranks of units in prime power cyclotomic fields. We correct some misstatements in the literature regarding these parities by providing…
The present paper offers, in its first part, a unified approach for the derivation of families of inequalities for set functions which satisfy sub/supermodularity properties. It applies this approach for the derivation of information…
The rankability of data is a recently proposed problem that considers the ability of a dataset, represented as a graph, to produce a meaningful ranking of the items it contains. To study this concept, a number of rankability measures have…
The Apollonian networks display the remarkable power-law and small-world properties as observed in most realistic networked systems. Their dual graphs are extended Tower of Hanoi graphs, which are obtained from the Tower of Hanoi graphs by…
In the seminal monograph "Theory of retracts", Borsuk raised the following question: suppose two compact ANR's are $h$--equal, i.e. mutually homotopy dominate each other, are they homotopy equivalent? The current paper approaches this…
WE determine the existence of exact (efficient) doubly dominating sets in three famous structures and in their complement for arbitrary graphs.
In the branch of mathematics known as graph theory, graphs are considered as a set of points, called vertices, with connections between these points, called edges. The purpose of this paper is to study mappings between two graphs that have…
The power law is useful in describing count phenomena such as network degrees and word frequencies. With a single parameter, it captures the main feature that the frequencies are linear on the log-log scale. Nevertheless, there have been…
The nonlinear concepts of mixed summable families and maps for the spaces that only non-void sets are developed. Several characterizations of the corresponding concepts are achieved and the proof for a general Pietsch Domination-type…
It turns out that some empirical facts in Big Data are the effects of properties of large numbers. Zipf's law 'noise' is an example of such an artefact. We expose several properties of the power law distributions and of similar distribution…
These notes concern aspects of various graphs whose vertex set is a group $G$ and whose edges reflect group structure in some way (so that they are invariant under the action of the automorphism group of $G$). The graphs I will discuss are…
This paper is devoted to present two counterexamples to the theorem from \cite{MK} Maria R., Katherine T. M., Bernardo S. M., Extremal graphs with bounded vertex bipartiteness number, Linear Algebra Appl. 493 (2016) 28-36. Moreover, the…