TY - CHAP
T1 - Domination Critical and Stable Graphs
AU - Haynes, Teresa W.
AU - Hedetniemi, Stephen T.
AU - Henning, Michael A.
N1 - Publisher Copyright:
© Springer Nature Switzerland AG 2023.
PY - 2023
Y1 - 2023
N2 - It is often important to know the behavior of a graph parameter when changes are made to the graph. The effects of modifying a graph by removing or adding an edge, or by removing a vertex are of particular interest in many applications of graph theory. In network design, for example, fault tolerance is the ability of a network to continue functioning in the presence of faults, such as a link failure (removing an edge) or a node failure (removing a vertex). In other cases, network performance can be enhanced by adding certain links (edges).
AB - It is often important to know the behavior of a graph parameter when changes are made to the graph. The effects of modifying a graph by removing or adding an edge, or by removing a vertex are of particular interest in many applications of graph theory. In network design, for example, fault tolerance is the ability of a network to continue functioning in the presence of faults, such as a link failure (removing an edge) or a node failure (removing a vertex). In other cases, network performance can be enhanced by adding certain links (edges).
UR - http://www.scopus.com/inward/record.url?scp=85159119164&partnerID=8YFLogxK
U2 - 10.1007/978-3-031-09496-5_13
DO - 10.1007/978-3-031-09496-5_13
M3 - Chapter
AN - SCOPUS:85159119164
T3 - Springer Monographs in Mathematics
SP - 381
EP - 409
BT - Springer Monographs in Mathematics
PB - Springer Science and Business Media Deutschland GmbH
ER -