E. M. Badr

  • Citations Per Year
Learn More
This article may be used for research, teaching, and private study purposes. Any substantial or systematic reproduction, redistribution, reselling, loan, sub-licensing, systematic supply, or distribution in any form to anyone is expressly forbidden. The publisher does not give any warranty express or implied or make any representation that the contents will(More)
New technologies have a great influence on the production process in modern factories. Introducing new techniques and methods is crucial to optimize and enhance the working of factories. However, ensuring a reliable and correct integration requires complete evaluation and assessment. In this thesis I utilize RFID systems and image processing to develop and(More)
An induced subgraph S of a graph G is called a derived subgraph of G if S contains no isolated vertices. An edge e of G is said to be residual if e occurs in more than half of the derived subgraphs of G. We prove some theorems which calculate the number of derived subgraphs for some special graphs. We also present a new algorithm SDSA that calculates the(More)
The ladder graph plays an important role in many applications as Electronics, Electrical and Wireless communication areas. The aim of this work is to present a new class of odd graceful labeling for the ladder graph. In particular, we show that the ladder graph Ln with m-pendant Ln mk1 is odd graceful. We also show that the subdivision of ladder graph Ln(More)
Computing the minimum spanning tree of the graph is one of the fundamental computational problems. In this paper, we present a new parallel algorithm for computing the minimum spanning tree of an undirected weighted graph with n vertices and m edges. This algorithm uses the cluster techniques to reduce the number of processors by fraction 1/ ( ) f n and the(More)
  • 1