We establish results on NeST graphs (intersection tolerance graphs of neighborhood subtrees of a tree) and several subclasses. In particular, we show the equivalence of proper NeS...
Ryan B. Hayward, Paul E. Kearney, Andrew J. Malton
We point out several security flaws in the cryptosystem based on tree replacement systems proposed by Samuel, Thomas, Abisha and Subramanian at INDOCRYPT 2002. Due to the success...
Directed hypergraphs are used to model networks whose nodes are connected by directed buses. We study in this paper two parameters related to the fault-tolerance of directed bus n...
In the strong edge coloring problem, the objective is to color the edges of the given graph with the minimum number of colors so that every color class is an induced matching. In ...