Domination sequences.

MaRDI QIDQ2715967zbMATH OpenFDO

Authors Robert Brigham, Julie R. Carrington, Richard P. Vitray

Publication date 20 July 2005

Published in Ars Combinatoria (Search for Journal in Brave)

zbMATH Keywords

connected domination numberindependent domination number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Review text

Let \(I(G)\) be a numerical invariant of a graph \(G\). A sequence \(a_1,a_2,\dots ,a_n\) may be considered such that the sequence of graphs \(G_1,G_2,\dots ,G_n\) exists and \(G_i\) has \(i\) vertices, \(G_i\) is an induced subgraph of \(G_{i+1}\) and \(I(G_i)=a_i\). Such sequences are considered for various choices of \(I(G)\). They are the domination number, independent domination number, connected domination number, total domination number, chromatic number, etc.

Recommendations

• Sequences of graphical invariants
• Grundy domination sequences in generalized corona products of graphs
• scientific article; zbMATH DE number 68357
• The sequence of upper and lower domination, independence and irredundance numbers of a graph
• Vertex sequences in graphs

Cited in

(3)

• The insulation sequence of a graph
• scientific article; zbMATH DE number 5520367 (Why is no real title available?)
• Sequences of graphical invariants

This page was built for publication: Domination sequences.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2715967)