The unit acquisition number of a graph (Q1732112): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The total acquisition number of random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The total acquisition number of the randomly weighted path / rank
 
Normal rank
Property / cites work
 
Property / cites work: The total acquisition number of random geometric graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5519710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3838202 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total Acquisition in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acquisition-extremal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2875489 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the Assignment and Transportation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3507250 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fractional acquisition in graphs / rank
 
Normal rank

Latest revision as of 21:43, 18 July 2024

scientific article
Language Label Description Also known as
English
The unit acquisition number of a graph
scientific article

    Statements

    The unit acquisition number of a graph (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    22 March 2019
    0 references
    0 references
    acquisition number
    0 references
    unit acquisition
    0 references
    caterpillar
    0 references
    diameter 2
    0 references
    Petersen graph
    0 references
    0 references
    0 references