Paul Manuel ; Sandi Klavzar ; R. Prabha ; Andrew Arokiaraj - The geodesic cover problem for butterfly networks

fi:10201 - Fundamenta Informaticae, October 27, 2025, Volume 194, Issue 3 - https://doi.org/10.46298/fi.10201
The geodesic cover problem for butterfly networksArticle

Authors: Paul Manuel ORCID; Sandi Klavzar ; R. Prabha ; Andrew Arokiaraj

    A geodesic cover, also known as an isometric path cover, of a graph is a set of geodesics which cover the vertex set of the graph. An edge geodesic cover of a graph is a set of geodesics which cover the edge set of the graph. The geodesic (edge) cover number of a graph is the cardinality of a minimum (edge) geodesic cover. The (edge) geodesic cover problem of a graph is to find the (edge) geodesic cover number of the graph. Surprisingly, only partial solutions for these problems are available for most situations. In this paper we demonstrate that the geodesic cover number of the $r$-dimensional butterfly is $\lceil (2/3)2^r\rceil$ and that its edge geodesic cover number is $2^r$.


    Volume: Volume 194, Issue 3
    Published on: October 27, 2025
    Accepted on: May 21, 2025
    Submitted on: October 25, 2022
    Keywords: Combinatorics, Computational Complexity

    Consultation statistics

    This page has been seen 26 times.
    This article's PDF has been downloaded 10 times.