On the independent domination number of graphs with given minimum degree

DOI10.1016/S0012-365X(97)00267-7MaRDI QIDQ1584339zbMATH OpenOpenAlexFDO

Authors N. I. Glebov, Alexandr Kostochka

Publication date 2 November 2000

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0012-365x(97)00267-7

zbMATH Keywords

conjecture by Favaronindependent domination numberminimum degree

Mathematics Subject Classification ID

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

Recommendations

• An upper bound for the independent domination number
• On independent domination number of regular graphs
• scientific article; zbMATH DE number 850313
• On minimum maximal independent sets of a graph
• Independent dominating sets in regular graphs

Cites work

• Graph-theoretic parameters concerning domination, independence, and irredundance
• On minimum maximal independent sets of a graph
• Two relations between the parameters of independence and irredundance

Cited in

(10)

• On the independence number of minimum distance graphs
• An upper bound for the independent domination number
• Extremal connected graphs for independent domination number
• On upper transversals in 3-uniform hypergraphs
• Bounds on domination parameters in graphs: a brief survey
• scientific article; zbMATH DE number 5912077 (Why is no real title available?)
• A note on the independent domination number of subset graph
• Independent Domination in Triangle Graphs
• Independent domination number in Cayley digraphs of rectangular groups
• Independent domination in directed graphs

This page was built for publication: On the independent domination number of graphs with given minimum degree

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