Routes enumeration in a Boolean with respect to intersection and nonintersection relations
From MaRDI portal
The author introduces the definition of a reduced algebra of binary functions, where a binary function is a function \(f:L^2\to F\) with \(L\) a finite set and \(F\) a field. Let \(\Delta\) be an equivalence relation on \(L^2\). A binary function is called a \(\Delta\)-function, if \(f(a,b) = f(c,d)\) for any \((a,b)\Delta(c,d)\). Some applications to the enumeration of routes with respect to the intersection relation and the non-intersection relation are given.
Recommendations
- Route systems and bipartite graphs
- Routing sets in the integer lattice
- Enumerating triangulation paths
- Intersection graphs of non-crossing paths
- Intersection graphs of non-crossing paths
- Non-intersecting detours in strong oriented graphs
- On devising Boolean Routing Schemes
- Intersection problems in the Boolean lattice
- Relational characterisations of paths
- Path intersection matrices and applications to networks
This page was built for publication: Routes enumeration in a Boolean with respect to intersection and nonintersection relations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1280321)
