GLUT
发表于 2025-3-30 10:06:30
The Frobenius Problem for the Proth Numbersrobenius problem for the Proth numerical semigroup . and give formulas for the embedding dimension of .. We solve the Frobenius problem for . by giving a closed formula for the Frobenius number. Moreover, we show that . has an interesting property such as being Wilf.
希望
发表于 2025-3-30 13:13:31
http://reply.papertrans.cn/16/1532/153168/153168_52.png
jabber
发表于 2025-3-30 20:12:18
Impact of Diameter and Convex Ordering for Hamiltonicity and Dominationin ., its neighborhood induces a subtree in .. A split graph .(., .) is a graph that can be partitioned into a clique (.) and an independent set (.). The objective of this study is twofold: (i) to strengthen the results presented in [.] for the Hamiltonian cycle (HCYCLE), the Hamiltonian path (HPATH
PON
发表于 2025-3-30 23:20:04
http://reply.papertrans.cn/16/1532/153168/153168_54.png
Mortal
发表于 2025-3-31 01:57:46
Monitoring Edge-Geodetic Sets in Graphs: Extremal Graphs, Bounds, Complexity two fundamental graph operations: clique-sum and subdivisions. In both cases, we provide a lower and an upper bound of the possible amount of changes and provide (almost) tight examples. Finally, we prove that the decision version of the problem of finding .(.) is NP-complete even for the family of