INDEPENDENT VERIFICATION OF EULER’S FORMULA IN GRAPH THEORY FOR N IDENTICAL CIRCLES
Journal Title: Bulletin of Pure and Applied Sciences Sec. E - Mathematics and Statistics - Year 2018, Vol 37, Issue 1
Abstract
This paper discusses the famous Euler’s formula in graph theory and its independent verification for the case of n identical circles forming a planar graph. A planar connected graph is generated using n circles, and an intuitive approach is taken to construct formulae for the number of vertices (v), edges (e) and faces (f), where symmetry of the pattern is used to determine the relation between v, e and f.
Authors and Affiliations
Padmanabh S. Sarpotdar
ON FUNCTIONS OF A SINGLE MATRIX ARGUMENT - III
We prove some Eulerian integrals involving the hypergeometric functions of single matrix argument. The integrals studied here involve the and the functions of matrix argument. We apply the Mathai’s matrix transform t...
Application of Magneto-Williamson Model in Nanofluid Flow
This paper investigates the effect of the nano particle effect on magneto hydrodynamic boundary layer over a stretching in the current of heat generation or absorption with heat and mass fluxes. The governing partial dif...
APPLICATION OF MIXED QUADRATURE FOR NUMERICAL EVALUATION OF FRACTIONAL INTEGRALS
In this paper, we improve the corrective factor approach using a mixed quadrature rule for numerical integration of fractional integral of order
DOMINATION IN CARTESIAN PRODUCT OF FUZZY GRAPHS USING STRONG ARC
In this paper the domination in fuzzy graphs by using strong arcs are generalized and established the domination concept in Cartesian product on standard fuzzy graphs using strong arcs and non strong arcs
ON THE DEGENERATE LAPLACE TRANSFORM - I
We make an attempt in this paper to extend the very recent work of Kim and Kim [24] on degenerate Laplace transform. Using the definition of the degenerate Laplace transform as given by Kim and Kim [24] and some of the...