MAJORITY VERTEX (EDGE) COVER OF A GRAPH

被引：0

作者：

Vijayaseetha, N. ^{[1
]}

Subramani, R. ^{[1
]}

Begam, B. Apsana ^{[1
]}

Priya, P. ^{[1
]}

机构：

[1] Dhanalakshmi Srinivasan Coll Arts & Sci W Autonom, Dept Math, Perambalur, India

来源：

ADVANCES AND APPLICATIONS IN MATHEMATICAL SCIENCES | 2021年 / 21卷 / 02期

关键词：

Majority Dominating set; Majority Vertex Cover and Majority Edge Cover;

D O I：

暂无

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

A vertex and an edge are said to cover each other if they are incident. A vertex cover of G is a set of vertices that cover all the edges of G. The smallest number of edges in any vertex cover of G is called the vertex covering number of G and is denoted by alpha(0)(G). A set of edges which cover all the vertices of G is called a edge cover of G. The smallest number of edges in any edge cover of G is called the edge covering number of G and is denoted by alpha(1)(G).

引用

页码：965 / 972

页数：8

共 50 条

[1] The vertex (edge) independence number, vertex (edge) cover number and the least eigenvalue of a graph
Tan, Ying-Ying
Fan, Yi-Zheng
LINEAR ALGEBRA AND ITS APPLICATIONS, 2010, 433 (04) : 790 - 795
[2] Super Vertex Cover of a Graph
Canoy Jr, Sergio R.
Bonsocan, Maria Andrea O.
Hassan, Javier A.
Mahistrado, Angelica Mae L.
Bilar, Vergel T.
EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS, 2025, 18 (01):
[3] Certified Vertex Cover of a Graph
Hassan, Javier A.
Bonsocan, Maria Andrea O.
Rasid, Regimar A.
Sappari, Amil-Shab S.
EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS, 2024, 17 (02): : 1038 - 1045
[4] Clique Vertex Magic Cover of a Graph
Sugeng K.A.
Ryan J.
Mathematics in Computer Science, 2011, 5 (1) : 113 - 118
[5] An approximation of the minimum vertex cover in a graph
Nagamochi, H
Ibaraki, T
JAPAN JOURNAL OF INDUSTRIAL AND APPLIED MATHEMATICS, 1999, 16 (03) : 369 - 375
[6] An approximation of the minimum vertex cover in a graph
Hiroshi Nagamochi
Toshihide Ibaraki
Japan Journal of Industrial and Applied Mathematics, 1999, 16 : 369 - 375
[7] Improving Vertex Cover as a Graph Parameter
Ganian, Robert
DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2015, 17 (02): : 77 - 100
[8] The vertex-cover polynomial of a graph
Dong, FM
Hendy, MD
Teo, KL
Little, CHC
DISCRETE MATHEMATICS, 2002, 250 (1-3) : 71 - 78
[9] On Colorful Vertex and Edge Cover Problems
Sayan Bandyapadhyay
Aritra Banik
Sujoy Bhore
Algorithmica, 2023, 85 : 3816 - 3827
[10] On Colorful Vertex and Edge Cover Problems
Bandyapadhyay, Sayan
Banik, Aritra
Bhore, Sujoy
ALGORITHMICA, 2023, 85 (12) : 3816 - 3827

← 1 2 3 4 5 →