Let G be a simple graph with vertex set {v1, v2, … , vn}. The common neighborhood graph of G, denoted by con(G), is a graph with vertex set {v1, v2, … , vn}, in which two vertices are adjacent if and only if they have at least one common neighbor in the graph G. In this paper, we compute the common neighborhood of some composite graphs. In continue, we investigate the relation between hamiltoni...

ammonia is a toxic material for mammalians. it is detoxificated and converted to urea in the urea cycle in liver. each defect in the urea cycle cause increase in blood ammonia level. ornithine transcarbamylase enzyme (otc) is the second enzyme in the urea cycle that exists in mitochondria. otc deficiency is the most common hereditary disorder in the urea cycle. in this study, 45 hyper ammonia p...

Abstract. In this paper we discuss the problem of generically finding nearcollisions for cryptographic hash functions in a memoryless way. A common approach is to truncate several output bits of the hash function and to look for collisions of this modified function. In two recent papers, an enhancement to this approach was introduced which is based on classical cycle-finding techniques and cove...

in this paper, a new combined power and refrigeration cycle is proposed, which combines the rankin power cycle and the ejector refrigeration cycle. this combined cycle produces both power output and refrigeration output simultaneously. this cycle is driven by the flue gas of gas turbines, industrial waste heats, solar energy and geothermal energy. an exergy analysis is performed to guide the th...