Results 31 to 40 of about 3,727,802 (103)
The Exact Controllability of the Molecular Graph Networks
Journal of Chemistry, Volume 2019, Issue 1, 2019., 2019 In this paper, we mainly study the exact controllability of several types of extended‐path molecular graph networks. Based on the construction of extended‐path molecular graph networks with C3, C4, or K4, using the determinant operation of the matrix and the recursive method, the exact characteristic polynomial of these networks is deduced.
Liang Wei +5 more
wiley +1 more source
Journal of Geophysical Research: Machine Learning and Computation, Volume 1, Issue 3, September 2024.Abstract Understanding and predicting changes in shoreline location are critical for coastal planners. In situ monitoring is accurate but not widely available. Satellite observations of shorelines have global coverage, but their accuracy and predictive capacity have not been fully explored.
Susheel Adusumilli +8 more
wiley +1 more source
Extremal Trees with respect to Number of (A, B, 2C)‐Edge Colourings
Journal of Applied Mathematics, Volume 2015, Issue 1, 2015., 2015 We determine the smallest and the largest number of (A, B, 2C)‐edge colourings in trees. We prove that the star is a unique tree that maximizes the number of all of the (A, B, 2C)‐edge colourings and that the path is a unique tree that minimizes it.
Krzysztof Piejko, Heping Zhang
wiley +1 more source
The Merrifield–Simmons index in (n, n + 1)-graphs
, 2006 A (n, n+1)-graph G is a connected simple graph with n vertices and n+1 edges. In this paper, we determine the upper bound for the Merrifield–Simmons index in (n, n + 1)−graphs in terms of the order n, and characterize the (n, n+1)−graph with the largest ...
Deng, H +5 more
core +1 more source
Merrifield-Simmons Index and Its Entropy of the 4-8-8 Lattice [PDF]
, 2014 The Merrifield-Simmons index is a topological index used in structural chemistry for quantifying relevant properties of molecular structure. This index, in different names, has been studied on the square, triangular and hexagonal lattices by using the ...
Zhang, Z
core +1 more source
Turbulent Diffusivity Profiles on the Shelf and Slope at the Southern Edge of the Canada Basin
Journal of Geophysical Research: Oceans, Volume 129, Issue 3, March 2024.Abstract Vertical profiles of temperature microstructure at 95 stations were obtained over the Beaufort shelf and shelfbreak in the southern Canada Basin during a November 2018 research cruise. Two methods for estimating the dissipation rates of temperature variance and turbulent kinetic energy were compared using this data set.
Ruby Yee +5 more
wiley +1 more source
Total Graph Interpretation of the Numbers of the Fibonacci Type
Journal of Applied Mathematics, Volume 2015, Issue 1, 2015., 2015 We give a total graph interpretation of the numbers of the Fibonacci type. This graph interpretation relates to an edge colouring by monochromatic paths in graphs. We will show that it works for almost all numbers of the Fibonacci type. Moreover, we give the lower bound and the upper bound for the number of all (A1, 2A1)‐edge colourings in trees.
Urszula Bednarz +3 more
wiley +1 more source
Cacti with the maximum Merrifield–Simmons index and given number of cut edges [PDF]
, 2010 The Merrifield–Simmons index of a graph G, denoted by i(G), is defined to be the total number of its independent sets, including the empty set. A graph G is called a cactus if each block of G is either an edge or a cycle.
Wang, Maolin, Maolin Wang
core +1 more source
On k‐Distance Pell Numbers in 3‐Edge‐Coloured Graphs
Journal of Applied Mathematics, Volume 2014, Issue 1, 2014., 2014 We define in this paper new distance generalizations of the Pell numbers and the companion Pell numbers. We give a graph interpretation of these numbers with respect to a special 3‐edge colouring of the graph.
Krzysztof Piejko, Iwona Włoch, Song Cen
wiley +1 more source
On the extremal Merrifield–Simmons index and Hosoya index of quasi-tree graphs [PDF]
, 2009 It is well known that the two graph invariants, “the Merrifield–Simmons index” and “the Hosoya index” are important in structural chemistry. A graph G is called a quasi-tree graph, if there exists u0 in V(G) such that G−u0 is a tree.
Li, Shuchao, Li, Xuechao, Jing, Wei
core +1 more source