Results 21 to 30 of about 3,842,374 (234)
On forcing matching number of boron-nitrogen fullerene graphs
Discrete Applied Mathematics, 2011 Let G be a graph that admits a perfect matching M. A forcing set S for a perfect matching M is a subset of M such that it is contained in no other perfect matchings of G.
Xiaoyan Jiang, Heping Zhang
semanticscholar +2 more sources
Feedbacks of dust and boundary layer meteorology during a dust storm in the eastern Mediterranean [PDF]
Atmospheric Chemistry and Physics, 2015 Aerosols affect the atmosphere through direct interaction with short-wave and long-wave radiation and the microphysical properties of clouds. In this paper we report in detail on several mechanisms by which the short-term impact of dust on surface ...
S. Rémy +9 more
doaj +1 more source
The Forcing Weak Edge Detour Number of a Graph [PDF]
, 2010 The forcing weak edge detour numbers of certain classes of graphs are ...
Athisayanathan, S., Santhakumaran, A.P.
core +1 more source
Frontiers in Plant Science, 2022 Many fruits and vegetables suffer from unwanted discolorations that reduce product quality, leading to substantial losses along the supply chain. Witloof chicory (Cichorium intybus L. var.
Isabel De Jaegere +5 more
doaj +1 more source
Infragravity Wave Energy Partitioning in the Surf Zone in Response to Wind-Sea and Swell Forcing
Journal of Marine Science and Engineering, 2019 An alongshore array of pressure sensors and a cross-shore array of current velocity and pressure sensors were deployed on a barred beach in southwestern Australia to estimate the relative response of edge waves and leaky waves to variable incident wind ...
Stephanie Contardo +4 more
doaj +1 more source
Tight upper bound on the maximum anti-forcing numbers of graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2017 Let $G$ be a simple graph with a perfect matching. Deng and Zhang showed that the maximum anti-forcing number of $G$ is no more than the cyclomatic number.
Lingjuan Shi, Heping Zhang
doaj +1 more source
Forcing matching numbers of fullerene graphs
Discrete Applied Mathematics, 2010 The forcing number or the degree of freedom of a perfect matching M of a graph G is the cardinality of the smallest subset of M that is contained in no other perfect matchings of G. In this paper we show that the forcing numbers of perfect matchings in a
Heping Zhang, D. Ye, W. Shiu
semanticscholar +2 more sources
Wetting forces and meniscus pinning at geometrical edges [PDF]
AIChE Journal, 2016 It is shown that complications in currently used optical measurements for wetting and flow resistance over edges can be circumvented by surface tension force measurements. These forces are measured by employing a modified Wilhelmy plate testing technique in which a plate with rectangular holes is immersed.
Willem‐Jan A. de Wijs +2 more
openaire +2 more sources
Threshold-Based User-Assisted Cooperative Relaying in Beamspace Massive MIMO NOMA Systems
Sensors, 2022 The incorporation of user-assisted cooperative relaying into beamspace massive multiple-input multiple-output (mMIMO) non-orthogonal multiple access (NOMA) system can extend the coverage area and improve the spectral and energy efficiency for millimeter ...
David Alimo +2 more
doaj +1 more source
A new force-directed graph drawing method based on edge–edge repulsion [PDF]
Journal of Visual Languages & Computing, 2006 The conventional force-directed methods for drawing undirected graphs are based on either vertex-vertex repulsion or vertex-edge repulsion. In this paper, we propose a new force-directed method based on edge-edge repulsion to draw graphs. In our framework, edges are modelled as charged springs, and a final drawing can be generated by adjusting ...
Chun-Cheng Lin, Hsu-Chun Yen
openaire +2 more sources