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
Keywords
Related Articles
- EP ID EP531600
- DOI 10.5958/2320-3226.2018.00002.4
- Views 157
- Downloads 0
Restricted Constraints in a Max-Flow and Min-Cost problem
The present paper defines a combination of two most important and old flow problems such as maximum flow and minimum cost flow. In the first one a flow with the maximum value from source node to sink node is sought. The...
Expansive Mappings in Digital Metric Spaces
In this paper, we prove some common fixed point theorems for expansive mappings in digital metric spaces
A NOTE ON SEMIDERIVATIONS
Recently, Filippis et al. introduced the notion of generalized semiderivation [[5], Definition 1.2] in prime rings. Accordingly, let R be a prime ring and F: R→R be an additive mapping. If there exists a semiderivation d...
On Euler-Beta Transform of I-function of two variables
In this paper, the authors establish the Euler-Beta transform of various products involving a General Class of Polynomials, Struve’s function and I-function of two variables. Some similar formulae are also derived as s...
COCHAIN-VALUED THEORY IN TOPOLOGICAL FIELD THEORY
We determine the category of boundary conditions in the case that the closed string algebra is semisimple. We find that sewing constraints - the most primitive form of worldsheet locality - already imply that D-branes ar...