Strong geodetic number of graphs and connectivity

DOI10.1007/s40840-019-00809-6zbMath1437.05081OpenAlexW2966872138MaRDI 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

coverstrong geodetic number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph operations (line graphs, products, etc.) (05C76)

Related Items (2)

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

This page was built for publication: Strong geodetic number of graphs and connectivity