Topologized Cut Vertex and Edge Deletion
Journal Title: Asian Research Journal of Mathematics - Year 2017, Vol 5, Issue 1
Abstract
In this paper discussed and study a new result of non-topologized graph by using cut vertex and cut edge component of the graph makes the graph to be Topologized graph. This concept implemented to some families of graph.
Authors and Affiliations
S. Vimala, A. Jasmine Amala
Keywords
Related Articles
- EP ID EP338354
- DOI 10.9734/ARJOM/2017/33108
- Views 72
- Downloads 0
Using the Logistic Function to Illustrate Periodic Orbits as Recurrent Formation
Recurrence as behaviour in the dynamical system is also a state which happens as a result of an outcome of a point which does return to its initial state. But in dynamical system the most simple and easy way to study reg...
Archbishop Porter Girls’ Senior High School Students’ Perception of Difficult Concepts in Senior High School Further Mathematics Curriculum in Ghana
Further Mathematics is frequently perceived as a subject set aside for some exceptional individuals. It often induces feelings of worry; nervousness and panic among students. This study employed the survey research desig...
Generic Simplicity of a Schrödinger-type Operator on the Torus
The generic simplicity of the spectrum of a Schrödinger-type operator on the n-dimensional torus is studied using the Rayleigh-Schrödinger perturbation theory. The existence of a perturbation potential of the Laplacian i...
Some Power Sums from the Geometric Series
We focus on the summation of Σn r=1 (r + k − 1)! (r − 1)! xr+k and express it as simple polynomials and nd a relation between them.
The Impact of Consumption on an Investor’s Strategy under Stochastic Interest Rate and Correlating Brownian Motions
In this work, we consider that an investor’s portfolio comprises of two assets- a risk-free asset driven by Ornstein-Uhlenbeck Stochastic interest rate of return model and the second asset a risky stock with a price proc...