Strong geodetic number of graphs and connectivity

DOI10.1007/s40840-019-00809-6zbMath1437.05081MaRDI QIDQ1988559

Yaping Mao, Zhao Wang, Huifen Ge, Colton Magnant

Publication date: 23 April 2020

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40840-019-00809-6

zbMATH Keywords

cover; strong geodetic number

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05C10: Planar graphs; geometric and topological aspects of graph theory

05C15: Coloring of graphs and hypergraphs

05C12: Distance in graphs

05C78: Graph labelling (graceful graphs, bandwidth, etc.)

05C76: Graph operations (line graphs, products, etc.)

Related Items

STRONG DOUBLY GEODETIC PROBLEM ON GRAPHS, Strong edge geodetic problem on grids

Cites Work

• Unnamed Item
• The geodetic number of a graph
• Strong geodetic number of complete bipartite graphs and of graphs with specified diameter
• A survey of Nordhaus-Gaddum type relations
• Products of geodesic graphs and the geodetic number of products
• Strong edge geodetic problem in networks
• Isometric path numbers of graphs
• Geodesic Convexity in Graphs
• Computing Minimum Geodetic Sets of Proper Interval Graphs
• Block decomposition approach to compute a minimum geodetic set
• Geodetic Sets in Graphs