In this paper, motivated by the study of the wide diameter and the Rabin number of graphs, we define the generalized k-diameter of k-connected graphs, and show that every k-regular k-connected graph ...

For any integer 𝑘 ≥ 2, a graph 𝐺 is called 𝑘-leaf-connected if |V(G)|≥k+1 and given any subset 𝑆 ⊆ 𝑉(𝐺) with |S|=k,G always has a spanning tree 𝑇 such that 𝑆 is precisely the set of leaves of ...

Throughout history, spreading information has been an important task. With computer networks expanding, fast and reliable dissemination of messages became a problem of interest for computer scientists ...

Join our daily and weekly newsletters for the latest updates and exclusive content on industry-leading AI coverage. Learn More This post is by Dr. Mukta Paliwal, senior data scientist at Persistent ...