Edge-recognizable domination numbers. (Q1415542): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3818357 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Reconstructing Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5581298 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5544087 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4368728 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A congruence theorem for trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Reconstruction of Trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On reconstructing graphs from their sets of subgraphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Bidegreed graphs are edge reconstructible / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3259049 / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/s0012-365x(03)00183-3 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2072579127 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 11:15, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Edge-recognizable domination numbers. |
scientific article |
Statements
Edge-recognizable domination numbers. (English)
0 references
4 December 2003
0 references
Edge-reconstruction
0 references
Connected domination
0 references
Total domination
0 references
Paired domination
0 references
\(k\)-domination
0 references
Distance-\(k\) domination
0 references