On the toll number of a graph

DOI10.1016/j.dam.2022.07.006zbMath1497.05059OpenAlexW4285585296MaRDI QIDQ2172405

Tanja Gologranc

Publication date: 15 September 2022

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2022.07.006

zbMATH Keywords

graph convexitycographtoll number

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) General convexity (52A99)

Related Items (1)

Computing the hull and interval numbers in the weakly toll convexity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some remarks on the geodetic number of a graph
• Complexity results related to monophonic convexity
• On the geodetic number and related metric sets in Cartesian product graphs
• On the computation of the hull number of a graph
• The hull number of a graph
• Convex sets in graphs. II: Minimal path convexity
• The geodetic number of a graph
• Toll number of the strong product of graphs
• Convexities related to path properties on graphs
• On the Steiner, geodetic and hull numbers of graphs
• On the hull number of some graph classes
• Toll number of the Cartesian and the lexicographic product of graphs
• Computing the hull number in toll convexity
• Toll convexity
• The geodetic number of the lexicographic product of graphs
• On the geodetic number of a graph
• Geodesic Convexity in Graphs
• Extreme Monophonic Graphs and Extreme Geodesic Graphs
• Geodetic Sets in Graphs
• Convexity in Graphs and Hypergraphs
• Computational Complexity of Geodetic Set
• Extreme Geodesic Graphs
• Reducibility among Combinatorial Problems
• ON THE MONOPHONIC NUMBER OF A GRAPH

This page was built for publication: On the toll number of a graph