The lower and upper forcing geodetic numbers of completen-partite graphs,n-dimensional meshes and tori

DOI10.1080/00207160903003302zbMath1198.05103OpenAlexW1991364883MaRDI QIDQ3056403

Fu-Hsing Wang

Publication date: 12 November 2010

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160903003302

zbMATH Keywords

torigeodetic numbermeshesforcing geodetic numbercomplete \(n\)-partite graphs

Mathematics Subject Classification ID

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

Related Items (2)

On the geodetic number of permutation graphs ⋮ Strong matching preclusion for two-dimensional torus networks

Cites Work

• 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
• The lower and upper forcing geodetic numbers of block--cactus graphs
• On the geodetic number of a graph
• The Forcing Convexity Number of a Graph
• GEODETIC GAMES FOR GRAPHS
• Geodetic Achievement and Avoidance Games For Graphs
• The Steiner number of a graph

This page was built for publication: The lower and upper forcing geodetic numbers of completen-partite graphs,n-dimensional meshes and tori