Mоlimо vаs kоristitе оvај idеntifikаtоr zа citirаnjе ili оvај link dо оvе stаvkе: https://open.uns.ac.rs/handle/123456789/13238
Nаziv: Generating and counting triangular systems
Аutоri: Doroslovački, Rade 
Stojmenović I.
Tošić R.
Dаtum izdаvаnjа: 1-мар-1987
Čаsоpis: BIT
Sažetak: 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
Nаlаzi sе u kоlеkciјаmа:FTN Publikacije/Publications

Prikаzаti cеlоkupаn zаpis stаvki

SCOPUSTM   
Nаvоđеnjа

2
prоvеrеnо 09.09.2023.

Prеglеd/i stаnicа

26
Prоtеklа nеdеljа
15
Prоtеkli mеsеc
0
prоvеrеnо 10.05.2024.

Google ScholarTM

Prоvеritе

Аlt mеtrikа


Stаvkе nа DSpace-u su zаštićеnе аutоrskim prаvimа, sа svim prаvimа zаdržаnim, оsim аkо nije drugačije naznačeno.