Zobrazeno 1 - 10
of 17
pro vyhledávání: '"Ramadan El-Shanawany"'
Publikováno v:
Algorithms, Vol 16, Iss 7, p 320 (2023)
Nowadays, graph theory is one of the most exciting fields of mathematics due to the tremendous developments in modern technology, where it is used in many important applications. The orthogonal double cover (ODC) is a branch of graph theory and is co
Externí odkaz:
https://doaj.org/article/0fbc3fbe182e47cda3f2831cb85b10a3
Publikováno v:
Algorithms; Volume 16; Issue 7; Pages: 320
Nowadays, graph theory is one of the most exciting fields of mathematics due to the tremendous developments in modern technology, where it is used in many important applications. The orthogonal double cover (ODC) is a branch of graph theory and is co
Autor:
Abdelrahman selim, Fathi E. Abd El-Samie, Osama Zahran, Taha E. Taha, Ramadan El-Shanawany, Heba Abedellatif
Publikováno v:
Menoufia Journal of Electronic Engineering Research. 28:24-28
Publikováno v:
2021 International Conference on Electronic Engineering (ICEEM).
Encoding images based on self-similarity property is one of the essential coding methods used for texture and natural image compression. The two important considerations of fractal compression are higher compression ratio and quality preservation, bu
Publikováno v:
Menoufia Journal of Electronic Engineering Research. 27:337-345
The existence problem of the orthogonal double covers of the graphs is a well-known problem in the theory of combinatorial designs. In this paper, we construct the orthogonal double covers of the complete bipartite graph by the disjoint union of path
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 14, Iss 3, Pp 269-276 (2017)
In this article, a technique to construct cyclic orthogonal double covers (CODCs) of regular circulant graphs by certain infinite graph classes such as complete bipartite and tripartite graphs and disjoint union of butterfly and K 1 , 2 n − 10 is i
Autor:
Ramadan El-Shanawany
Publikováno v:
Open Journal of Discrete Mathematics. :7-12
A decomposition of a graph H is a partition of the edge set of H into edge-disjoint subgraphs . If for all , then G is a decomposition of H by G. Two decompositions and of the complete bipartite graph are orthogonal if, for all . A set of decompositi
Publikováno v:
Ain Shams Engineering Journal, Vol 6, Iss 2, Pp 657-660 (2015)
Let H be a graph on n vertices and G a collection of n subgraphs of H, one for each vertex, G is an orthogonal double cover (ODC) of H if every edge of H occurs in exactly two members of G and any two members share an edge whenever the corresponding
Autor:
H. Shabana, Ramadan El-Shanawany
Publikováno v:
British Journal of Mathematics & Computer Science. 4:394-401
Let X be a graph on n vertices and let B = {P (x) : x ∈ V (X)} be a collection of n subgraphs of X, one for each vertex, B is an orthogonal double cover (ODC) of X if every edge of X occurs in exactly two members of B and any two members share an e
Autor:
H. Shabana, Ramadan El-Shanawany
Publikováno v:
Open Journal of Discrete Mathematics. :19-27
An orthogonal double cover (ODC) of a graph H is a collection of subgraphs (pages) of H, so that they cover every edge of H twice and the intersection of any two of them contains exactly one edge. An ODC G of H is cyclic (CODC) if the cyclic group of