Domsaturation number of a graph

MaRDI QIDQ1860757zbMATH OpenFDO

Authors S. Arumugam, Radosław Kala

Publication date 26 February 2003

Published in Indian Journal of Pure \& Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

dominating set

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Structural characterization of families of graphs (05C75)

Recommendations

• Connected domsaturation number of a graph
• Independent dom-saturation number of a graph
• scientific article; zbMATH DE number 3914370
• Min-max dom-saturation number of a tree
• scientific article; zbMATH DE number 1539534

Cited in

(7)

• Connected domsaturation number of a graph
• Min-max and max-min graph saturation parameters
• Independent dom-saturation number of a graph
• Complementary equitably totally disconnected equitable domination in graphs
• Open packing saturation number of a graph
• Strong nonsplit domsaturation number of a graph
• Split domsaturation and some new parameters

This page was built for publication: Domsaturation number of a graph

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