Graph burning, introduced by Elham Rashanbin in 2016, has gained significant research attention in recent years. This innovative concept involves iteratively selecting nodes in a given graph to 'burn' at each time step. The previously burnt nodes then ignite the adjacent nodes, and this process continues until all nodes are burnt. The minimum number of nodes required to ignite the entire graph is known as the burning number. Similarly, the domination number of a graph refers to the size of the smallest vertex subsets that ensure every vertex in the graph is either part of the subset or adjacent to a vertex within the subset. In this paper, we demonstrate that if the domination number of a graph is at least 6, then its burning number is smaller than or equal to its domination number.