R., Sugana (2020) Maximum Matching in Sierpenski Arrow Head Curve. Journal of Advanced Research in Dynamical and Control Systems, 12 (SP3). pp. 1380-1385. ISSN 1943023X
Full text not available from this repository. (Request a copy)
Official URL: https://doi.org/10.5373/JARDCS%2FV12SP3%2F20201388
Abstract
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.
Item Type: | Article |
---|---|
Subjects: | Mathematics > Numerical Analysis |
Divisions: | Mathematics |
Depositing User: | Mr IR Admin |
Date Deposited: | 27 Sep 2024 09:55 |
Last Modified: | 27 Sep 2024 09:55 |
URI: | https://ir.vistas.ac.in/id/eprint/7477 |