The lower and upper forcing geodetic numbers of block--cactus graphs
From MaRDI portal
Publication:2432848
DOI10.1016/J.EJOR.2005.04.026zbMATH Open1137.05315OpenAlexW2066107628MaRDI QIDQ2432848FDOQ2432848
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
Recommendations
Cites Work
- Approximating the weight of shallow Steiner trees
- The minimum forcing number for the torus and hypercube
- On the geodetic number of a graph
- Title not available (Why is that?)
- The forcing geodetic number of a graph
- The geodetic number of a graph
- Title not available (Why is that?)
- The Steiner number of a graph
- The ratio of the irredundance number and the domination number for block-cactus graphs
- The geodetic number of an oriented graph
- The Forcing Convexity Number of a Graph
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- GEODETIC GAMES FOR GRAPHS
- Geodetic Achievement and Avoidance Games For Graphs
- Title not available (Why is that?)
Cited In (7)
- The edge-to-edge geodetic domination number of a graph
- Algorithmic upper bounds for graph geodetic number
- The upper edge geodetic number and the forcing edge geodetic number of a graph
- Graphs with large total geodetic number
- Strong geodetic problem in networks
- The lower and upper forcing geodetic numbers of complete \(n\)-partite graphs, \(n\)-dimensional meshes and tori
- 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)
