Minimum Weighted Vertex Cover on Difference Graphs and It's Algorithm

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.

Authors

Institutions

Publication Details

Journal
Metallurgical and Materials Engineering
Published
2025-04-16
DOI
https://doi.org/10.63278/1532
Primary Topic
Graph Labeling and Dimension Problems
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Minimum Weighted Vertex Cover on Difference Graphs and It's Algorithm

Hend Elmorsy
Metallurgical and Materials Engineering
Graph Labeling and Dimension Problems
article

Minimum Weighted Vertex Cover on Difference Graphs and It's Algorithm

Hend Elmorsy
article en

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.

Metallurgical and Materials EngineeringVol. 31(4)
Umm al-Qura University (SA)
Umm Al-Qura University
Openalex Percentile: Top 89%
Graph Labeling and Dimension Problems
DOIOpen Access PDFOpenAlex
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Minimum Weighted Vertex Cover on Difference Graphs and It's Algorithm — Hend Elmorsy · Metallurgical and Materials Engineering (2025) | TGRS Research Map | TGRS