Necessary Condition for Cubic Planer three Connected Graph to be Non- Hamiltonian and proof of Barnettes Conjecture
Journal Title: JOURNAL OF ADVANCES IN MATHEMATICS - Year 2014, Vol 7, Issue 2
Abstract
A conjecture of Barnette's states that every three connected cubic bipartite planer graph is Hamiltonian. This problem has remained open since its formulation .This paper has a threefold purpose. The first is to provide survey of literature surrounding the conjecture. The second is to give the necessary condition for cubic planer three connected graph to be non Hamiltonian, and finally I shall prove the Barnette's conjecture. For the proof of different results using to prove the results I illustrate most of the results by using counter examples.
Authors and Affiliations
Mushtaq Ahmad Shah
Keywords
Related Articles
- EP ID EP651329
- DOI 10.24297/jam.v7i2.2596
- Views 182
- Downloads 0
Short Communication A note on "The Ideal Generated by Codense Sets and the Banach Localization Property"
In this note we show by producing counter examples that some results which appeared in the articles by Jankovic and Hamlett [3] are incorrect.
Numerical solution of fuzzy delay differential equations under generalized differentiability by Euler's method
In this paper, we interpret a fuzzy delay differential equations using the concept of generalized differentiability. Using the Generalized Characterization Theorem, we investigate the problem of finding a numerical appro...
Edge Monophonic Domination Number of Graphs
In this paper the concept of edge monophonic domination num-ber of a graph is introduced.A set of vertices D of a graph G is edge mono-phonic domination set (EMD set) if it is both edge monophonic set and adomination set...
SUCESSIVE DIFFERENTIAL COEFFICIENTS FOR MHD VELOCITY SLIP BOUNDARY LAYER FLOW OVER A PLANE PLAQUE
Effects of MHD and velocity slip on boundary layer flow over a plane plaque is investigated. Similarity transformations are employed to transform the governing partial differential equations into ordinary ones, whi...
Complexity Measure in Simple Type Food Chain System
Study of complexities arising during evolution of a food chain system has been investigated. Regular and chaotic motions have been observed for certain sets of values of a parameter of the system. For some detailed furth...