On the forcing connected geodetic number and the connected geodetic number of a graph.

zbMATH Open1413.05070MaRDI QIDQ2829003FDOQ2829003

Vladimir Samodivkin, H. Abdollahzadeh Ahangar, Futaba Fujie-Okamoto

Publication date: 26 October 2016

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

zbMATH Keywords

connected geodetic numberforcing connected geodetic numberconnected geodetic set

Mathematics Subject Classification ID

Distance in graphs (05C12) Connectivity (05C40)

Cited In (11)

• Algorithmic upper bounds for graph geodetic number
• Title not available (Why is that?)
• The geodetic hop domination number of complementary prisms
• Graphs with large total geodetic number
• More on the outer connected geodetic number of a graph
• The \((a,b)\)-forcing geodetic graphs
• The upper connected geodetic number and forcing connected geodetic number of a graph
• The forcing total restrained geodetic number and the total restrained geodetic number of a graph: realizability and complexity
• Title not available (Why is that?)
• The restrained geodetic number of a graph
• The forcing geodetic global domination number of a graph

This page was built for publication: On the forcing connected geodetic number and the connected geodetic number of a graph.

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