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 t...

Full description

Saved in:
Bibliographic Details
Published in:Journal of Mathematics Vol. 2022; no. 1
Main Authors: Anuradha, T., Lakshmi Surekha, T., Nuthakki, Praveena, Domathoti, Bullarao, Ghorai, Ganesh, Shami, Faria Ahmed
Format: Journal Article
Language:English
Published: Cairo Hindawi 2022
John Wiley & Sons, Inc
Wiley
Subjects:
Algorithms
Analysis
Apexes
Cartesian coordinates
Graph theory
Graphs
Hypotheses
Mathematics
ISSN:2314-4629, 2314-4785
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2314-4629
2314-4785
DOI:10.1155/2022/1618498