This research topic explores the theoretical foundations and practical applications of graph labeling and coloring problems, both of which are central to modern combinatorics and computer science.

The wide diameter of a graph is a natural generalization of diameter in a graph when we take account of the connectivity of the graph. In this paper, we define the generalized wide diameter of a graph ...