Star saturation number of random graphs |
| |
Authors: | A Mohammadian B Tayfeh-Rezaie |
| |
Institution: | School of Mathematics, Institute for Research in Fundamental Sciences (IPM), P.O. Box 19395-5746, Tehran, Iran |
| |
Abstract: | For a given graph , the -saturation number of a graph is the minimum number of edges in an edge-maximal -free subgraph of . Recently, the -saturation number of the Erd?s–Rényi random graph has been determined asymptotically for any complete graph . In this paper, we give an asymptotic formula for the -saturation number of when is a star graph. |
| |
Keywords: | Random graph Saturation Star graph |
本文献已被 ScienceDirect 等数据库收录! |
|