Changing and unchanging of the domination number of a graph: path addition numbers

DOI10.7151/dmgt.2189zbMath1459.05247arXiv1801.04965OpenAlexW2963839265WikidataQ128718272 ScholiaQ128718272MaRDI QIDQ2227098

Yanyan Li

Publication date: 10 February 2021

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1801.04965

zbMATH Keywords

domination numberpath addition

Mathematics Subject Classification ID

Paths and cycles (05C38) Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bounds on the bondage number of a graph
• Strong equality of domination parameters in trees
• Independent domination in graphs: A survey and recent results
• Vertex domination-critical graphs
• Effect of edge-subdivision on vertex-domination in a graph
• Common extremal graphs for three inequalities involving domination parameters
• Domination critical graphs

This page was built for publication: Changing and unchanging of the domination number of a graph: path addition numbers