Torus and Hypercube are very well-known graphs. When these graphs expand, A Torus graph has the advantage in that its degree does not increase. Torus Tn has a degree of 4. A Hypercube be has a shorter diameter compared to that of other graphs, because when the graph expands, the number of nodes increases by a factor of 2, and the diameter increases by 1. Hypercube Qn has 2ⁿ nodes, and its diameter is n. The Hypercube and Torus have been realized using these advantages. We propose the Rotational Binary Graph(RBG), a new graph which has the advantages of both Hypercube and Torus. RBGn is an undirected graph, having 2ⁿ nodes, 2n+1 edges, and a degree of 4. The diameter of RBGn would be 1.5n+1. In this paper, we first suggest RBG, which is a fixed-degree graph, and we examine the topology properties of RBG. Second, we construct a binary spanning tree using RBG. Third, we compare fixed-degree graphs to RBG considering network cost specifically. Fourth, we suggest a broadcast algorithm with a time complexity of 2n-2. Finally, we are prove that RBGn embedded into hypercube Qn results in dilation n to expansion 1 and congestion 7.