Year: 2025
Type: article
Abstract: Let µ(G) and γ(G) be vertex covering number and independent number of G. In this paper compute minimum vertex cover on weighted vertex different graphs. An effective algorithm is illustrated to find minimum weighted vertex cover.
DOI: 10.63278/1532
Author: Hend Elmorsy
Institution: Umm al-Qura University
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
Funder: Umm Al-Qura University
OpenAlex ID: W4410187508
