Construction for trees without domination critical vertices

DOI10.3934/math.2021621OpenAlexW3186325756MaRDI QIDQ2671102

Ying Wang, Fan Wang, Weisheng Zhao

Publication date: 3 June 2022

Published in: AIMS Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/math.2021621

zbMATH Keywords

treedominationcritical vertexbad vertexfixed vertex

Mathematics Subject Classification ID

Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

On construction for trees making the equality hold in Vizing's conjecture

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Domination alteration sets in graphs
• Matchings in 3-vertex-critical graphs: the odd case
• A conjecture on \(k\)-factor-critical and 3-\(\gamma \)-critical graphs
• Factor-critical property in 3-dominating-critical graphs
• New results about the bondage number of a graph
• Changing and unchanging domination: A classification
• Bondage number of the strong product of two trees
• Construction of trees and graphs with equal domination parameters
• Trees with equal domination and restrained domination numbers
• Changing and unchanging of the domination number of a graph
• Trees with two disjoint minimum independent dominating sets
• EveryK_1,7andK_1,3-free, 3-vertex critical graph of even order has a perfect matching
• Models of Domination in Graphs
• The bondage number of graphs:good and bad vertices
• Vertex domination-critical graphs
• Vertices contained in every minimum dominating set of a tree
• Characterizations of trees with equal domination parameters
• Upper bounds on the bondage number of the strong product of a graph and a tree
• Total Domination in Graphs
• A characterization relating domination, semitotal domination and total Roman domination in trees
• Topics in Domination in Graphs
• A constructive characterization of trees with equal total domination and disjunctive domination numbers
• A characterization of trees with equal Roman $\{2\}$-domination and Roman domination numbers
• A characterization of trees having a minimum vertex cover which is also a minimum total dominating set
• Matchings in 3‐vertex‐critical graphs: The even case
• Domination critical graphs

This page was built for publication: Construction for trees without domination critical vertices