Axiomatic characterization of transit functions of hierarchies

DOI10.26493/1855-3974.831.e12zbMath1391.05079OpenAlexW2739815499WikidataQ129392197 ScholiaQ129392197MaRDI QIDQ3174798

Manoj Changat, Ferdoos Hossein Nezhad

Publication date: 18 July 2018

Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.26493/1855-3974.831.e12

zbMATH Keywords

hierarchiesrooted treesconvexitiesaxiom systemstransit functions

Mathematics Subject Classification ID

Trees (05C05) Axiomatic and generalized convexity (52A01) Graph theory (05C99)

Related Items (2)

Cut vertex transit functions of hypergraphs ⋮ Axiomatic characterization of transit functions of weak hierarchies

Cites Work

• The induced path function, monotonicity and betweenness
• Axiomatic characterization of the interval function of a graph
• Triangle path transit functions, betweenness and pseudo-modular graphs
• Convexities related to path properties on graphs
• Induced path transit function, monotone and Peano axioms
• The All-Paths Transit Function of a Graph
• Some Elementary Properties of Interval Convexities
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Axiomatic characterization of transit functions of hierarchies