scientific article; zbMATH DE number 861339

MaRDI QIDQ4871064zbMATH OpenFDO

Authors Laura A. Sanchis

Publication date 13 August 1996

zbMATH Keywords

connected graphsdominating setdomination numberendpointextremal graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75)

Recommendations

• Some results on characterizing the edges of connected graphs with a given domination number
• Edge domination in graphs
• Connected edge domination in graphs
• The edge domination number of connected graphs

Cited in

(10)

• Maximum number of edges in connected graphs with a given domination number
• Graphs with least domination number three-fifths their order
• Making a dominating set of a graph connected
• Generating hard and diverse test sets for NP-hard graph problems
• Some results on characterizing the edges of connected graphs with a given domination number
• On the number of edges in graphs with a given connected domination number
• The edge domination number of connected graphs
• Domination in Jahangir graph J_{2,m}
• On the domination number of some graphs
• scientific article; zbMATH DE number 4114673 (Why is no real title available?)

This page was built for publication:

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