Scholarly open access journals, Peer-reviewed, and Refereed Journals, Impact factor 8.14 (Calculate by google scholar and Semantic Scholar | AI-Powered Research Tool) , Multidisciplinary, Monthly, Indexing in all major database & Metadata, Citation Generator, Digital Object Identifier(DOI)
In this paper, we’re taking a look at the Sierpinski Pentagon Graph to figure out how we can show it using matrices. We’re focusing on getting the vertices and edges at different recursion levels ‘n’. The Sierpinski Pentagon is a really cool fractal that comes out through repeating a process over and over, making complex geometric patterns. By using matrix theory, we came up with a clear way to map out the connections in the graph. Our research shows how the number of vertices and edges changes as we go deeper into recursion with it getting way more complex. We also touch on how this work might matter more broadly for network theory and computational geometry, hopefully giving some insight into the basic principles behind fractals and basically we’re trying to wrap our heads around structured recursive systems better and how to visually show them.
"Matrix Representation of the Sierpinski Pentagon Graph: Analyzing Vertices and Edges at Recursion Depth n", International Journal of Science & Engineering Development Research (www.ijrti.org), ISSN:2455-2631, Vol.10, Issue 4, page no.d131-d138, April-2025, Available :http://www.ijrti.org/papers/IJRTI2504316.pdf
Downloads:
000337
ISSN:
2456-3315 | IMPACT FACTOR: 8.14 Calculated By Google Scholar| ESTD YEAR: 2016
An International Scholarly Open Access Journal, Peer-Reviewed, Refereed Journal Impact Factor 8.14 Calculate by Google Scholar and Semantic Scholar | AI-Powered Research Tool, Multidisciplinary, Monthly, Multilanguage Journal Indexing in All Major Database & Metadata, Citation Generator