A note on connected bipartite graphs having independent domination number half their order.

DOI10.1016/j.aml.2003.09.006zbMath1056.05108OpenAlexW2054611590MaRDI QIDQ1767156

Xue-gang Chen, De-Xiang Ma

Publication date: 7 March 2005

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aml.2003.09.006

zbMATH Keywords

TreeBipartite graphIndependent domination number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (3)

Domination, independent domination and \(k\)-independence in trees ⋮ Independent domination in directed graphs ⋮ An improved upper bound on the independent double Roman domination number of trees

Cites Work

• On graphs having domination number half their order
• A characterization of \(i\)-excellent trees
• Independent domination and matchings in graphs
• Domination-balanced graphs
• Vertices contained in every minimum dominating set of a tree

This page was built for publication: A note on connected bipartite graphs having independent domination number half their order.