Domination number and neighbourhood conditions

DOI10.1016/S0012-365X(98)00166-6zbMath0934.05096OpenAlexW2059680011MaRDI QIDQ1296973

Beifang Chen, Sanming Zhou

Publication date: 10 April 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(98)00166-6

zbMATH Keywords

dominating setdomination numberneighbourhood conditions

Mathematics Subject Classification ID

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

Related Items (1)

Minimum partition of an independence system into independent sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Estimations for the domination number of a graph
• Maximum number of edges in connected graphs with a given domination number
• A generalization of Vizing's theorem on domination
• BOUNDS ON THE DOMINATION NUMBER OF A GRAPH
• Domination in graphs with minimum degree two
• A compilation of relations between graph invariants
• A compilation of relations between graph invariants—supplement I
• Updating the hamiltonian problem—A survey

This page was built for publication: Domination number and neighbourhood conditions