Convexity in Graphs and Hypergraphs
- 1 July 1986
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Algebraic Discrete Methods
- Vol. 7 (3) , 433-444
- https://doi.org/10.1137/0607049
Abstract
Summary:A transit function $R$ on a set $V$ is a function $R\:V\times V\rightarrow 2^{V}$ satisfying the axioms $u\in R(u,v)$, $R(u,v)=R(v,u)$ and $R(u,u)=\lbrace u\rbrace $, for all $u,v \in V$. The all-paths transit function of a connected graph is characterized by transit axioms
Keywords
This publication has 18 references indexed in Scilit:
- Characterizations of totally balanced matricesJournal of Algorithms, 1984
- Domination, independent domination, and duality in strongly chordal graphsDiscrete Applied Mathematics, 1984
- On the Desirability of Acyclic Database SchemesJournal of the ACM, 1983
- Ensemble Convexes dans les Graphes I: Théorèmes de Helly et de Radon pour Graphes et SurfacesEuropean Journal of Combinatorics, 1983
- Characterizations of strongly chordal graphsDiscrete Mathematics, 1983
- Independent domination in chordal graphsOperations Research Letters, 1982
- Meet-distributive lattices and the anti-exchange closureAlgebra universalis, 1980
- Graph Theory with ApplicationsPublished by Springer Nature ,1976
- Balanced matricesMathematical Programming, 1972
- On rigid circuit graphsAbhandlungen aus dem Mathematischen Seminar der Universitat Hamburg, 1961