$k$-Efficient partitions of graphs (Q5242941): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
label / enlabel / en
 
$k$-Efficient partitions of graphs
Property / full work available at URL
 
Property / full work available at URL: https://doaj.org/article/de35674b4c524468b35cb4cf3d2e55da / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2921385611 / rank
 
Normal rank
Property / title
 
$k$-Efficient partitions of graphs (English)
Property / title: $k$-Efficient partitions of graphs (English) / rank
 
Normal rank

Revision as of 23:00, 19 March 2024

scientific article; zbMATH DE number 7128179
Language Label Description Also known as
English
$k$-Efficient partitions of graphs
scientific article; zbMATH DE number 7128179

    Statements

    0 references
    0 references
    0 references
    8 November 2019
    0 references
    domination
    0 references
    efficient domination
    0 references
    distance-\(k\) domination
    0 references
    $k$-Efficient partitions of graphs (English)
    0 references

    Identifiers