The adversary degree-associated reconstruction number of double-brooms (Q491632): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C85 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C07 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6473428 / rank
 
Normal rank
Property / zbMATH Keywords
 
degree-associated reconstruction
Property / zbMATH Keywords: degree-associated reconstruction / rank
 
Normal rank
Property / zbMATH Keywords
 
double-broom
Property / zbMATH Keywords: double-broom / rank
 
Normal rank
Property / zbMATH Keywords
 
adversary reconstruction
Property / zbMATH Keywords: adversary reconstruction / rank
 
Normal rank
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.jda.2015.03.008 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1999575245 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree-associated reconstruction number of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost every graph has reconstruction number three / rank
 
Normal rank
Property / cites work
 
Property / cites work: Families of pairs of graphs with a large number of common cards / rank
 
Normal rank
Property / cites work
 
Property / cites work: The graph reconstruction number / rank
 
Normal rank
Property / cites work
 
Property / cites work: A congruence theorem for trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On reconstruction of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree associated edge reconstruction number of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adversary degree associated reconstruction number of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the adversary degree associated reconstruction number of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4119240 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5397483 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3259049 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:24, 10 July 2024

scientific article
Language Label Description Also known as
English
The adversary degree-associated reconstruction number of double-brooms
scientific article

    Statements

    The adversary degree-associated reconstruction number of double-brooms (English)
    0 references
    0 references
    0 references
    0 references
    18 August 2015
    0 references
    0 references
    degree-associated reconstruction
    0 references
    double-broom
    0 references
    adversary reconstruction
    0 references
    0 references