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 条

[31] Edge Cover Domination in Mangoldt Graph
Madhavi, L.
Maheswari, B.
MOMONA ETHIOPIAN JOURNAL OF SCIENCE, 2011, 3 (01): : 37 - 51
[32] Reducing the vertex cover number via edge contractions *,**
Lima, Paloma T.
dos Santos, Vinicius F.
Sau, Ignasi
Souza, Ueverton S.
Tale, Prafullkumar
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2023, 136 : 63 - 87
[33] An edge-reduction algorithm for the vertex cover problem
Han, Qiaoming
Punnen, Abraham P.
Ye, Yinyu
OPERATIONS RESEARCH LETTERS, 2009, 37 (03) : 181 - 186
[34] The vertex and edge graph reconstruction numbers of small graphs
Rivshin, David
Radziszowski, Stanislaw P.
AUSTRALASIAN JOURNAL OF COMBINATORICS, 2009, 45 : 175 - 188
[35] THE EDGE-TO-VERTEX STEINER DOMINATION NUMBER OF A GRAPH
John, J.
Mary, S. Ancy
TWMS JOURNAL OF APPLIED AND ENGINEERING MATHEMATICS, 2022, 12 (04): : 1311 - 1321
[36] Vertex and Edge Connectivity of the Zero Divisor Graph Γ[Zn]
Reddy, B. Surendranath
Jain, Rupali S.
Laxmikanth, N.
COMMUNICATIONS IN MATHEMATICS AND APPLICATIONS, 2020, 11 (02): : 253 - 258
[37] AN INEQUALITY INVOLVING THE VERTEX ARBORICITY AND EDGE ARBORICITY OF A GRAPH
BURR, SA
JOURNAL OF GRAPH THEORY, 1986, 10 (03) : 403 - 404
[38] The upper edge-to-vertex detour number of a graph
Santhakumaran, A. P.
Athisayanathan, S.
ALGEBRA & DISCRETE MATHEMATICS, 2012, 13 (01): : 128 - 138
[39] p-Edge/vertex-connected vertex cover: Parameterized and approximation algorithms
Einarson, Carl
Gutin, Gregory
Jansen, Bart M. P.
Majumdar, Diptapriyo
Wahlstrom, Magnus
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2023, 133 : 23 - 40
[40] The Alcuin Number of a Graph and Its Connections to the Vertex Cover Number
Csorba, Peter
Hurkens, Cor A. J.
Woeginger, Gerhard J.
SIAM REVIEW, 2012, 54 (01) : 141 - 154

← 1 2 3 4 5 →