2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/86394In this paper, we present a simple model of scale-free networks that incorporates both preferential & random attachment and anti-preferential & random deletion at each time step. We derive the degree distribution analytically and show that it follows a power law with the degree exponent in the range of (2,infinity). We also find a way to derive an expression of the clustering coefficient for growing networks and compute the average path length through simulation.15 pages, 4 figuresData Analysis, Statistics and Probabilitytext