Edge lifting and total domination in graphs

被引：0
|
作者：
Wyatt J. Desormeaux
Teresa W. Haynes
Michael A. Henning
机构：
[1] University of Johannesburg,Department of Mathematics
[2] East Tennessee State University,Department of Mathematics and Statistics
来源：
Journal of Combinatorial Optimization | 2013年 / 25卷
关键词：
Edge lifting; Edge splitting; Total domination;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Let u and v be vertices of a graph G, such that the distance between u and v is two and x is a common neighbor of u and v. We define the edge lift of uv off x as the process of removing edges ux and vx while adding the edge uv to G. In this paper, we investigate the effect that edge lifting has on the total domination number of a graph. Among other results, we show that there are no trees for which every possible edge lift decreases the total domination number and that there are no trees for which every possible edge lift leaves the total domination number unchanged. Trees for which every possible edge lift increases the total domination number are characterized.
引用
收藏
页码：47 / 59
页数：12
相关论文
共 50 条
  • [21] Algorithmic Aspects of Total Vertex-Edge Domination in Graphs
    Kumar, H. Naresh
    Chellali, Mustapha
    Venkatakrishnan, Y. B.
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2023,
  • [22] Characterization of total restrained domination edge critical unicyclic graphs
    Rad, Nader Jafari
    AUSTRALASIAN JOURNAL OF COMBINATORICS, 2010, 47 : 77 - 82
  • [23] Perfect edge domination and efficient edge domination in graphs
    Lu, CL
    Ko, MT
    Tang, CY
    DISCRETE APPLIED MATHEMATICS, 2002, 119 (03) : 227 - 250
  • [24] Lower bounds on signed edge total domination numbers in graphs
    H. Karami
    S. M. Sheikholeslami
    Abdollah Khodkar
    Czechoslovak Mathematical Journal, 2008, 58 : 595 - 603
  • [25] Total domination critical and stable graphs upon edge removal
    Desormeaux, Wyatt J.
    Haynes, Teresa W.
    Henning, Michael A.
    DISCRETE APPLIED MATHEMATICS, 2010, 158 (15) : 1587 - 1592
  • [26] LOWER BOUNDS ON SIGNED EDGE TOTAL DOMINATION NUMBERS IN GRAPHS
    Karami, H.
    Sheikholeslami, S. M.
    Khodkar, Abdollah
    CZECHOSLOVAK MATHEMATICAL JOURNAL, 2008, 58 (03) : 595 - 603
  • [27] Total vertex-edge domination in graphs: Complexity and algorithms
    Singhwal, Nitisha
    Reddy, Palagiri Venkata Subba
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2022, 14 (07)
  • [28] Total domination critical and stable graphs upon edge removal
    Department of Mathematics, East Tennessee State University, Johnson City, TN 37614-0002, United States
    不详
    Discrete Appl Math, 15 (1587-1592):
  • [29] TOTAL DOMINATION IN GRAPHS
    COCKAYNE, EJ
    DAWES, RM
    HEDETNIEMI, ST
    NETWORKS, 1980, 10 (03) : 211 - 219
  • [30] On α-total domination in graphs
    Henning, Michael A.
    Rad, Nader Jafari
    DISCRETE APPLIED MATHEMATICS, 2012, 160 (7-8) : 1143 - 1151
12345