We propose here a general framework to address the question of trace operators on a dyadic tree. This work is motivated by the modeling of the human bronchial tree which, thanks t...
In this paper we study collective additive tree spanners for families of graphs that either contain or are contained in AT-free graphs. We say that a graph G = (V, E) admits a sys...
Quantum stabilizer states over Fm can be represented as self-dual additive codes over Fm2 . These codes can be represented as weighted graphs, and orbits of graphs under the genera...
In this work labeling of planar graphs is taken up which involves labeling the p vertices, the q edges and the f internal faces such that the weights of the faces form an arithmeti...
In formal language theory, many families of languages are defined using grammars or finite acceptors like pushdown automata and Turing machines. For instance, context-sensitive l...