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

DOI10.1016/J.EJOR.2005.04.026MaRDI QIDQ2432848zbMATHOpenAlexFDO

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

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)

Recommendations

• The lower and upper forcing geodetic numbers of complete \(n\)-partite graphs, \(n\)-dimensional meshes and tori
• scientific article; zbMATH DE number 2188378
• The \((a,b)\)-forcing geodetic graphs
• The forcing geodetic number of a graph
• The forcing open geodetic number of a graph

Cites work

• scientific article; zbMATH DE number 4085454 (Why is no real title available?)
• scientific article; zbMATH DE number 38308 (Why is no real title available?)
• scientific article; zbMATH DE number 1208724 (Why is no real title available?)
• scientific article; zbMATH DE number 1472157 (Why is no real title available?)
• scientific article; zbMATH DE number 1389221 (Why is no real title available?)
• scientific article; zbMATH DE number 2188378 (Why is no real title available?)
• Approximating the weight of shallow Steiner trees
• GEODETIC GAMES FOR GRAPHS
• Geodetic Achievement and Avoidance Games For Graphs
• On the geodetic number of a graph
• The Forcing Convexity Number of a Graph
• The Steiner number of a graph
• The forcing geodetic number of a graph
• The geodetic number of a graph
• The geodetic number of an oriented graph
• The minimum forcing number for the torus and hypercube
• The ratio of the irredundance number and the domination number for block-cactus graphs

Cited in

(7)

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

This page was built for publication: The lower and upper forcing geodetic numbers of block--cactus graphs

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