MAXIMUM MATCHING IN HILBERT CURVE

ABSTRACT. The goal of this paper analyses the fractal Graphs in Fractal Antenna
like Hilbert Fractal Graph which is 2- dimensional Fractal Graph. Fractal Antenna
which is the most famous and worth Structure of Antenna when compared to other
model of Antennas. In this paper discuss the History, development, Construction,
Raw Materials and Advantages of Fractal Antenna. Here this paper shows the
structures, properties and calculating the number of Vertices and Edges for such afractal Graph. The concept of Matching is also major part of this paper. It finds theconstant ratio of increasing number of vertices in the every level Iteration. Thereare two methods are used to find the Maximum Matching Cardinality in this paperThe methods are Iterative Function method and Mathematical Induction Method.ship between the cardinality of matching and thenumber of vertices increasing in the corresponding Iteration which is implementedby the theorem. Evaluation is shown as in the tabulated format.