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 165
- Downloads 0
INDEPENDENT VERIFICATION OF EULER’S FORMULA IN GRAPH THEORY FOR N IDENTICAL CIRCLES
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 i...
ACCELERATION MOTION OF A SINGLE VERTICALLY FALLING NON-SPHERICAL PARTICLE IN INCOMPRESSIBLE NON-NEWTONIAN FLUID BY DIFFERENT METHODS
An analytical investigation is applied for acceleration motion of a vertically falling non-spherical particle in a Shear-thinning (n<1) and Shear-thickening (n>1) power low fluid. The acceleration motion of vertically fa...
A STUDY ON THE EFFECTIVE EDGES IN THE CARTESIAN PRODUCT OF FUZZY GRAPHS
In this paper we discuss the number of effective edges in the Cartesian product of fuzzy graphs. Some basic theorems and results are obtained on effective edges. Based on the results we find the effective edge domination...
REMOVING NON-RELEVANT LINKS FROM TOP SEARCH RESULTS USING FEATURE SCORE COMPUTATION
To promote website in search engine rankings in order to get better visibility and more traffic, search engine optimizers have to follow legal ways but some search engine optimizers manipulate the web pages and boost the...
On Harmonious Graphs
Let G = (V (G), E(G)) be a graph with q edges. A function f is called harmonious labeling of graph G if f:V→{0,1,2,...,q-1} is injective and the induced function f* : E → {0,1,2,...,q} defined as f*(uv) = (f(u) + f(v))(...