绿州
发表于 2025-4-1 04:06:50
, , ∘ , , ∘ , ,∘ ,The Complexity of the rainbow connection number of a graph is NP-hard. In this paper we study the strong rainbow edge coloring of corona product of pencil graphs with path graph, complete graphs and cycle graphs. The result obtained are exact.
annexation
发表于 2025-4-1 09:54:51
-Ideals Characterizations in Posets,We explore and prove some interesting .-ideal results in posets in this paper. The analogous conditions for an ideal to be a .-ideal of a poset . are obtained by characterizing prime ideals to be .-ideals. Finally, the .-ideal separation theorem is discussed.
独裁政府
发表于 2025-4-1 12:43:48
http://reply.papertrans.cn/63/6267/626680/626680_63.png
幻想
发表于 2025-4-1 15:32:45
http://reply.papertrans.cn/63/6267/626680/626680_64.png