Related papers: Form uniqueness for graphs with weakly spherically…
We give sufficient conditions under which a random graph with a specified degree sequence is symmetric or asymmetric. In the case of bounded degree sequences, our characterisation captures the phase transition of the symmetry of the random…
We introduce the problem of Weak Dominance Drawing for general directed acyclic graphs and we show the connection with the linear extension diameter of a partial order P. We present complexity results and bounds.
Weak and strong coloring numbers are generalizations of the degeneracy of a graph, where for each natural number $k$, we seek a vertex ordering such every vertex can (weakly respectively strongly) reach in $k$ steps only few vertices with…
We study surfaces of constant positive Gauss curvature in Euclidean 3-space via the harmonicity of the Gauss map. Using the loop group representation, we solve the regular and the singular geometric Cauchy problems for these surfaces, and…
This paper studies singularity structures of the linear inviscid damping of two-dimensional Euler equations in a finite periodic channel. We introduce a recursive definition of singularity structures which characterize the singularities of…
In an earlier paper the authors proved that limits of convergent graph sequences can be described by various structures, including certain 2-variable real functions called graphons, random graph models satisfying certain consistency…
This paper introduces and studies the stability of the strong domination number of a graph, denoted $\operatorname{st}_{\gamma_{st}}(G)$, defined as the minimum number of vertices whose removal changes the strong domination number…
Several characterizations of weak cotype 2 and weak Hilbert spaces are given in terms of basis constants and other structural invariants of Banach spaces. For finite-dimensional spaces, characterizations depending on subspaces of fixed…
The theory of graph limits represents large graphs by analytic objects called graphons. Graph limits determined by finitely many graph densities, which are represented by finitely forcible graphons, arise in various scenarios, particularly…
We study singularities of Gauss maps of fronts and give characterizations of types of singularities of Gauss maps by geometric properties of fronts which are related to behavior of bounded principal curvatures. Moreover, we investigate…
We study entanglement properties of mixed density matrices obtained from combinatorial Laplacians. This is done by introducing the notion of the density matrix of a graph. We characterize the graphs with pure density matrices and show that…
A numbering $f$ of a graph $G$ of order $n$ is a labeling that assigns distinct elements of the set $\{1,2, \ldots, n \}$ to the vertices of $G$. The strength $\mathrm{str}\left(G\right) $ of $G$ is defined by $\mathrm{str}\left( G\right)…
A matching $M$ in a graph $G$ is uniquely restricted if there is no matching $M'$ in $G$ that is distinct from $M$ but covers the same vertices as $M$. Solving a problem posed by Golumbic, Hirst, and Lewenstein, we characterize the graphs…
Link residual closeness is a newly proposed measure for network vulnerability. In this model, vertices are perfectly reliable and the links fail independently of each other. It measures the vulnerability even when the removal of links does…
Graphs derived from groups are a widely studied class of graphs, motivated by their highly symmetric structure. In particular, G-graphs offer an easy and interesting alternative construction of semi-symmetric graphs. After recalling the…
Let $G$ be a finite simple graph. The line graph $L(G)$ represents the adjacencies between edges of $G$. We define first the line simplicial complex $\Delta_L(G)$ of $G$ containing Gallai and anti-Gallai simplicial complexes…
We investigate the structure of connected graphs, not necessarily locally finite, with infinitely many ends. On the one hand we study end-transitive such graphs and on the other hand we study such graphs with the property that the…
Given a hereditary graph property $\mathcal{P}$, consider distributions of random orderings of vertices of graphs $G\in\mathcal{P}$ that are preserved under isomorphisms and under taking induced subgraphs. We show that for many properties…
We study singularities of constant positive Gaussian curvature surfaces and determine the way they bifurcate in generic 1-parameter families of such surfaces. We construct the bifurcations explicitly using loop group methods. Constant…
An $n$-vertex graph $G$ is weakly $F$-saturated if $G$ contains no copy of $F$ and there exists an ordering of all edges in $E(K_n) \setminus E(G)$ such that, when added one at a time, each edge creates a new copy of $F$. The minimum size…