Results 71 to 80 of about 3,842,374 (234)
Ramsey theory and forcing extensions
In every forcing extension of every model of set theory by a nontrivial (set) forcing there exist a graph Y and a cardinal μ \mu , such that every graph has an edge coloring with μ \mu .
Péter Komjáth
core +1 more source
Anti-Forcing Spectra of Convex Hexagonal Systems
For any perfect matching M of a graph AG, the anti-forcing number of M af(G,M) is the cardinality of a minimum edge subset S⊆E(G)M such that the graph G−S has only one perfect matching. The anti-forcing numbers of all perfect matchings of
Bo Zhang, Yaxian Zhang, Heping Zhang
core +1 more source
Multidecadal shifts of the northern and southern edges of the western Pacific warm pool
The western Pacific warm pool (WPWP) plays a pivotal role in shaping global climate. Using observational datasets, we uncover significant multidecadal shifts in the northern and southern edges of the WPWP. Heat budget analysis based on century-long ocean
Handa Wang +4 more
doaj +1 more source
A prototype OpenMetBuoy (OMB) was deployed alongside a commercial buoy in the central Arctic Ocean, north of the Laptev Sea, where there are historically no wave observations available.
Takehiko Nose +9 more
doaj +1 more source
Fractional forcing number of graphs
The notion of forcing sets for perfect matchings was introduced by Harary, Klein, and \v{Z}ivkovi\'{c}. The application of this problem in chemistry, as well as its interesting theoretical aspects, made this subject very active.
Ghanbari, Babak, Ebrahimi, Javad B.
core
Force-Directed Graph Layouts by Edge Sampling
Recent work shows that sampling algorithms can be an effective tool for graph visualization. This paper extends prior work by applying edge sampling algorithms to speed up the spring force calculation in force-directed graph layout algorithms. An experiment on 72 graphs finds that some sampling algorithms achieve comparable quality as no sampling. This
openaire +2 more sources
Spectrum of Matching Forcing Numbers of a Hexagonal System with a Forcing Edge
The forcing number of a Kekulé structure of a hexagonal system is the smallest number of double bonds that determine the entire Kekulé structure. It is known that the maximum forcing number equals the Clar number for any hexagonal systems.
Kai Deng, Heping Zhang
core
Line graphs: their maximum nullities and zero forcing numbers [PDF]
summary:The maximum nullity over a collection of matrices associated with a graph has been attracting the attention of numerous researchers for at least three decades.
Fallat, Shaun +12 more
core +1 more source
Copyright @ 2011 Sage Publications LtdSmart structures are components used in engineering applications that are capable of sensing or reacting to their environment in a predictable and desired manner.
Lawrie, Jane B. +5 more
core +1 more source
Antarctic sea ice variability has long been characterized by a dipole pattern primarily located in West Antarctica, attributed to the Amundsen Sea Low and remote forcing from the tropical Pacific, while variability in other sectors has received less ...
Weihan Ma +6 more
doaj +1 more source

