Related papers: Lower Bounds for Electrical Reduction on Surfaces

The network reconfiguration problem seeks to find a rooted tree $T$ such that the energy of the (unique) feasible electrical flow over $T$ is minimized. The tree requirement on the support of the flow is motivated by operational constraints…

Haviv ({\em European Journal of Combinatorics}, 2019) has recently proved that some topological lower bounds on the chromatic number of graphs are also lower bounds on their orthogonality dimension over $\mathbb{R}$. We show that this holds…

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…

We provide a short proof of a conjecture of Davila and Kenter concerning a lower bound on the zero forcing number $Z(G)$ of a graph $G$. More specifically, we show that $Z(G)\geq (g-2)(\delta-2)+2$ for every graph $G$ of girth $g$ at least…

Computing the number of realizations of a minimally rigid graph is a notoriously difficult problem. Towards this goal, for graphs that are minimally rigid in the plane, we take advantage of a recently published algorithm, which is the…

Graph packing generally deals with unlabeled graphs. In \cite{EHRT11}, the authors have introduced a new variant of the graph packing problem, called the \textit{labeled packing of a graph}. This problem has recently been studied on trees…

We discuss the problem of embedding graphs in the plane with restrictions on the vertex mapping. In particular, we introduce a technique for drawing planar graphs with a fixed vertex mapping that bounds the number of times edges bend. An…

We derive sharp upper and lower bounds on the number of intersection points and closed regions that can occur in sets of line segments with certain structure, in terms of the number of segments. We consider sets of segments whose underlying…

We study an obstacle problem for the length-penalized elastic bending energy for open planar curves pinned at the boundary. We first consider the case without length penalization and investigate the role of global minimizers among graph…

We present a theoretical study on the band structures of the electron constrained to move along triply-periodic minimal surfaces. Three well known surfaces connected via Bonnet transformations, namely P-, D-, and G-surfaces, are considered.…

Let $G$ be a simple undirected graph with vertex set $V(G)=\{v_1, v_2, \ldots, v_n\}$ and edge set $E(G)$. The Sombor matrix $\mathcal{S}(G)$ of a graph $G$ is defined so that its $(i,j)$-entry is equal to $\sqrt{d_i^2+d_j^2}$ if the…

Let $G$ be a graph on $n$ vertices and $\lambda_1,\lambda_2,\ldots,\lambda_n$ its eigenvalues. The Estrada index of $G$ is defined as $EE(G)=\sum_{i=1}^n e^{\lambda_i}.$ In this work, using a different demonstration technique, new lower…

The bondage number of a graph is the smallest number of its edges whose removal results in a graph having a larger domination number. We provide constant upper bounds for the bondage number of graphs on topological surfaces, improve upper…

In the first scenario, we revise the upper bound of the cutoff scale of the dimension-six potential Higgs operator required for a successful electroweak baryogenesis in the case of a modified expansion history caused by the existence of a…

In Part I we construct the upper bound, in the spirit of $\Gamma$- $\limsup$, achieved by multidimensional profiles, for some general classes of singular perturbation problems, with or without the prescribed differential constraint, taking…

In this paper a tight lower bound for algebraic connectivity of graphs (second smallest eigenvalue of the Laplacian matrix of the graph) based on connection-graph-stability method is introduced. The connection-graph-stability score for each…

We study spanners in planar domains, including polygonal domains, polyhedral terrain, and planar metrics. Previous work showed that for any constant $\epsilon\in (0,1)$, one could construct a $(2+\epsilon)$-spanner with $O(n\log(n))$ edges…

We consider the degree/diameter problem for graphs embedded in a surface, namely, given a surface $\Sigma$ and integers $\Delta$ and $k$, determine the maximum order $N(\Delta,k,\Sigma)$ of a graph embeddable in $\Sigma$ with maximum degree…

This study deals with cubic crystals where the contents of the simple cubic unit cells are close to n$\times$n$\times$n-bcc sublattices ($n$ = 2: diamond- and zinc-blende type, $n$ = 3: $\gamma$-brasses). First-principle results on the…

We investigate a homogenization problem related to a non-local interface energy with a periodic forcing term. We show the existence of planelike minimizers for such energy. Moreover, we prove that, under suitable assumptions on the…