166,006 research outputs found
Turbulence decay in the density-stratified intracluster medium
Turbulence evolution in a density-stratified medium differs from that of
homogeneous isotropic turbulence described by the Kolmogorov picture. We
evaluate the degree of this effect in the intracluster medium (ICM) with
hydrodynamical simulations. We find that the buoyancy effect induced by ICM
density stratification introduces qualitative changes to the turbulence energy
evolution, morphology, and the density fluctuation - turbulence Mach number
relation, and likely explains the radial dependence of the ICM turbulence
amplitude as found previously in cosmological simulations. A new channel of
energy flow between the kinetic and the potential energy is opened up by
buoyancy. When the gravitational potential is kept constant with time, this
energy flow leaves oscillations to the energy evolution, and leads to a
balanced state of the two energies where both asymptote to power-law time
evolution with slopes shallower than that for the turbulence kinetic energy of
homogeneous isotropic turbulence. We discuss that the energy evolution can
differ more significantly from that of homogeneous isotropic turbulence when
there is a time variation of the gravitational potential. Morphologically, ICM
turbulence can show a layered vertical structure and large horizontal vortical
eddies in the central regions with the greatest density stratification. In
addition, we find that the coefficient in the linear density fluctuation -
turbulence Mach number relation caused by density stratification is in general
a variable with position and time.Comment: 10 pages, 9 figures, published in MNRA
Tight upper bound on the maximum anti-forcing numbers of graphs
Let be a simple graph with a perfect matching. Deng and Zhang showed that
the maximum anti-forcing number of is no more than the cyclomatic number.
In this paper, we get a novel upper bound on the maximum anti-forcing number of
and investigate the extremal graphs. If has a perfect matching
whose anti-forcing number attains this upper bound, then we say is an
extremal graph and is a nice perfect matching. We obtain an equivalent
condition for the nice perfect matchings of and establish a one-to-one
correspondence between the nice perfect matchings and the edge-involutions of
, which are the automorphisms of order two such that and
are adjacent for every vertex . We demonstrate that all extremal
graphs can be constructed from by implementing two expansion operations,
and is extremal if and only if one factor in a Cartesian decomposition of
is extremal. As examples, we have that all perfect matchings of the
complete graph and the complete bipartite graph are nice.
Also we show that the hypercube , the folded hypercube ()
and the enhanced hypercube () have exactly ,
and nice perfect matchings respectively.Comment: 15 pages, 7 figure
- …