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 条

[21] The Edge Fixing Edge-To-Vertex Monophonic Number Of A Graph
Samundesvari, KrishnaPillai Uma
John, Johnson
APPLIED MATHEMATICS E-NOTES, 2015, 15 : 261 - 275
[22] A Graph Partitioning Algorithm for Edge or Vertex Balance
El Moussawi, Adnan
Seghouani, Nacera Bennacer
Bugiotti, Francesca
DATABASE AND EXPERT SYSTEMS APPLICATIONS, DEXA 2020, PT I, 2020, 12391 : 23 - 37
[23] The Edge-to-Vertex Geodetic Number of a Graph
Santhakumaran, A. P.
JOURNAL OF ADVANCED MATHEMATICS AND APPLICATIONS, 2015, 4 (02) : 177 - 181
[24] On k-Vertex-Edge Domination of Graph
Bhattacharya, Debojyoti
Paul, Subhabrata
BULLETIN OF THE MALAYSIAN MATHEMATICAL SCIENCES SOCIETY, 2024, 47 (02)
[25] ON THE EDGE-TO-VERTEX GEODETIC NUMBER OF A GRAPH
Santhakumaran, A. P.
John, J.
MISKOLC MATHEMATICAL NOTES, 2012, 13 (01) : 107 - 119
[26] On k-Vertex-Edge Domination of Graph
Debojyoti Bhattacharya
Subhabrata Paul
Bulletin of the Malaysian Mathematical Sciences Society, 2024, 47
[27] The vertex-edge visibility graph of a polygon
O'Rourke, J
Streinu, I
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 1998, 10 (02): : 105 - 120
[28] On semidefinite programming relaxations for graph coloring and vertex cover
Charikar, M
PROCEEDINGS OF THE THIRTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2002, : 616 - 620
[29] ON GRAPH ENERGY, MAXIMUM DEGREE AND VERTEX COVER NUMBER
Ganie, Hilal A.
Samee, U.
Pirzada, S.
MATEMATICHE, 2019, 74 (01): : 163 - 172
[30] Bounds of graph energy in terms of vertex cover number
Wang, Long
Ma, Xiaobin
LINEAR ALGEBRA AND ITS APPLICATIONS, 2017, 517 : 207 - 216

← 1 2 3 4 5 →