Morphology of the connected components of the boolean sum of two digraphs (≤ 5)-hypomorphic up to complementation
نوع عمل المنشور
ما بعد الدكتوراه
اسم الناشر
Advances in Pure and Applied Mathematics
رقم المجلد
Vol. 15
رقم الانشاء
4
الصفحات
من 1 الى 20
A graph G consists of a possibly infinite set V(G) of vertices with a collection E(G) of unordered pairs of distinct vertices, called the set of edges of G. Such a graph is denoted by (V(G),E(G…
Mathematics (MDPI)
European Journal of Pure and Applied Mathematics
Advances in Pure and Applied Mathematics