On the forcing connected geodetic number and the connected geodetic number of a graph.
From MaRDI portal
Publication:2829003
zbMATH Open1413.05070MaRDI QIDQ2829003FDOQ2829003
Authors: Futaba Fujie-Okamoto, Vladimir Samodivkin, H. Abdollahzadeh Ahangar
Publication date: 26 October 2016
Published in: Ars Combinatoria (Search for Journal in Brave)
Recommendations
Cited In (16)
- Algorithmic upper bounds for graph geodetic number
- The upper edge geodetic number and the forcing edge geodetic number of a graph
- Extreme outer connected monophonic graphs
- Title not available (Why is that?)
- The geodetic hop domination number of complementary prisms
- The forcing near geodetic number of a graph
- 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 hull and forcing geodetic numbers of graphs
- The forcing total restrained geodetic number and the total restrained geodetic number of a graph: realizability and complexity
- The restrained geodetic number of a graph
- The forcing geodetic global domination number of a graph
- On the forcing geodetic and forcing steiner numbers of a graph
- The forcing open geodetic 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)