The weak-toll function of a graph: axiomatic characterizations and first-order non-definability
From MaRDI portal
Publication:6547838
DOI10.1007/978-3-031-52213-0_20MaRDI QIDQ6547838
Jeny Jacob, Manoj Changat, Lekshmi Kamal K. Sheela
Publication date: 31 May 2024
Algorithms in computer science (68Wxx) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- A note on path domination
- The induced path function, monotonicity and betweenness
- Axiomatic characterization of the interval function of a graph
- Toll convexity
- Representation of a finite graph by a set of intervals on the real line
- Axiomatic characterization of the toll walk function of some graph classes
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The weak-toll function of a graph: axiomatic characterizations and first-order non-definability