Titlebook: Discrete and Computational Geometry, Graphs, and Games; 21st Japanese Confer Jin Akiyama,Reginaldo M. Marcelo,Yushi Uno Conference proceedi

殖民地

FLIC

Surveilling and Securing the OlympicsA finite set of vectors . in the .-dimensional Euclidean space . is called a 2-distance set, if the set of mutual distances between distinct elements of . has cardinality exactly 2. In this note we report, among other things, the results of a computer-aided enumeration of the 2-distance sets in ..

In-Situ

Immacolata Di Napoli,Caterina ArcidiaconoIn this paper, global locating-dominating sets of the join and Cartesian product of graphs are characterized. Global location-domination numbers and bounds of these graphs and some special graphs are determined. The relationship between the location-domination numbers of the join of two graphs and its complement is also shown.

Diaphragm

散開(kāi)

BLA

https://doi.org/10.1007/978-1-4757-4305-0Kurotto and Juosan are Nikoli’s pencil puzzles. We study the computational complexity of Kurotto and Juosan puzzles. It is shown that deciding whether a given instance of each puzzle has a solution is NP-complete. Each of the two proofs uses a reduction from the PLANAR?3SAT problem.

合適

The Two-Distance Sets in Dimension Four,A finite set of vectors . in the .-dimensional Euclidean space . is called a 2-distance set, if the set of mutual distances between distinct elements of . has cardinality exactly 2. In this note we report, among other things, the results of a computer-aided enumeration of the 2-distance sets in ..

無(wú)禮回復(fù)

Global Location-Domination in the Join and Cartesian Product of Graphs,In this paper, global locating-dominating sets of the join and Cartesian product of graphs are characterized. Global location-domination numbers and bounds of these graphs and some special graphs are determined. The relationship between the location-domination numbers of the join of two graphs and its complement is also shown.

addition

,Packing Cube Nets into Rectangles with?,(1) Holes,We show that the 11 hexomino nets of the unit cube (using arbitrarily many copies of each) can pack disjointly into an . rectangle and cover all but a constant . number of unit squares, where . for . integers .. On the other hand, the nets of the dicube (two unit cubes) can be exactly packed into some rectangles.

不來(lái)