Vertex-Edge Domination in Interval and Bipartite Permutation Graphs

被引:1
|
作者
Paul, Subhabrata [1 ]
Pradhan, Dinabandhu [2 ]
Verma, Shaily [3 ]
机构
[1] Indian Inst Technol, Dept Math, Patna, Bihar, India
[2] Indian Inst Technol ISM, Dept Math & Comp, Dhanbad, Bihar, India
[3] Indian Inst Technol, Dept Math, Delhi, India
关键词
vertex-edge domination; linear time algorithm; interval graphs; bipartite permutation graphs; NUMBER;
D O I
10.7151/dmgt.2411
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Given a graph G =(V, E), a vertex u is an element of V ve-dominates all edges incident to any vertex of N-G[u]. A set D V is a vertex-edge dominating set if, for any edge e is an element of E, there exists a vertex u is an element of D such that u ve-dominates e. Given a graph G, our goal is to find a minimum cardinality ve-dominating set of G. In this paper, we designed two linear-time algorithms to find a minimum cardinality ve-dominating set for interval and bipartite permutation graphs.
引用
收藏
页码:947 / 963
页数:17
相关论文
共 50 条
  • [31] Acyclic domination on bipartite permutation graphs
    Xu, Guangjun
    Kang, Liying
    Shan, Erfang
    [J]. INFORMATION PROCESSING LETTERS, 2006, 99 (04) : 139 - 144
  • [32] Vertex-edge perfect Roman domination number
    Al Subaiei, Bana
    AlMulhim, Ahlam
    Akwu, Abolape Deborah
    [J]. AIMS MATHEMATICS, 2023, 8 (09): : 21472 - 21483
  • [33] Solving the weighted efficient edge domination problem on bipartite permutation graphs
    Lu, CL
    Tang, CY
    [J]. DISCRETE APPLIED MATHEMATICS, 1998, 87 (1-3) : 203 - 211
  • [34] Vertex deletion into bipartite permutation graphs
    Bożyk, Lukasz
    Derbisz, Jan
    Krawczyk, Tomasz
    Novotná, Jana
    Okrasa, Karolina
    [J]. Leibniz International Proceedings in Informatics, LIPIcs, 2020, 180
  • [35] Vertex Deletion into Bipartite Permutation Graphs
    Łukasz Bożyk
    Jan Derbisz
    Tomasz Krawczyk
    Jana Novotná
    Karolina Okrasa
    [J]. Algorithmica, 2022, 84 : 2271 - 2291
  • [36] Vertex Deletion into Bipartite Permutation Graphs
    Bozyk, Lukasz
    Derbisz, Jan
    Krawczyk, Tomasz
    Novotna, Jana
    Okrasa, Karolina
    [J]. ALGORITHMICA, 2022, 84 (08) : 2271 - 2291
  • [37] On a Vertex-Edge Marking Game on Graphs
    Boštjan Brešar
    Nicolas Gastineau
    Tanja Gologranc
    Olivier Togni
    [J]. Annals of Combinatorics, 2021, 25 : 179 - 194
  • [38] On a Vertex-Edge Marking Game on Graphs
    Bresar, Bostjan
    Gastineau, Nicolas
    Gologranc, Tanja
    Togni, Olivier
    [J]. ANNALS OF COMBINATORICS, 2021, 25 (01) : 179 - 194
  • [39] Global vertex-edge domination chain and its characterization
    Chitra, S.
    Sattanathan, R.
    [J]. JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY, 2012, 15 (4-5): : 259 - 268
  • [40] ON THE VERTEX-EDGE WIENER INDICES OF THORN GRAPHS
    Azari, Mahdieh
    [J]. MATEMATICKI VESNIK, 2019, 71 (03): : 263 - 276