An inequality that relates the size of a bipartite graph with its order and restrained domination number

DOI10.1007/s10878-014-9709-1zbMath1341.90134OpenAlexW2043287068MaRDI QIDQ5963608

Ernst J. Joubert

Publication date: 23 February 2016

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-014-9709-1

zbMATH Keywords

bipartite graphsizeorderdominationrestrained domination

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items (1)

Restrained and Total Restrained Domination in Graphs

Cites Work

• Restrained domination in graphs
• Star forests, dominating sets and Ramsey-type problems
• Maximum sizes of graphs with given domination parameters
• Maximum sizes of graphs with given restrained domination numbers
• Nordhaus-Gaddum results for restrained domination and total restrained domination in graphs
• On total restrained domination in graphs
• Algorithms for Vertex Partitioning Problems on Partial k-Trees
• Unnamed Item
• Unnamed Item

This page was built for publication: An inequality that relates the size of a bipartite graph with its order and restrained domination number