Upper bound on the diameter of a total domination vertex critical graph.

zbMATH Open1413.05287MaRDI QIDQ2829094FDOQ2829094

Authors: Michitaka Furuya, Naoya Kato 

Publication date: 26 October 2016

Published in: Ars Combinatoria (Search for Journal in Brave)

Recommendations

• Upper bound on the diameter of a domination dot-critical graph
• On the diameter of total domination vertex-critical graphs
• The diameter of total domination vertex critical graphs
• Upper bounds on the diameter of domination dot-critical graphs with given connectivity
• scientific article; zbMATH DE number 6096635
• The maximum diameter of total domination edge-critical graphs
• scientific article; zbMATH DE number 2174617
• The diameter of domination k‐critical graphs
• The diameter of connected domination critical graphs.
• On the diameter of a domination dot-critical graph

zbMATH Keywords

diametertotal dominationtotal domination vertex critical graph

Mathematics Subject Classification ID

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

Cited In (7)

• A total domination vertex critical graph of diameter two
• The diameter of total domination vertex critical graphs
• On the diameter of total domination vertex-critical graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Vertex criticality for upper domination and irredundance
• The diameter of paired-domination vertex critical graphs

This page was built for publication: Upper bound on the diameter of a total domination vertex critical graph.

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