Weakly Connected Domination in Graphs (Q2839237)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Weakly Connected Domination in Graphs	scientific article

Statements

scholarly article

0 references

Weakly Connected Domination in Graphs (English)

0 references

zbMATH Open document ID

0 references

10.1016/j.endm.2009.03.010

0 references

Electronic Notes in Discrete Mathematics

0 references

publication date

4 July 2013

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

zbMATH Keywords

weakly connected domination

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.endm.2009.03.010

0 references

0 references

0 references

On weakly connected domination in graphs

0 references

Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons

0 references

0 references

Dominating sets whose closed stars form spanning trees

0 references

On the number of edges in graphs with a given weakly connected domination number

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2839237

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2839237&oldid=35340063"