Title

Domination Sequences

Abstract

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.

Publication Date

10-1-2000

Publication Title

Ars Combinatoria

Volume

57

Number of Pages

13-31

Document Type

Article

Personal Identifier

scopus

Socpus ID

0040197870 (Scopus)

Source API URL

https://api.elsevier.com/content/abstract/scopus_id/0040197870

This document is currently not available here.

Share

COinS