Let I (G) be a graphical invariant defined for any graph G. For several choices of I representing domination parameters, we characterize sequences of positive integers a1, a2, ⋯, an which have an associated sequence of graphs G1, G2, ⋯, Gn such that Gi has i vertices, Gi is an induced subgraph of Gi+1, and I (Gi) = ai.
Number of Pages
Source API URL
Brigham, Robert C.; Carrington, Julie R.; and Vitray, Richard P., "Domination Sequences" (2000). Scopus Export 2000s. 772.