EVALUATION OF WEIGHTED CONNECTED VERTEX COVER (W-CVC) ON BUTTERFLY GRAPHS
Summary
No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.
Summarise with VIRAT Free to try with your Science Catalogs account.Abstract
The Weighted Connected Vertex Cover (W-CVC) problem is a fundamental optimization problem in graph theory, combining the constraints of vertex covering, connectivity, and weight minimization. Given a weighted graph, the objective is to determine a minimum-weight vertex subset that covers all edges while inducing a connected subgraph. This paper focuses on the derivation of W-CVC specifically on Butterfly Graphs, a class of structured interconnection networks widely used in parallel computing. By exploiting the recursive and symmetric properties of butterfly graphs, an explicit derivation of the optimal weighted connected vertex cover is presented. The study provides a systematic approach suitable for exam preparation, highlighting key steps, structural insights, and theoretical justification.
Fields of Study & Subjects
Advanced Graph Theory Research
Complexity and Algorithms in Graphs
Graph Labeling and Dimension Problems
Publication details
- Journal / source
- EPRA International Journal of Multidisciplinary Research (IJMR)
- Pages
- 795–795
- Publication date
- 30 March 2026
- Language
- EN