Results 171 to 180 of about 1,340 (226)

Extremal polyomino chains with respect to Zagreb indices

Applied Mathematics Letters, 2012
For a molecular graph, the first Zagreb index M1 is equal to the sum of squares of the vertex degrees and second Zagreb index M2 is equal to the sum of products of degree of pairs of adjacent vertices.
Zahra Yarahmadi, Ali Reza Ashrafi, Sirous Moradi   +2 more
exaly   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

The polyomino graphs whose resonance graphs have a 1-degree vertex

Applied Mathematics and Computation
Yaxian Zhang, Heping Zhang
exaly   +2 more sources

Compact Polyominoes

2021 Data Compression Conference (DCC), 2021
We provide a compact representation of polyominoes with n cells that supports navigation and visibility queries in constant time. Our oracle takes 3n +o(n) bits. Previous enumeration efforts indicate that at least 2.00091 n -o(n) bits (likely 2.021 n -o(n) bits) are required to distinguish polyominoes, hence confirming that our oracle is compact.
openaire   +1 more source

Polyomino: A 3D-SRAM-Centric Accelerator for Randomly Pruned Matrix Multiplication With Simple Reordering Algorithm and Efficient Compression Format in 180-nm CMOS

IEEE Transactions on Circuits and Systems Part 1: Regular Papers, 2023
We have developed a sparse matrix reordering algorithm with a novel 3D-SRAM-centric Polyomino accelerator that enables efficient processing of the reordered matrix for parameter compression.
K. Shiba, Mitsuji Okada, Atsutake Kosuge, M. Hamada, T. Kuroda   +4 more
semanticscholar   +1 more source

Guarding polyominoes

Proceedings of the twenty-seventh annual symposium on Computational geometry, 2011
We explore the art gallery problem for the special case that the domain (gallery) P is an m-polyomino, a polyform whose cells are m unit squares. We study the combinatorics of guarding polyominoes in terms of the parameter m, in contrast with the traditional parameter n, the number of vertices of P; in particular, we show that floor((m+1)/3) point ...
Therese Biedl, Mohammad Tanvir Irfan, Justin Iwerks, Joondong Kim, Joseph S. B. Mitchell   +4 more
openaire   +1 more source

Code for polyomino and computer search of isospectral polyominoes

Journal of Combinatorial Optimization, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiaodong Liang, Rui Wang, Jixiang Meng
openaire   +1 more source

On Bond Incident Connection Indices of Polyomino and Benzenoid Chains

Polycyclic aromatic compounds (Print), 2022
The problem of estimating physicochemical properties of chemical structures is a well-investigated problem in chemistry. A number of approaches have been proposed to solve this certain problem. One of these approaches is linked with molecular descriptors.
N. Iqbal, A. Bhatti, Akbar Ali, A. Alanazi   +3 more
semanticscholar   +1 more source

Polyomino: A 3D-SRAM-Centric Architecture for Randomly Pruned Matrix Multiplication with Simple Rearrangement Algorithm and x0.37 Compression Format

IEEE International New Circuits and Systems Conference, 2022
We propose a sparse matrix rearrangement algorithm with a novel 3D-SRAM-centric Polyomino architecture which makes it possible to efficiently process the rearranged matrix for the compression of parameters.
K. Shiba, Mitsuji Okada, Atsutake Kosuge, M. Hamada, T. Kuroda   +4 more
semanticscholar   +1 more source

Maximum augmented Zagreb index on polyomino chains

Applied Mathematics and Computation
In this paper, we present a dynamic programming approach for identifying extremal polyomino chains with respect to degree-based topological indices.
Manuel Montes-y-Morales, Sayl'e Sigarreta, Hugo Cruz-Su'arez   +2 more
semanticscholar   +1 more source

Recent Advances in the Theory of Polyomino Ideals

Galois Journal of Algebra
Polyomino ideals, defined as the ideals generated by the inner $2$-minors of a polyomino, are a class of binomial ideals whose algebraic properties are closely related to the combinatorial structure of the underlying polyomino.
Francesco Navarra, A. Qureshi
semanticscholar   +1 more source