Related papers: Form uniqueness for graphs with weakly spherically…
In this paper, we extend the recently introduced concept of partially dual ribbon graphs to graphs. We then go on to characterize partial duality of graphs in terms of bijections between edge sets of corresponding graphs. This result…
The weak $k$-metric dimension of a graph is roughly understood as the cardinality of a smallest set of vertices $S$ of the graph with the property of uniquely recognizing all the vertices of the graph throughout summations of differences of…
We define direct sums and a corresponding notion of connectedness for graph limits. Every graph limit has a unique decomposition as a direct sum of connected components. As is well-known, graph limits may be represented by symmetric…
In this paper we give an explicit representation of the solutions of a characteristic Cauchy problem for a class of PDEs with singular coefficients. We give the explicit solutions in terms of the Gauss hypergeometric functions, which enable…
We characterize sandwiched singularities in terms of their link in two different settings. We first prove that such singularities are precisely the normal surface singularities having self-similar non-archimedean links. We describe this…
In this paper, we investigate the strength of chromatic symmetric homology as a graph invariant. Chromatic symmetric homology is a lift of the chromatic symmetric function for graphs to a homological setting, and its Frobenius…
The toughness of a graph $G$ is defined as the largest real number $t$ such that for any set $S\subseteq V(G)$ such that $G-S$ is disconnected, $S$ has at least $t$ times more elements than $G-S$ has components (unless $G$ is complete, in…
We prove a strong non-structure theorem for a class of metric structures with an unstable pair of formulae. As a consequence, we show that weak categoricity (that is, categoricity up to isomorphisms and not isometries) implies several…
We define and study structural properties of hypergraphs of models of a theory including lattice ones. Characterizations for the lattice properties of hypergraphs of models of a theory, as well as for structures on sets of isomorphism types…
We prove that if two graphs of girth at least 6 have isomorphic squares, then the graphs themselves are isomorphic. This is the best possible extension of the results of Ross and Harary on trees and the results of Farzad et al. on graphs of…
A Graph is called 2-self-centered if its diameter and radius both equal to 2. In this paper, we begin characterizing these graphs by characterizing edge-maximal 2-self-centered graphs via their complements. Then we split characterizing…
This paper deals with the interplay of the geometry of the norm and the weak topology in Banach spaces. Both dual and intrinsic connections between weak forms of rotundity and smoothness ared discussed. Weakly exposed points, weakly locally…
Graphons are analytic objects representing limits of convergent sequences of graphs. Lov\'asz and Szegedy conjectured that every finitely forcible graphon, i.e. any graphon determined by finitely many graph densities, has a simple…
A graph $G$ has the \emph{strong parity property} if for every subset $X\subseteq V$ with $|X|$ even, $G$ has a spanning subgraph $F$ with minimum degree at least one such that $d_F(v)\equiv 1\pmod 2$ for all $v\in X$, $d_F(y)\equiv 0\pmod…
We consider variational and stability properties of a system of two coupled nonlinear Schr\"{o}dinger equations on the star graph $\Gamma$ with the $\delta$ coupling at the vertex of $\Gamma$. The first part is devoted to the proof of an…
Weakly distance-regular digraphs are a natural directed version of distance-regular graphs. In [8], the third author and Suzuki proposed a question when an orientation of a distance-regular graph defines a weakly distance-regular digraph.…
The primary objective of this paper is to introduce Hyers-Ulam-type stability results for monotone, subadditive, and convex graphs. We consider their standard definitions in an approximate sense and demonstrate the existence of a…
We study a geometrical condition (PHWC) which is weaker than horizontal weak conformality. In particular, we show that harmonic maps satisfying this condition, which will be called {\em pseudoharmonic morphisms}, include harmonic morphisms…
\emph{Bidirected graphs} (a sort of nonstandard graphs introduced by Edmonds and Johnson) provide a natural generalization to the notions of directed and undirected graphs. By a \emph{weakly (node- or edge-) acyclic} bidirected graph we…
We demonstrate that field theories involving explicit breaking of continous symmetries, incorporate two generic classes of topological defects each of which is stable for a particular range of parameters. The first class includes defects of…