|
Maximal Matching in Fractal Graphs and Its Application
|
|
| Author:
|
P.THARANIYA , G.JAYALALITHA
|
| Abstract:
|
The role of this paper is to evaluate the process of calculating the Maximal Matching in the Fractal Graph especially Von Koch Curve and Koch Snowflake. Here it analyzes the characteristics, construction, properties, nature, implementation, Iteration and uses of the famous Fractal Graph like Von Koch Curve and Koch Snowflake. Here to explain how the Fractal Graph can be constructed and implemented. By using Proof of Mathematical Induction methods, it evaluates the Maximal Matching Cardinality of Von Koch Curve and Koch Snowflake. Cardinality shows that the number of vertices selected for Maximal Matching. Also this paper shows that the value of cardinality remains the constant ratio for all Iteration of the Fractal Graph. It shows that the application of Maximal Matching cardinality value is useful for many areas like Construction Field, Designing of Computer Architecture field, Focus of Camera, Consumption of raw material in construction Sight and so on.
|
| Keyword:
|
Graph Theory, Fractal Graph, Matching, Maximal Matching, Classical Geometry
|
| EOI:
|
-
|
| DOI:
|
https://doi.org/10.31838/ijpr/2021.13.01.314
|
| Download:
|
Request For Article
|
|
|