The edge-to-edge geodetic domination number of a graph

DOI10.22199/issn.0717-6279-4057zbMath1478.05105OpenAlexW2995260513MaRDI QIDQ5027740

No author found.

Publication date: 7 February 2022

Published in: Proyecciones (Antofagasta) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.22199/issn.0717-6279-4057

zbMATH Keywords

domination numbergeodetic numberedge domination numberedge-to-edge geodetic domination numberedge-to-edge geodetic number

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the geodetic and geodetic domination numbers of a graph
• An extremal problem for edge domination insensitive graphs
• Edge domination in graphs
• On edge domination numbers of graphs
• A new lower bound on the domination number of a graph
• The lower and upper forcing geodetic numbers of block--cactus graphs
• On the geodetic number of a graph
• The upper connected edge geodetic number of a graph
• The detour domination number of a graph
• On the (M, D) number of a graph
• Edge Dominating Sets in Graphs
• EDGE DOMINATION IN THE LEXICO AND CART PRODUCTS OF GRAPHS
• Edge geodetic self-decomposition in graphs

This page was built for publication: The edge-to-edge geodetic domination number of a graph