Matching Transversal Edge Domination in Graphs

被引：0
|
作者：
Alwardi, Anwar [1 ]
机构：
[1] Univ Mysore, Dept Studies Math, Manasagangotri 570006, Mysuru, India
来源：
APPLICATIONS AND APPLIED MATHEMATICS-AN INTERNATIONAL JOURNAL | 2016年 / 11卷 / 02期
关键词：
Dominating set; Matching set; matching transversal dominating set; Matching transversal domination;
D O I：
暂无
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
Let G = (V,E) be a graph. A subset X of E is called an edge dominating set of G if every edge in EX. is adjacent to some edge in X. An edge dominating set which intersects every maximum matching in G is called matching transversal edge dominating set. The minimum cardinality of a matching transversal edge dominating set is called the matching transversal edge domination number of G and is denoted by gamma(mt)(G). In this paper, we begin an investigation of this parameter.
引用
收藏
页码：919 / 929
页数：11
相关论文
共 50 条
  • [31] On edge domination numbers of graphs
    Xu, BG
    DISCRETE MATHEMATICS, 2005, 294 (03) : 311 - 316
  • [32] INDEPENDENT TRANSVERSAL DOMINATION NUMBER IN SOME REGULAR GRAPHS
    Pushpam, P. Roushini Leely
    Bhanthavi, K. Priya
    ADVANCES AND APPLICATIONS IN MATHEMATICAL SCIENCES, 2019, 19 (02): : 77 - 95
  • [33] Towards the Conjecture on Domination Versus Edge Domination in Graphs
    Maniya, Paras
    Pradhan, Dinabandhu
    BULLETIN OF THE MALAYSIAN MATHEMATICAL SCIENCES SOCIETY, 2024, 47 (01)
  • [34] Towards the Conjecture on Domination Versus Edge Domination in Graphs
    Paras Maniya
    Dinabandhu Pradhan
    Bulletin of the Malaysian Mathematical Sciences Society, 2024, 47
  • [35] Matching properties in domination critical graphs
    Ananchuen, N
    Plummer, MD
    DISCRETE MATHEMATICS, 2004, 277 (1-3) : 1 - 13
  • [36] Minimum Status, Matching and Domination of Graphs
    Liang, Caixia
    Zhou, Bo
    Guo, Haiyan
    COMPUTER JOURNAL, 2021, 64 (09): : 1384 - 1392
  • [37] On domination game stable graphs and domination game edge-critical graphs
    Xu, Kexiang
    Li, Xia
    DISCRETE APPLIED MATHEMATICS, 2018, 250 : 47 - 56
  • [38] On signed edge domination numbers of graphs
    Xu, BG
    DISCRETE MATHEMATICS, 2001, 239 (1-3) : 179 - 189
  • [39] Efficient edge domination in regular graphs
    Cardoso, Domingos M.
    Cerdeira, J. Orestes
    Delorme, Charles
    Silva, Pedro C.
    DISCRETE APPLIED MATHEMATICS, 2008, 156 (15) : 3060 - 3065
  • [40] Signed Majority Edge Domination in Graphs
    Xing, Hua-Ming
    Liu, Aiping
    Huang, Zhong-Sheng
    UTILITAS MATHEMATICA, 2010, 83 : 255 - 264
12345