Let be a finite building (or, more generally, a thick spherical and locally finite building). The chamber graph G(), whose edges are the pairs of adjacent chambers in , is known t...
As a generalization of Deza graphs, we introduce Deza digraphs and describe the basic theory of these graphs. We also prove the necessary and sufficient conditions when a weakly d...
Given an undirected hypergraph and a subset of vertices S V with a specified root vertex r S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the hypered...
Abstract. Flat theory with sequence variables and flexible arity symbols has infinitary matching and unification type. Decidability of general unification is shown and a unificatio...
A call admission control scheme named thinning scheme, which smoothly throttles the admission rates of calls according to their priorities and aims to provide multiple prioritized ...