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

An Interactive Dynamic Fuzzy Goal Programming for Bi-level Multiobjective Linear Fractional Programming Problems.

This paper presents an interactive dynamic fuzzy goal programming (DFGP) approach for solving bi-level multiobjective linear fractional programming (BL MOLFP) problems with the characteristics of dynamic programming (DP)...

MODELLING NIGERIA POPULATION GROWTH RATE

Thomas Robert Malthus Theory of population highlighted the potential dangers of over population. He stated that while the populations of the world wouldincrease in geometric proportions, the food resources available for...

Properties of Derivations on KU-ALGEBRAS

In this paper the notion of (l, r) ( or (r,l) ) -derivations and t-derivation of a KU-algebra are introduced, and some related properties are investigated. Also, we consider regular derivations and the D-invariant o...

Uniqueness of Solutionfor Nonlinear Implicit Fractional Differential Equation

We study the uniquenessof solutionfor nonlinear implicit fractional differential equation with initial condition involving Caputo fractional derivative. The technique used in our analysis is based on an application of Bi...

Exact Solution of a Linear Difference Equation in a Finite Number of Steps

An exact solution of a linear difference equation in a finite number of steps has been obtained. This refutes the conventional wisdom that a simple iterative method for solving a system of linear algebraic equations is a...

Download PDF file
  • EP ID EP651329
  • DOI 10.24297/jam.v7i2.2596
  • Views 167
  • Downloads 0

How To Cite

Mushtaq Ahmad Shah (2014). Necessary Condition for Cubic Planer three Connected Graph to be Non- Hamiltonian and proof of Barnettes Conjecture. JOURNAL OF ADVANCES IN MATHEMATICS, 7(2), 1227-1242. https://europub.co.uk/articles/-A-651329