Autor: Dejter, Italo - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Quasiperfect domination in triangular lattices
Autorzy:: Dejter, Italo
Powiązania:: https://bibliotekanauki.pl/articles/743129.pdf
Data publikacji:: 2009
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: perfect dominating set
quasiperfect dominating set
triangular lattice
Opis:: A vertex subset S of a graph G is a perfect (resp. quasiperfect) dominating set in G if each vertex v of G∖S is adjacent to only one vertex ($d_v$ ∈ {1,2} vertices) of S. Perfect and quasiperfect dominating sets in the regular tessellation graph of Schläfli symbol {3,6} and in its toroidal quotients are investigated, yielding the classification of their perfect dominating sets and most of their quasiperfect dominating sets S with induced components of the form $K_ν$, where ν ∈ {1,2,3} depends only on S.
Źródło:: Discussiones Mathematicae Graph Theory; 2009, 29, 1; 179-198
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 2.

Tytuł:: Rainbow Tetrahedra in Cayley Graphs
Autorzy:: Dejter, Italo J.
Powiązania:: https://bibliotekanauki.pl/articles/31234090.pdf
Data publikacji:: 2015-11-01
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: rainbow triangles
rainbow tetrahedra
Cayley graphs
Opis:: Let Γ_n be the complete undirected Cayley graph of the odd cyclic group Z_n. Connected graphs whose vertices are rainbow tetrahedra in Γ_n are studied, with any two such vertices adjacent if and only if they share (as tetrahedra) precisely two distinct triangles. This yields graphs G of largest degree 6, asymptotic diameter |V (G)|^1/3 and almost all vertices with degree: (a) 6 in G; (b) 4 in exactly six connected subgraphs of the (3, 6, 3, 6)-semi- regular tessellation; and (c) 3 in exactly four connected subgraphs of the {6, 3}-regular hexagonal tessellation. These vertices have as closed neigh- borhoods the union (in a fixed way) of closed neighborhoods in the ten respective resulting tessellations.
Źródło:: Discussiones Mathematicae Graph Theory; 2015, 35, 4; 733-754
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 3.

Tytuł:: Lattice-Like Total Perfect Codes
Autorzy:: Araujo, Carlos
Dejter, Italo
Powiązania:: https://bibliotekanauki.pl/articles/30147219.pdf
Data publikacji:: 2014-02-01
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: perfect dominating sets
hypercubes
lattices
Opis:: A contribution is made to the classification of lattice-like total perfect codes in integer lattices $Λ_n$ via pairs ($G, Φ$) formed by abelian groups $G$ and homomorphisms $Φ: Z^n → G$. A conjecture is posed that the cited contribution covers all possible cases. A related conjecture on the unfinished work on open problems on lattice-like perfect dominating sets in $Λ_n$ with induced components that are parallel paths of length > 1 is posed as well.
Źródło:: Discussiones Mathematicae Graph Theory; 2014, 34, 1; 57-74
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Informacja