Related papers: Modular Irregularity Strength of Triangular Book G…
A vertex labeling of a hypergraph is sum distinguishing if it uses positive integers and the sums of labels taken over the distinct hyperedges are distinct. Let s(H) be the smallest integer N such that there is a sum-distinguishing labeling…
In this article we introduce the new modulus $\triangle'_{X,\phi}(\varepsilon)$, for which we prove that in the general case is different from the classical modulus of noncompact convexity. The main result of the paper is showing the…
We study vulnerability of a uniformly distributed random graph to an attack by an adversary who aims for a global change of the distribution while being able to make only a local change in the graph. We call a graph property $A$…
In this paper, we define and compare four new measures of graph irregularity. We use these measures to prove upper bounds for the chromatic number and the Colin de Verdiere parameter. We also strengthen the concise Turan theorem for…
For a family $\mathcal{F}$ of graphs, let $ex(n,\mathcal{F})$ denote the maximum number of edges in an $n$-vertex graph which contains none of the members of $\mathcal{F}$ as a subgraph. A longstanding problem in extremal graph theory asks…
In this study we consider the problem of triangulated graphs. Precisely we give a necessary and sufficient condition for a graph to be triangulated. This give an alternative characterization of triangulated graphs. Our method is based on…
It is known that complete graphs and complete multipartite graphs have modularity zero. We show that the least number of edges we may delete from the complete graph $K_n$ to obtain a graph with non-zero modularity is $\lfloor n/2\rfloor…
In the suborbital graphs studies, there has been a research gap in the sense that the Modular group is connected to two numbers. Thus, this paper attempts to contribute to the studies developed by Gauss, Bolyai, Lobachevsky and Riemann.…
We investigate topological, combinatorial, statistical, and enumeration properties of finite graphs with high Kolmogorov complexity (almost all graphs) using the novel incompressibility method. Example results are: (i) the mean and variance…
When twisting a strip of paper or acetate under high longitudinal tension, one observes, at some critical load, a buckling of the strip into a regular triangular pattern. Very similar triangular facets have recently been observed in…
The (un)weighted stability for some matrices is one of essential hypotheses in time-frequency analysis and applied harmonic analysis. In the first part of this paper, we show that for a localized matrix in a Beurling algebra, its weighted…
Let G be a finite graph with the non-k-order property (essentially, a uniform finite bound on the size of an induced sub-half-graph). A major result of the paper applies model-theoretic arguments to obtain a stronger version of…
Inferring tie strengths (strong vs. weak) is a core task in network analysis, often guided by the Strong Triadic Closure (STC) principle. In multilayer networks, such as social platforms or biological systems, applying STC independently to…
This work explores the definiteness of the weighted graph Laplacian matrix with negative edge weights. The definiteness of the weighted Laplacian is studied in terms of certain matrices that are related via congruent and similarity…
We introduce an invariant, associated to a coherent sheaf over a projective morphism of schemes, which controls when sheaf cohomology can be passed through the given morphism. We then use this invariant to estimate the stability indexes of…
We study modulational instability in a fiber system resembling a dispersion-managed link where the sign of the group-velocity dispersion varies randomly according to a telegraph process. We find that the instability gain of stochastic…
We give a necessary condition for two diagrams of $3$-regular spatial graphs with the same underlying abstract graph $G$ to represent isotopic spatial graphs. The test works by reading off the writhes of the knot diagrams coming from a…
The Fibonacci index of a graph is the number of its stable sets. This parameter is widely studied and has applications in chemical graph theory. In this paper, we establish tight upper bounds for the Fibonacci index in terms of the…
In this paper we enumerate the necessary and sufficient conditions for the weak modular product of two simple graphs to be perfect. The weak modular product differs from the direct product by also encoding non-adjacencies of the factor…
Graph rigidity theory studies the capability of a graph embedded in the Euclidean space to constrain its global geometric shape via local constraints among nodes and edges, and has been widely exploited in network localization and formation…