Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Hamilton cycles in generalized Mycielski graphs
View through CrossRef
Let [Formula: see text] denote the generalized Mycielski graph of [Formula: see text]. In this paper, it is proved that for [Formula: see text], if [Formula: see text] has [Formula: see text] pairwise edge-disjoint Hamilton cycles, then [Formula: see text] has [Formula: see text] Hamilton cycles which are pairwise edge-disjoint. Further, it is shown that if [Formula: see text] has [Formula: see text] pairwise edge-disjoint Hamilton cycles with [Formula: see text] for [Formula: see text] and [Formula: see text] for [Formula: see text], then [Formula: see text] has [Formula: see text] pairwise edge-disjoint Hamilton cycles. Finally it is shown that [Formula: see text] is hamiltonian even when [Formula: see text] is non-hamiltonian with a specified [Formula: see text]-factor. Consequently, the Mycielski graph of Flower Snark graph [Formula: see text], for all odd [Formula: see text], is Hamiltonian.
World Scientific Pub Co Pte Ltd
Title: Hamilton cycles in generalized Mycielski graphs
Description:
Let [Formula: see text] denote the generalized Mycielski graph of [Formula: see text].
In this paper, it is proved that for [Formula: see text], if [Formula: see text] has [Formula: see text] pairwise edge-disjoint Hamilton cycles, then [Formula: see text] has [Formula: see text] Hamilton cycles which are pairwise edge-disjoint.
Further, it is shown that if [Formula: see text] has [Formula: see text] pairwise edge-disjoint Hamilton cycles with [Formula: see text] for [Formula: see text] and [Formula: see text] for [Formula: see text], then [Formula: see text] has [Formula: see text] pairwise edge-disjoint Hamilton cycles.
Finally it is shown that [Formula: see text] is hamiltonian even when [Formula: see text] is non-hamiltonian with a specified [Formula: see text]-factor.
Consequently, the Mycielski graph of Flower Snark graph [Formula: see text], for all odd [Formula: see text], is Hamiltonian.
Related Results
Biodiversity and Distribution of Fish Fauna in Dera Ghazi Khan Canal
Biodiversity and Distribution of Fish Fauna in Dera Ghazi Khan Canal
The DG Khan canal is a vast canal starting from Taunsa Barrage and flowing through different areas of the DG Khan District. In some places, its water is restricted and has many fis...
Independent Set in Neutrosophic Graphs
Independent Set in Neutrosophic Graphs
New setting is introduced to study neutrosophic independent number and independent neutrosophic-number arising neighborhood of different vertices. Neighbor is a key term to have th...
Failed Independent Number in Neutrosophic Graphs
Failed Independent Number in Neutrosophic Graphs
New setting is introduced to study neutrosophic failed-independent number and failed independent neutrosophic-number arising neighborhood of different vertices. Neighbor is a key t...
Zygmunt Mycielski i „Res Facta” Michała Bristigera: międzyredaktorskie dialogi i solilokwia
Zygmunt Mycielski i „Res Facta” Michała Bristigera: międzyredaktorskie dialogi i solilokwia
Throughout their lives Zygmunt Mycielski and Michał Bristiger were deeply interested in the development of musical life in Poland, understood in its wider perspective. Both were al...
Novel/Old Generalized Multiplicative Zagreb Indices of Some Special Graphs
Novel/Old Generalized Multiplicative Zagreb Indices of Some Special Graphs
Topological descriptor is a fixed real number directly attached with the molecular graph to predict the physical and chemical properties of the chemical compound. Gutman and Trinaj...
On the reciprocal distance spectrum of edge corona of graphs
On the reciprocal distance spectrum of edge corona of graphs
The reciprocal distance spectrum (Harary spectrum) of a connected graph [Formula: see text] is the multiset of eigenvalues of its reciprocal distance matrix (Harary matrix) [Formul...
Kneser graphs are Hamiltonian
Kneser graphs are Hamiltonian
For integers~$k\geq 1$ and $n\geq 2k+1$, the Kneser graph~$K(n,k)$ has as vertices all $k$-element subsets of an $n$-element ground set, and an edge between any two disjoint sets. ...
Computing the Energy of Certain Graphs based on Vertex Status
Computing the Energy of Certain Graphs based on Vertex Status
Background:
The concept of Hückel molecular orbital theory is used to compute the graph energy numerically and graphically on the base of the status of a vertex.
Objective:
Our a...