English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

For a given undirected graph $G$, an \emph{ordered} subset $S ={s_1,s_2,...,s_k} \subseteq V$ of vertices is a resolving set for the graph ifthe vertices of the graph are distinguishable by their vector of distances tothe vertices in $S$. While a superset of any resolving set is always aresolving set, a proper subset of a resolving set is not necessarily aresolving set, and we are interested in determining resolving sets that areminimal or that are minimum (of minimal cardinality). Let $Q^n$ denote the$n$-dimensional hypercube with vertex set ${0,1}^n$. In Erd\"os and Renyi(Erdos & Renyi, 1963) it was shown that a particular set of $n$ vertices formsa resolving set for the hypercube. The main purpose of this note is to provethat a proper subset of that set of size $n-1$ is also a resolving set for thehypercube for all $n \ge 5$ and that this proper subset is a minimal resolvingset.

Minimal resolving sets for the hypercube