An extremal problem for total domination stable graphs upon edge removal

DOI10.1016/J.DAM.2011.01.025MaRDI QIDQ548282zbMATH OpenOpenAlexFDO

Authors Wyatt J. Desormeaux, Teresa W. Haynes, Michael A. Henning

Publication date 28 June 2011

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2011.01.025

zbMATH Keywords

extremal problemtotal dominationedge removal stable

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• Total domination critical and stable graphs upon edge removal
• Double domination stable graphs upon edge removal
• Total domination stable graphs upon edge addition
• Total domination changing and stable graphs upon vertex removal
• Total domination stability in graphs

Cites work

• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 1095172 (Why is no real title available?)
• A survey of selected recent results on total domination in graphs
• Graphs with large total domination number
• Total domination critical and stable graphs upon edge removal

Cited in

(8)

• A partial compactification for linear systems
• Total domination critical and stable graphs upon edge removal
• Extremal problems related to the cardinality-redundance of graphs
• Total domination stable graphs upon edge addition
• The Bruhat decomposition of finite Hankel matrices
• Total domination changing and stable graphs upon vertex removal
• Equitable total domination edge addition stable graphs
• On disjunctive domination in graphs

This page was built for publication: An extremal problem for total domination stable graphs upon edge removal

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q548282)