The upper connected geodetic number and forcing connected geodetic number of a graph

DOI10.1016/J.DAM.2008.06.005zbMATH Open1175.05074OpenAlexW2079298371MaRDI QIDQ1028129FDOQ1028129

Authors: J. Blot 

Publication date: 30 June 2009

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

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

Recommendations

• The upper edge geodetic number and the forcing edge geodetic number of a graph
• On the forcing connected geodetic number and the connected geodetic number of a graph.
• The forcing geodetic number of a graph
• On the connected geodetic number of a graph
• The forcing near geodetic number of a graph
• The forcing open geodetic number of a graph
• scientific article; zbMATH DE number 2188378
• Strong geodetic number of graphs and connectivity
• The forcing hull and forcing geodetic numbers of graphs
• The Connected Edge-To-Vertex Geodetic Number of a Graph

zbMATH Keywords

geodetic numberconnected geodetic numberforcing connected geodetic numberupper connected geodetic number

Mathematics Subject Classification ID

Connectivity (05C40)

Cites Work

• Title not available (Why is that?)
• Parallel concepts in graph theory
• On the geodetic number of a graph
• The forcing geodetic number of a graph
• The geodetic number of a graph
• Title not available (Why is that?)
• Graphs with specified radius and diameter
• On the connected geodetic number of a graph
• Title not available (Why is that?)

Cited In (14)

• On the connected geodetic number of a graph
• The upper edge geodetic number and the forcing edge geodetic number of a graph
• The forcing near geodetic number of a graph
• Title not available (Why is that?)
• Graphs with large total geodetic number
• The Connected Edge-To-Vertex Geodetic Number of a Graph
• The lower and upper forcing geodetic numbers of complete \(n\)-partite graphs, \(n\)-dimensional meshes and tori
• The forcing total restrained geodetic number and the total restrained geodetic number of a graph: realizability and complexity
• Total restrained geodetic number of graphs
• On the computational complexity of the strong geodetic recognition problem
• Comment on ``Edge geodetic covers in graphs
• On the hardness of finding the geodetic number of a subcubic graph
• The forcing geodetic global domination number of a graph
• On the forcing connected geodetic number and the connected geodetic number of a graph.

This page was built for publication: The upper connected geodetic number and forcing 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 Q1028129)