The forcing total restrained geodetic number and the total restrained geodetic number of a graph: realizability and complexity

DOI10.1016/j.akcej.2017.03.007zbMath1375.05063OpenAlexW2606038200MaRDI QIDQ1680878

V. Samodivkin, M. Najimi, Hossein Abdollahzadeh Ahangar, Ismael González Yero

Publication date: 17 November 2017

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

Full work available at URL: https://doi.org/10.1016/j.akcej.2017.03.007

zbMATH Keywords

geodetic numberforcing total restrained geodetic numbertotal geodetic numbertotal restrained geodetic number

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40)

Related Items

Graphs with large total geodetic number

Cites Work

• Some remarks on the geodetic number of a graph
• The \((a,b)\)-forcing geodetic graphs
• The forcing hull and forcing geodetic numbers of graphs
• Convexity in graphs
• Total restrained geodetic number of graphs
• The Forcing Convexity Number of a Graph
• The forcing geodetic number of a graph
• Computational Complexity of Geodetic Set
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The forcing total restrained geodetic number and the total restrained geodetic number of a graph: realizability and complexity