On weighted efficient total domination (Q414423)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	On weighted efficient total domination	scientific article

Statements

scholarly article

0 references

On weighted efficient total domination (English)

0 references

0 references

Journal of Discrete Algorithms

0 references

publication date

11 May 2012

0 references

zbMATH Keywords

weighted efficient total domination

0 references

weighted efficient total edge domination

0 references

efficient total domination

0 references

total domination

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.jda.2011.06.001

0 references

Graph Classes: A Survey

0 references

Graphs whose neighborhoods have no special cycles

0 references

Weighted independent perfect domination on cocomparability graphs

0 references

Total domination in graphs

0 references

Balanced matrices

0 references

Planar 3DM is NP-complete

0 references

A strengthening of Ben Rebea's lemma

0 references

Efficient edge domination problems in graphs

0 references

0 references

0 references

Weighted efficient domination problem on some perfect graphs

0 references

A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G

0 references

A theory of alternating paths and blossoms for proving correctness of the \(O(\sqrt{V}E)\) general graph maximum matching algorithm

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/j.jda.2011.06.001

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:414423

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