Sierpinski Graph in form of Matrix Representation to obtain vertices and edges

Abstract

Graph theory is one of the enriched field of mathematics. In this graph theory, Sierpinski graph is a very famous fractal pattern. In this paper, we made an effort to find number of vertices and edges of generalized Sierpinski graph S(c,K_n) (where c means copying of graph, K_n is a regular graph) by constructing incidence matrix and circuit matrix of given graph.