Upper bounds on the diameter of domination dot-critical graphs with given connectivity

DOI10.1016/J.DAM.2013.05.011zbMATH Open1285.05137OpenAlexW2043323011MaRDI QIDQ2444534

Michitaka Furuya

Publication date: 10 April 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2013.05.011

zbMATH Keywords

diameterconnectivitydot-critical graph

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Domination dot-critical graphs
• Domination dot-critical graphs with no critical vertices
• On the diameter of a domination dot-critical graph
• Upper bound on the diameter of a domination dot-critical graph
• Construction of (\(\gamma, k\))-critical graphs
• On the diameter of dot-critical graphs
• Vertex domination‐critical graphs

Related Items (3)

Title not available (Why is that?) ⋮ Domination game critical graphs ⋮ Upper bound on the diameter of a total domination vertex critical graph.

This page was built for publication: Upper bounds on the diameter of domination dot-critical graphs with given connectivity

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