Related papers: Minimal Graph Transformations and their Classifica…
We prove that the Gauss curvature and the curvature of the normal connection of any minimal surface in the four dimensional Euclidean space satisfy an inequality, which generates two classes of minimal surfaces: minimal surfaces of general…
We introduce a new family of closed differential forms naturally associated with minimal graphical submanifolds in Euclidean space, defined in arbitrary codimension. For each minimal graph, we construct an explicit closed form whose…
In this paper, we study the family ${\mathcal C}_{H}^0$ of sense-preserving complex-valued harmonic functions $f$ that are normalized close-to-convex functions on the open unit disk $\mathbb{D}$ with $f_{\bar{z}}(0)=0$. We derive a…
In this paper, we discuss the minimal surfaces over the slanted half-planes, vertical strips, and single slit whose slit lies on the negative real axis. The representation of these minimal surfaces and the corresponding harmonic mappings…
The article starts with some introductory material about resolution graphs of normal surface singularities (definitions, topological/homological properties, etc). We then discuss the case when the normal surface singularity is an N-fold…
In this paper, solution space organization of minimum vertex-cover problem is deeply investigated using the K\"{o}nig-Eg\'{e}rvary (KE) graph and theorem, in which a hierarchical decomposition mechanism named KE-layer structure of general…
An interesting problem in classical differential geometry is to find methods to prove that two surfaces defined by different charts actually coincide up to position in space. In a previous paper we proposed a method in this direction for…
In this paper, we give definitions of three kinds of minimal charts, and we investigate properties of minimal charts and establish fundamental theorems characterizing minimal charts. To classify charts with two or three crossings we use the…
Tree decompositions of graphs are of fundamental importance in structural and algorithmic graph theory. Planar decompositions generalise tree decompositions by allowing an arbitrary planar graph to index the decomposition. We prove that…
Graphs are complex objects that do not lend themselves easily to typical learning tasks. Recently, a range of approaches based on graph kernels or graph neural networks have been developed for graph classification and for representation…
Graph partitioning is the problem of dividing the nodes of a graph into balanced partitions while minimizing the edge cut across the partitions. Due to its combinatorial nature, many approximate solutions have been developed, including…
We construct sense-preserving univalent harmonic mappings which map the unit disk onto a domain which is convex in the horizontal direction, but with varying dilatation. Also, we obtain minimal surfaces associated with such harmonic…
We investigate the property of a spatial graph of having a leveled embedding and characterize the abstract graphs with this property. We show that all leveled embeddings are free and we compare leveled and paneled (also known as flat)…
The widely studied edge modification problems ask how to minimally alter a graph to satisfy certain structural properties. In this paper, we introduce and study a new edge modification problem centered around transforming a given graph into…
What is the best way to match the nodes of two graphs? This graph alignment problem generalizes graph isomorphism and arises in applications from social network analysis to bioinformatics. Some solutions assume that auxiliary information on…
The size of the smallest $k$-regular graph of girth at least $g$ is denoted by the well-studied function $n(k,g)$. We introduce an analogous function $n(H,g)$, defined as the smallest size graph of girth at least $g$ that is a lift (or…
In this paper, we introduce a graph matching method that can account for constraints of arbitrary order, with arbitrary potential functions. Unlike previous decomposition approaches that rely on the graph structures, we introduce a…
The GraphBLAS standard (GraphBlas.org) is being developed to bring the potential of matrix based graph algorithms to the broadest possible audience. Mathematically the Graph- BLAS defines a core set of matrix-based graph operations that can…
Motivated by the increasing need for fast processing of large-scale graphs, we study a number of fundamental graph problems in a message-passing model for distributed computing, called $k$-machine model, where we have $k$ machines that…
The crossing number of a graph is the least number of crossings over all drawings of the graph in the plane. Computing the crossing number of a given graph is NP-hard, but fixed-parameter tractable (FPT) with respect to the natural…