DATA STRUCTURE FOR GRAPH REPRESENTATIONS OF A NETWORK HAVING DOUBLE EULER TRAILS

Abstract

A network that has a double Euler trail (DET) is called a DET network. A DET network may realize various DETs in different graph representations. Furthermore, a pair of specific graph representations for a DET network may realize different DETs. Based on above considerations, we introduce a data structure PQQ'-tree to keep DETs in all graph representations for any DET network.