Upper bound on the diameter of a domination dot-critical graph

DOI10.1007/S00373-011-1095-1zbMATH Open1258.05093OpenAlexW2079885080MaRDI QIDQ1938885

Michitaka Furuya, Masanori Takatou

Publication date: 25 February 2013

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-011-1095-1

zbMATH Keywords

diameterdominationdot-critical graph

Mathematics Subject Classification ID

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

Cites Work

• Domination dot-critical graphs
• Domination dot-critical graphs with no critical vertices
• On the diameter of a domination dot-critical graph
• On the diameter of dot-critical graphs
• Title not available (Why is that?)

Related Items (4)

Title not available (Why is that?) ⋮ Upper bounds on the diameter of domination dot-critical graphs with given connectivity ⋮ The connectivity of domination dot-critical graphs with no critical vertices ⋮ Upper bound on the diameter of a total domination vertex critical graph.

This page was built for publication: Upper bound on the diameter of a domination dot-critical graph

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