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

zbMATH Open1413.05287MaRDI QIDQ2829094FDOQ2829094

Naoya Kato, Michitaka Furuya

Publication date: 26 October 2016

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

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 (3)

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

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• The diameter of domination k‐critical graphs 👍 👎
• On the diameter of a domination dot-critical graph 👍 👎
• The diameter of total domination vertex critical graphs 👍 👎
• Upper bound on the diameter of a domination dot-critical graph 👍 👎
• On the diameter of total domination vertex-critical graphs 👍 👎
• The maximum diameter of total domination edge-critical graphs 👍 👎
• Upper bounds on the diameter of domination dot-critical graphs with given connectivity 👍 👎
• The diameter of connected domination 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)