The degree-associated reconstruction number of an unicentroidal tree
As we know, by deleting one vertex of a graph $G$, we have a subgraph of $G$ called a card of $G$. Also, investigation of that each graph with at least three vertices is determined by its multiset of cards, is called the reconstruction conjecture and the minimum number of dacards that determine $G$...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Isfahan
2024-02-01
|
| Series: | Transactions on Combinatorics |
| Subjects: | |
| Online Access: | https://toc.ui.ac.ir/article_28135_1bd687e1d71802a0126d74bcfab76380.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|