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

DOI10.1080/00207160903003302zbMATH Open1198.05103OpenAlexW1991364883MaRDI QIDQ3056403FDOQ3056403

Authors: 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

Recommendations

• The lower and upper forcing geodetic numbers of block--cactus graphs
• scientific article; zbMATH DE number 2188378
• The upper connected geodetic number and forcing connected geodetic number of a graph
• The forcing geodetic number of a graph
• The \((a,b)\)-forcing geodetic graphs

zbMATH Keywords

meshestorigeodetic numberforcing geodetic numbercomplete \(n\)-partite graphs

Mathematics Subject Classification ID

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

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

Cited In (4)

• The lower and upper forcing geodetic numbers of block--cactus graphs
• Strong matching preclusion for two-dimensional torus networks
• Title not available (Why is that?)
• On the geodetic number of permutation graphs

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

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