Jianhua Tu
Given an integer k ≥2, a k-path is a path on k vertices. A set of vertices in a graph G is called a k-path vertex cover if it includes at least one vertex of every k-path of G. A minimum k-path vertex cover in G is a k-path vertex cover having the smallest possible number of vertices and its cardinality is called the k-path vertex cover number of G. In the k-path vertex cover problem, the goal is to find a minimum k-path vertex cover in a given graph. In this paper, we present a brief survey of the current state of the art in the study of the k-path vertex cover problem and the k-path vertex cover number.
@article{47a5ae20-8d68-402c-8802-34314c1281ae,
title={A Survey on the k-Path Vertex Cover Problem},
author={Jianhua Tu},
year={2022},
language={English}
}TY - JOUR TI - A Survey on the k-Path Vertex Cover Problem AU - Jianhua Tu PY - 2022 LA - English ER -
Osvaldo Pavez, Pablo Herrera
Copper slag flotation was studied on an industrial scale at a concentrator plant in the region of Atacama, Chile. This study consisted of the physical
Pekka Taskinen, Ari Jokilaakso
The effectivity of present copper smelting technologies have their roots in industrial and laboratory-scale experience accumulated over the past decad
Min Chen, Katri Avarmaa
The distributions of precious metals (gold, silver, platinum, and palladium) between copper matte and silica-saturated FeOx-SiO2/FeOx-SiO2-Al2O3/FeOx-
Katri Avarmaa, Hugh O’Brien
Waste electrical and electronic equipment (WEEE) represents a significant urban resource for precious metals. To maximize the recoveries and sustainab
Peng Yang, Feng Liu
Power system transient stability has been translated into a Lyapunov stability problem for decades. Conventional theories face the challenge of requir
Dhiren K. Pradhan, David C. Moore
Silicon microelectronics, consisting of complementary metal oxide semiconductor (CMOS) technology, have changed nearly all aspects of human life from