Weakly Connected Domination in Graphs (Q2839237): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.endm.2009.03.010 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1985483238 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3933021 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On weakly connected domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating sets whose closed stars form spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of edges in graphs with a given weakly connected domination number / rank
 
Normal rank

Latest revision as of 15:16, 6 July 2024

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

    Statements

    Identifiers