Titlebook: Algorithms and Discrete Applied Mathematics; 10th International C Subrahmanyam Kalyanasundaram,Anil Maheshwari Conference proceedings 2024

GLUT

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.

希望

jabber

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

Mortal

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