A note on the adversary degree associated reconstruction number of graphs (Q2249937): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q5572939 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3259049 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The graph reconstruction number / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3483308 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The falsity of the reconstruction conjecture for tournaments / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Degree-associated reconstruction number of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5397483 / rank | |||
Normal rank |
Latest revision as of 17:00, 8 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A note on the adversary degree associated reconstruction number of graphs |
scientific article |
Statements
A note on the adversary degree associated reconstruction number of graphs (English)
0 references
4 July 2014
0 references
Summary: A vertex-deleted subgraph of a graph \(G\) is called a card of \(G\). A card of \(G\) with which the degree of the deleted vertex is also given is called a degree associated card (or dacard) of \(G\). The degree associated reconstruction number \(\mathrm{drn}(G)\) of a graph \(G\) is the size of the smallest collection of dacards of \(G\) that uniquely determines \(G\). The adversary degree associated reconstruction number of a graph \(G\), \(\mathrm{adrn}(G\)), is the minimum number \(G\) such that every collection of \(k\) dacards of \(G\) that uniquely determines \(G\). In this paper, we show that adrn of wheels and complete bipartite graphs on at least 4 vertices is 2 or 3.
0 references
wheels
0 references
complete bipartite graphs
0 references
dacards
0 references