5,012 research outputs found
On Domination Number and Distance in Graphs
A vertex set of a graph is a \emph{dominating set} if each vertex of
either belongs to or is adjacent to a vertex in . The
\emph{domination number} of is the minimum cardinality of
as varies over all dominating sets of . It is known that , where denotes the diameter of . Define
as the largest constant such that for any vertices of an arbitrary connected graph ;
then in this view. The main result of this paper is that
for . It immediately follows that
, where and are
respectively the average distance and the Wiener index of of order . As
an application of our main result, we prove a conjecture of DeLaVi\~{n}a et
al.\;that , where denotes the
eccentricity of the boundary of an arbitrary connected graph .Comment: 5 pages, 2 figure
A Comparison between the Metric Dimension and Zero Forcing Number of Trees and Unicyclic Graphs
The \emph{metric dimension} of a graph is the minimum number of
vertices such that every vertex of is uniquely determined by its vector of
distances to the chosen vertices. The \emph{zero forcing number} of a
graph is the minimum cardinality of a set of black vertices (whereas
vertices in are colored white) such that is turned
black after finitely many applications of "the color-change rule": a white
vertex is converted black if it is the only white neighbor of a black vertex.
We show that for a tree , and that
if is a unicyclic graph, along the way, we characterize trees attaining
. For a general graph , we introduce the "cycle rank
conjecture". We conclude with a proof of for .Comment: 15 pages, 14 figure
Domination in Functigraphs
Let and be disjoint copies of a graph , and let be a function. Then a \emph{functigraph}
has the vertex set and the edge set . A functigraph is a
generalization of a \emph{permutation graph} (also known as a \emph{generalized
prism}) in the sense of Chartrand and Harary. In this paper, we study
domination in functigraphs. Let denote the domination number of
. It is readily seen that . We
investigate for graphs generally, and for cycles in great detail, the functions
which achieve the upper and lower bounds, as well as the realization of the
intermediate values.Comment: 18 pages, 8 figure
Identification of a Large Amount of Excess Fe in Superconducting Single-Layer FeSe/SrTiO3 Films
The single-layer FeSe films grown on SrTiO3 (STO) substrates have attracted
much attention because of its record high superconducting critical temperature
(Tc). It is usually believed that the composition of the epitaxially grown
single-layer FeSe/STO films is stoichiometric, i.e., the ratio of Fe and Se is
1:1. Here we report the identification of a large amount of excess Fe in the
superconducting single-layer FeSe/STO films. By depositing Se onto the
superconducting single-layer FeSe/STO films, we find by in situ scanning
tunneling microscopy (STM) the formation of the second-layer FeSe islands on
the top of the first layer during the annealing process at a surprisingly low
temperature (150{\deg}C) which is much lower than the usual growth
temperature (490{\deg}C). This observation is used to detect excess Fe
and estimate its quantity in the single-layer FeSe/STO films. The amount of
excess Fe detected is at least 20% that is surprisingly high for the
superconducting single-layer FeSe/STO films. The discovery of such a large
amount of excess Fe should be taken into account in understanding the high-Tc
superconductivity and points to a likely route to further enhance Tc in the
superconducting single-layer FeSe/STO films
- …
