Edge-vertex domination in trees (Q6115749)

From MaRDI portal

Revision as of 18:35, 30 December 2024 by Import241228121245 (talk | contribs) (Normalize DOI.)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

This is the item page for this Wikibase entity, intended for internal use and editing purposes.

Please use this page instead for the normal view: Edge-vertex domination in trees

scientific article; zbMATH DE number 7711943

Language	Label	Description	Also known as
English	Edge-vertex domination in trees	scientific article; zbMATH DE number 7711943

Statements

scholarly article

0 references

Edge-vertex domination in trees (English)

0 references

0 references

Discrete Mathematics, Algorithms and Applications

0 references

publication date

13 July 2023

0 references

zbMATH Keywords

edge-vertex dominating set

0 references

tree

0 references

MaRDI profile type

0 references

full work available at URL

https://doi.org/10.1142/s1793830922500434

0 references

Double vertex-edge domination

0 references

On trees with domination number equal to edge-vertex roman domination number

0 references

Improved budgeted connected domination and budgeted edge-vertex domination

0 references

Total edge–vertex domination

0 references

A lower bound on the total vertex-edge domination number of a tree

0 references

An improved upper bound of edge-vertex domination number of a tree

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

10.1142/S1793830922500434

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6115749

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