On l-reconstructibility of degree list of graphs
The k-deck of a graph is the multiset of its subgraphs induced by k vertices which is denoted by Dk(G). A graph or graph property is l-reconstructible if it is determined by the deck of subgraphs obtained by deleting l vertices. Manvel proved that from the (n−l)-deck of a graph and the numbers of ve...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Amirkabir University of Technology
2024-01-01
|
| Series: | AUT Journal of Mathematics and Computing |
| Subjects: | |
| Online Access: | https://ajmc.aut.ac.ir/article_5091_55945885902305ab2a1a063e569e5b47.pdf |