Return to search

Edge Lifting and Total Domination in Graphs

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.

Identiferoai:union.ndltd.org:ETSU/oai:dc.etsu.edu:etsu-works-15632
Date01 January 2013
CreatorsDesormeaux, Wyatt J., Haynes, Teresa W., Henning, Michael A.
PublisherDigital Commons @ East Tennessee State University
Source SetsEast Tennessee State University
Detected LanguageEnglish
Typetext
SourceETSU Faculty Works

Page generated in 0.0021 seconds