Related papers: The Realizable Extension Problem and the Weighted …
By generalizing a recent result of Hong, Liu, and Lai on characterizing the degree-sequences of simple strongly connected directed graphs, a characterization is provided for degree-sequences of simple $k$-node-connected digraphs. More…
We initiate the theoretical study of Ext-TSP, a problem that originates in the area of profile-guided binary optimization. Given a graph $G=(V, E)$ with positive edge weights $w: E \rightarrow R^+$, and a non-increasing discount function…
The main result of the present paper, combined with earlier results of Hardt and Lin settles the extension problem for $W^{1,p}(\mathcal M, \mathcal N)$, where $\mathcal M$ and $\mathcal N$ are compact riemannian manfolds, $\mathcal M$…
Designing well-connected graphs is a fundamental problem that frequently arises in various contexts across science and engineering. The weighted number of spanning trees, as a connectivity measure, emerges in numerous problems and plays a…
A graph $G$ is said to be $k$-extendable if every matching of size $k$ in $G$ can be extended to a perfect matching of $G$, where $k$ is a positive integer. We say $G$ is $1$-excludable if for every edge $e$ of $G$, there exists a perfect…
A proper total weighting of a graph $G$ is a mapping $\phi$ which assigns to each vertex and each edge of $G$ a real number as its weight so that for any edge $uv$ of $G$, $\sum_{e \in E(v)}\phi(e)+\phi(v) \ne \sum_{e \in…
A graph $G=(V,E)$ is called $(k,k')$-choosable if for any total list assignment $L$ which assigns to each vertex $v$ a set $L(v)$ of $k$ real numbers, and assigns to each edge $e$ a set $L(e)$ of $k'$ real numbers, there is a mapping…
This article emphasizes an extension of the study of metric and par- tition dimension to hypergraphs. We give a sharp lower bounds for the metric and partition dimension of hypergraphs in general and give exact values under specified…
A connected graph has a $(k,\ell)$-cover if each of its edges is contained in at least $\ell$ cliques of order $k$. Motivated by recent advances in extremal combinatorics and the literature on edge modification problems, we study the…
In this paper we extend some classical NP-hardness results from the class of 2-connected planar graphs to subclasses of 3-connected planar graphs. The reduction are partly based on a new graph augmentation, which may be of independent…
We prove that any closed map between metrizable spaces can be extended to a closed map between completely metrizable spaces with the same extensional dimension.
The problem of finding the maximum-weight, planar subgraph of a finite, simple graph with nonnegative real edge weights is well known in industrial and electrical engineering, systems biology, sociology and finance. As the problem is known…
The question if a given partial solution to a problem can be extended reasonably occurs in many algorithmic approaches for optimization problems. For instance, when enumerating minimal dominating sets of a graph $G=(V,E)$, one usually…
We prove new explicit inapproximability results for the Vertex Cover Problem on the Power Law Graphs and some functional generalizations of that class of graphs. Our results depend on special bounded degree amplifier constructions for those…
In this article we study modules over wild canonical algebras which correspond to extension bundles [9] over weighted projective lines. We prove that all modules attached to extension bundles can be established by matrices with coefficients…
We consider the problem of perfectly recovering the vertex correspondence between two correlated Erd\H{o}s-R\'enyi (ER) graphs. For a pair of correlated graphs on the same vertex set, the correspondence between the vertices can be obscured…
We extend the previously observed scaling equation connecting the internode distances and nodes' degrees onto the case of weighted networks. We show that the scaling takes a similar form in the empirical data obtained from networks…
Temporal graphs provide a useful model for many real-world networks. Unfortunately the majority of algorithmic problems we might consider on such graphs are intractable. There has been recent progress in defining structural parameters which…
In this paper we introduce extensions and modifications of the classical degree sequence graphic realization problem studied by Erd\H{o}s-Gallai and Havel-Hakimi, as well as of the corresponding connected graphic realization version. We…
Finding, counting and/or listing triangles (three vertices with three edges) in large graphs are natural fundamental problems, which received recently much attention because of their importance in complex network analysis. We provide here a…