44,210 research outputs found
Identifying codes of corona product graphs
For a vertex of a graph , let be the set of with all of
its neighbors in . A set of vertices is an {\em identifying code} of
if the sets are nonempty and distinct for all vertices . If
admits an identifying code, we say that is identifiable and denote by
the minimum cardinality of an identifying code of . In this
paper, we study the identifying code of the corona product of graphs
and . We first give a necessary and sufficient condition for the
identifiable corona product , and then express in terms of and the (total) domination number of .
Finally, we compute for some special graphs
Nonequilibrium Kondo effect by equilibrium numerical renormalization group method: The hybrid Anderson model subject to a finite spin bias
We investigate Kondo correlations in a quantum dot with normal and
superconducting electrodes, where a spin bias voltage is applied across the
device and the local interaction is either attractive or repulsive. When
the spin current is blockaded in the large-gap regime, this nonequilibrium
strongly-correlated problem maps into an equilibrium model solvable by the
numerical renormalization group method. The Kondo spectra with characteristic
splitting due to the nonequilibrium spin accumulation are thus obtained at high
precision. It is shown that while the bias-induced decoherence of the spin
Kondo effect is partially compensated by the superconductivity, the charge
Kondo effect is enhanced out of equilibrium and undergoes an additional
splitting by the superconducting proximity effect, yielding four Kondo peaks in
the local spectral density. In the charge Kondo regime, we find a universal
scaling of charge conductance in this hybrid device under different spin
biases. The universal conductance as a function of the coupling to the
superconducting lead is peaked at and hence directly measures the Kondo
temperature. Our results are of direct relevance to recent experiments
realizing negative- charge Kondo effect in hybrid oxide quantum dots [Nat.
Commun. \textbf{8}, 395 (2017)].Comment: 7 pages, 3 figures, the version accepted by Physical Review
On the metric dimension and fractional metric dimension for hierarchical product of graphs
A set of vertices {\em resolves} a graph if every vertex of is
uniquely determined by its vector of distances to the vertices in . The {\em
metric dimension} for , denoted by , is the minimum cardinality of
a resolving set of . In order to study the metric dimension for the
hierarchical product of two rooted graphs
and , we first introduce a new parameter, the {\em
rooted metric dimension} \rdim(G_1^{u_1}) for a rooted graph . If
is not a path with an end-vertex , we show that
\dim(G_2^{u_2}\sqcap G_1^{u_1})=|V(G_2)|\cdot\rdim(G_1^{u_1}), where
is the order of . If is a path with an end-vertex ,
we obtain some tight inequalities for .
Finally, we show that similar results hold for the fractional metric dimension.Comment: 11 page
- …
