Maximum Matching in Sierpenski Arrow Head Curve

R. Sugana, P. Tharaniya and G. Jayalalitha

The aim of this paper is to present the method of finding the maximum matching in the Fractal Graph. Here, to find the constant ratio among the number of Edges, the number of Vertices and the Cardinality Number of Maximum Matching in each Iterations of regular self-similarity sets. It also analyzes natural characteristics of the fractal graph like Sierpenski Arrow Head Curve. By using Mathematical Induction method, the relation among them has to be implemented by Theorem.

Volume 12 | 03-Special Issue

Pages: 1380-1385

DOI: 10.5373/JARDCS/V12SP3/20201388