Please use this identifier to cite or link to this item: https://open.uns.ac.rs/handle/123456789/13238
Title: Generating and counting triangular systems
Authors: Doroslovački, Rade 
Stojmenović I.
Tošić R.
Issue Date: 1-Mar-1987
Journal: BIT
Abstract: Lunnon has defined a triangular p-mino as an edge-connected configuration of p cells from the triangle plane grid with vertices of degree 6. A triangular system is a triangular p-mino without any holes. On the other hand we can say that a triangular system is a part of a triangular grid with vertices of degree 6, consisting of all edges and vertices of some closed broken line C without intersections (a circuit in the triangle grid), and all edges and vertices in the interior of C. It is obvious that any closed broken line C without intersections uniquely determines a triangular system. In this paper a method of generating triangular systems is presented. © 1987 BIT Foundations.
URI: https://open.uns.ac.rs/handle/123456789/13238
ISSN: 63835
DOI: 10.1007/BF01937351
Appears in Collections:FTN Publikacije/Publications

Show full item record

SCOPUSTM   
Citations

2
checked on Sep 9, 2023

Page view(s)

26
Last Week
15
Last month
0
checked on May 10, 2024

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.