Results 31 to 40 of about 1,340 (226)
On the exact complexity of polyomino packing [PDF]
, 2018 We show that the problem of deciding whether a collection of polyominoes, each fitting in a 2×O(log n) rectangle, can be packed into a 3×n box does not admit a 2o(n/log n)-time algorithm, unless the Exponential Time Hypothesis fails.
Van Der Zanden, Tom C. +3 more
core +3 more sources
Methods in Ecology and Evolution, Volume 13, Issue 7, Page 1412-1420, July 2022., 2022 Abstract Neutral landscape models have many applications in ecology, such as supporting spatially explicit simulations, developing and evaluating landscape indices. However, current approaches provide few options to produce large landscapes with controlled composition and fragmentation indices.
Dimitri Justeau‐Allaire +5 more
wiley +1 more source
Journal of Mathematics, Volume 2022, Issue 1, 2022., 2022 It is well known that many topological indices have widespread use in lots of fields about scientific research, and the Kirchhoff index plays a major role in many different sectors over the years. Recently, Li et al. (Appl. Math. Comput. 382 (2020) 125335) proposed the problem of determining the Kirchhoff index and multiplicative degree‐Kirchhoff index
Jia-Bao Liu +4 more
wiley +1 more source
On‐Bond Incident Degree Indices of Square‐Hexagonal Chains
Journal of Mathematics, Volume 2022, Issue 1, 2022., 2022 For a graph G, its bond incident degree (BID) index is defined as the sum of the contributions f(du, dv) over all edges uv of G, where dw denotes the degree of a vertex w of G and f is a real‐valued symmetric function. If f(du, dv) = du + dv or dudv, then the corresponding BID index is known as the first Zagreb index M1 or the second Zagreb index M2 ...
Tariq A. Alraqad +4 more
wiley +1 more source
Counting Polyominoes on Twisted Cylinders [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 We improve the lower bounds on Klarner's constant, which describes the exponential growth rate of the number of polyominoes (connected subsets of grid squares) with a given number of squares.
Gill Barequet +3 more
doaj +1 more source
Cycle-Super Magic Labeling of Polyomino Linear and Zig-Zag Chains
Journal of Operations Intelligence, 2023 A bijective function with domain union of vertex and edge set to a range natural numbers to onward count of vertices and edges of a graph. If there is a bijective function G, then G is called as a H-magic graph, along with the condition that every ...
M. Azeem
semanticscholar +1 more source
Topological Aspects of Molecular Networks: Crystal Cubic Carbons
Complexity, Volume 2022, Issue 1, 2022., 2022 Theory of networks serves as a mathematical foundation for the construction and modeling of chemical structures and complicated networks. In particular, chemical networking theory has a wide range of utilizations in the study of chemical structures, where examination and manipulation of chemical structural information are made feasible by utilizing the
Muhammad Javaid +3 more
wiley +1 more source
Journal of Mathematics, Volume 2022, Issue 1, 2022., 2022 Spectrum analysis and computing have expanded in popularity in recent years as a critical tool for studying and describing the structural properties of molecular graphs. Let On2 be the strong prism of an octagonal network On. In this study, using the normalized Laplacian decomposition theorem, we determine the normalized Laplacian spectrum of On2 which
Yasir Ahamad +6 more
wiley +1 more source
Maximal increasing sequences in fillings of almost-moon polyominoes [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 It was proved by Rubey that the number of fillings with zeros and ones of a given moon polyomino thatdo not contain a northeast chain of a fixed size depends only on the set of column lengths of the polyomino.
Svetlana Poznanović, Catherine H. Yan
doaj +1 more source