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

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of Mathematics Jg. 2022; H. 1
Hauptverfasser:	Anuradha, T., Lakshmi Surekha, T., Nuthakki, Praveena, Domathoti, Bullarao, Ghorai, Ganesh, Shami, Faria Ahmed
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Cairo Hindawi 2022 John Wiley & Sons, Inc Wiley
Schlagworte:	Algorithms Analysis Apexes Cartesian coordinates Graph theory Graphs Hypotheses Mathematics
ISSN:	2314-4629, 2314-4785
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!