Results 101 to 110 of about 1,340 (226)

Polyomino models of molecular monolayers [PDF]

open access: yes
In this thesis, we describe periodic 2D supramolecular networks using a simple polyomino model with nearest-neighbour interactions. In particular, we focus on design rules for ordered molecular tilings, describing how the realised molecular tiling ...
Nicholls, Joel
core  

Extremal polyomino chains of VDB topological indices

open access: yes, 2015
: We show that the zig-zag chain Z 3 n of segments of length 3 (see Figure 2) has the minimal ABC index among all polyomino chains with n squares. More generally, we give conditions on the numbers {ϕij} under which the zig-zag chain Z 3 n is an extremal ...
Rada Rincón, Juan Pablo   +1 more
core   +1 more source

Disconnected Graph Layout and the Polyomino Packing Approach [PDF]

open access: yes, 2002
We review existing algorithms and present a new approach for layout of disconnected graphs. The new approach is based on polyomino representation of components as opposed to rectangles.
Kikusts, Paulis   +7 more
core   +1 more source

Extremal values of VDB topological indices over catacondensed polyomino systems

open access: yes, 2016
: A VDB topological index is defined as T = T (G) = X 1≤i≤j≤n−1 mijϕi,j , where G is a graph with n vertices and mij is the number of ij-edges. We study T over the set of catacondensed polyomino systems.
Rada Rincón, Juan Pablo   +1 more
core   +1 more source

Genotype-phenotype mapping with polyominos made from DNA origami tiles. [PDF]

open access: yesBiophys J, 2022
Dreher Y   +6 more
europepmc   +1 more source

Omega and related polynomials of polyomino chains of 4 k-cycles

open access: yesKuwait Journal of Science, 2014
Omega polynomial of a graph G is defined, on the ground of "opposite edge strips" ops:   where  is the number of ops strips of length  . The Sadhana polynomial  can also be calculated by ops counting.
MEHDI ALAEIYAN   +3 more
doaj  

A characterization of intersection graphs of the maximal rectangles of a polyomino

open access: yes, 1993
The interior of an orthogonal polygon drawn on a regular grid of the plane defines a set of cells (or squares) called a polyomino. We prove that the intersection graph of the maximal rectangles contained in a polyomino is slightly triangulated or has a ...
Frédéric Maire, Maire, Frédéric
core   +1 more source

Hexagonal polyomino weak (1,2)-achievement games [PDF]

open access: yes, 2004
A version of polyomino achievement games is studied, in which the first player marks one cell and the second player marks two cells at each move. All polyominos but one on an infinite 2-dimensional hexagonal board are characterized to be weak winners or ...
Sieben Nándor
core  

Polyomino coloring and complex numbers

open access: yes, 2008
Usually polyominoes are represented as subsets of the lattice Z2. In this paper we study a representation of polyominoes by Gaussian integers. Polyomino {(x1,y1),(x2,y2),…,(xs,ys)}⊂Z2 is represented by the set {(x1+iy1),(x2+iy2),…,(xs+iys)}⊂Z[i]. Then we
Kirillovs, Jurijs
core   +1 more source

Closed-loop optimization of tetris-inspired robotic morphology evolution

open access: yesMaterials & Design
The optimization of robotic morphology in smart manufacturing faces dual challenges of high-dimensional parameter spaces and limited experimental resources.
Yuqian Wang   +6 more
doaj   +1 more source

Home - About - Disclaimer - Privacy