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

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!