If such an M exists, for a graph G, then G is called an Open Distance Pattern Colorable (odpc) graph. The minimum cardinality of an odp coloring set in G, if it exists, is called the odpc-number of G ...
Customer stories Events & webinars Ebooks & reports Business insights GitHub Skills ...
Department of Mathematical Sciences, Shahid Beheshti University, P.O. Box 19839-63113, Tehran, Iran ...
Optimization Investigates both applied and applicable mathematics and statistical techniques Explore open-access research on optimization theory and applications, advancing algorithms and models for ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results