Results 21 to 30 of about 3,727,802 (103)
M2 Internal‐Tide Generation in STORMTIDE2
Journal of Geophysical Research: Oceans, Volume 125, Issue 8, August 2020., 2020 Abstract Internal‐tide generation has been quantified using both pressure work and energy conversion. When calculating the pressure work from simulated or observed data, the internal‐tide pressure has to be decomposed from the full pressure, for which various options exist.
Zhuhua Li, Jin‐Song von Storch
wiley +1 more source
Comparison between Merrifield-Simmons Index and Wiener Index of Graphs
, 2022 The Merrifield-Simmons index σ is the total number of independent vertex sets (including the empty set) of the graph G. The Wiener index W is the sum of distances in all unordered pairs of vertices of G.
Xu, Kexiang +3 more
core +1 more source
Computing the hosoya and the merrifield-simmons indices of two special benzenoid systems [PDF]
, 2021 Gutman et al. gave some relations for computing the Hosoya indices of two special benzenoid systems R-n and P-n. In this paper, we compute the Hosoya index and Merrifield-Simmons index of R-n and P-n, by means of introducing four vectors for each ...
Öz, Mert Sinan, Cangül, İsmail Naci
core +1 more source
ON THE MERRIFIELD-SIMMONS INDEX AND GENERATING FUNCTIONS FOR THE GRAPHS OF THE STATE P-L (2, n)
, 2022 In this study, we compute Merrifield-Simmons index of graphs which corresponds to P-L (2, n) by using the decomposition formula. Examination shows that Merrifield-Simmons index of certain classes of graphs deduce as a result in a difference equation ...
GÜLTEKİN, İnci, Cevik, Fatih
core +1 more source
On the Hosoya index and the Merrifield–Simmons index of graphs with a given clique number [PDF]
, 2010 The Hosoya index and the Merrifield–Simmons index of a graph are defined as the total number of the matchings (including the empty edge set) and the total number of the independent vertex sets (including the empty vertex set) of the graph, respectively ...
Xu, Kexiang
core +1 more source
Graphs with given number of cut vertices and extremal Merrifield–Simmons index [PDF]
, 2011 The Merrifield–Simmons index of a graph is defined as the total number of its independent sets, including the empty set. Denote by G(n,k) the set of connected graphs with n vertices and k cut vertices.
Shenggui Zhang +3 more
core +1 more source
Merrifield-Simmons index dvou typů phenylenů
, 2020 The Merrifield-Simmons index i(G) of a simple undirected graph G=(V,E) is the number of all independent sets of vertices in G. This number is one of the most popular topological indices in chemistry.
Koudela, Libor, Seibert, Jaroslav
core +1 more source
Water Resources Research, Volume 55, Issue 9, Page 7876-7901, September 2019., 2019 Abstract While sensitivity analysis and calibration are common practice in integrated hydrologic modeling, little work has been done to understand how the design of the sensitivity analysis and calibration affects the simulation outcome in these often highly nonlinear models.
D. Tolley, L. Foglia, T. Harter
wiley +1 more source
Journal of Geophysical Research: Oceans, Volume 124, Issue 7, Page 5158-5179, July 2019., 2019 Abstract A series of five realistic, nested, hydrostatic numerical ocean model simulations are used to study semidiurnal internal tide generation and propagation from the continental slope, through the shelf break and to the midshelf adjacent to Point Sal, CA.
Nirnimesh Kumar +6 more
wiley +1 more source
Computing the Merrifield-Simmons indices of benzenoid chains and double benzenoid chains
, 2022 In this paper, we introduce the Merrifield-Simmons vector defined at a path of corresponding double hexagonal (benzenoid) chain. By utilizing this vector, we present reduction formulae to compute the Merrifield-Simmons index sigma(H) of the corresponding
Öz, Mert Sinan, Cangül, İsmail Naci
core +1 more source