Minimum Weighted Vertex Cover on Difference Graphs and It's Algorithm
DOI:
https://doi.org/10.63278/1532Keywords:
vertex cover, Algorithm, Independent number.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.
Downloads
How to Cite
Hend Elmorsy. 2025. “Minimum Weighted Vertex Cover on Difference Graphs and It’s Algorithm”. Metallurgical and Materials Engineering 31 (4):906-9. https://doi.org/10.63278/1532.
Issue
Section
Research
License
Copyright (c) 2025 Hend Elmorsy
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
- Authors are permitted and encouraged to post their published articles online (e.g., in institutional repositories or on their website, social networks like ResearchGate or Academia), as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
Except where otherwise noted, the content on this site is licensed under a Creative Commons Attribution 4.0 International License.
According to the 