### Classification of problems of determining the maximum common fragments for two structures of a temporal digraph

Document Type : Research Paper

Author

Department of Applied Mathematics, College of Science, University of Anbar, Ramadi, Iraq

Abstract

A new approach is proposed for classifying the problems of determining the maximum common fragments $(M C F)$ for two connected structures included in the $T$-digraph, based on the type of the maximum common fragment. A tree of classification the problems of determining the maximum common fragments $(M C F)$ for two structures $t_{i} G, t_{j} G\left(M C F\left(t_{i} G, t_{j} G\right)\right)$ included in the $T$-digraph is proposed. Examples are given for a digraph $t G$ with three types of its fragments (parts), and for five connectivity types of digraphs. The formulation of six basic problems of determining the maximum common fragments $(MCF)$ for two connected structures included in the $T$-digraph is given. A classification is proposed for an isomorphic embedding of a digraph into another.

Keywords