Graph Theory Algorithms of Hamiltonian Cycle from Quasi‐Spanning Tree and Domination Based on Vizing Conjecture

In this study, from a tree with a quasi‐spanning face, the algorithm will route Hamiltonian cycles. Goodey pioneered the idea of holding facing 4 to 6 sides of a graph concurrently. Similarly, in the three connected cubic planar graphs with two‐colored faces, the vertex is incident to one blue and two red faces. As a result, all red‐colored faces must gain 4 to 6 sides, while all obscure‐colored faces must consume 3 to 5 sides. The proposed routing approach reduces the constriction of all vertex colors and the suitable quasi‐spanning tree of faces. The presented algorithm demonstrates that the spanning tree parity will determine the arbitrary face based on an even degree. As a result, when the Lemmas 1 and 2 theorems are compared, the greedy routing method of Hamiltonian cycle faces generates valuable output from a quasi‐spanning tree. In graph idea, a dominating set for a graph S = (V, E) is a subset D of V. The range of vertices in the smallest dominating set for S is the domination number (S). Vizing’s conjecture from 1968 proves that the Cartesian fabricated from graphs domination variety is at least as big as their domination numbers production. Proceeding this work, the Vizing’s conjecture states that for each pair of graphs S, L.