The lower and upper forcing geodetic numbers of block--cactus graphs

DOI10.1016/j.ejor.2005.04.026zbMath1137.05315OpenAlexW2066107628MaRDI QIDQ2432848

Jou-Ming Chang, Fu-Hsing Wang, Yue-Li Wang

Publication date: 25 October 2006

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2005.04.026

zbMATH Keywords

graph theorygeodetic setforcing geodetic numberblock--cactus graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Related Items

The lower and upper forcing geodetic numbers of completen-partite graphs,n-dimensional meshes and tori, Strong geodetic problem in networks, Algorithmic upper bounds for graph geodetic number, Enumeration of labeled block-cactus graphs, Graphs with large total geodetic number, The edge-to-edge geodetic domination number of a graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximating the weight of shallow Steiner trees
• The geodetic number of a graph
• The minimum forcing number for the torus and hypercube
• The geodetic number of an oriented graph
• On the geodetic number of a graph
• The Forcing Convexity Number of a Graph
• The ratio of the irredundance number and the domination number for block-cactus graphs
• The forcing geodetic number of a graph
• GEODETIC GAMES FOR GRAPHS
• Geodetic Achievement and Avoidance Games For Graphs
• The Steiner number of a graph