殖民地
发表于 2025-3-26 21:58:41
http://reply.papertrans.cn/29/2812/281183/281183_31.png
FLIC
发表于 2025-3-27 01:46:28
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
发表于 2025-3-27 09:03:36
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
发表于 2025-3-27 09:41:00
http://reply.papertrans.cn/29/2812/281183/281183_34.png
散开
发表于 2025-3-27 17:08:52
http://reply.papertrans.cn/29/2812/281183/281183_35.png
BLA
发表于 2025-3-27 21:44:56
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.
合适
发表于 2025-3-28 01:31:31
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 ..
无礼回复
发表于 2025-3-28 02:07:23
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
发表于 2025-3-28 10:01:13
,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.
不来
发表于 2025-3-28 10:50:10
http://reply.papertrans.cn/29/2812/281183/281183_40.png