An extremal problem for total domination stable graphs upon edge removal

DOI10.1016/J.DAM.2011.01.025zbMATH Open1219.05117OpenAlexW1970989805MaRDI QIDQ548282FDOQ548282

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

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Graphs with large total domination number
• A survey of selected recent results on total domination in graphs
• 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
• The Bruhat decomposition of finite Hankel matrices
• Total domination stable graphs upon edge addition
• Equitable total domination edge addition stable graphs
• Total domination changing and stable graphs upon vertex removal
• 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)