Domination number and neighbourhood conditions

DOI10.1016/S0012-365X(98)00166-6zbMATH Open0934.05096OpenAlexW2059680011MaRDI QIDQ1296973FDOQ1296973

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

domination numberdominating setneighbourhood conditions

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (2)

• Minimum partition of an independence system into independent sets
• Title not available (Why is that?)

   Recommendations

• On the domination number of some graphs 👍 👎
• Upper bounds on the domination number of a graph in terms of order and minimum degree. 👍 👎
• Some results on characterizing the edges of connected graphs with a given domination number 👍 👎
• A linear vizing-like relation between the size and the domination number of a graph 👍 👎
• BOUNDS ON THE DOMINATION NUMBER OF A GRAPH 👍 👎

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

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