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: | Rajab Ali Borzooei, Mehrnoosh Shadravan |
---|---|
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 |
Similar Items
-
Roadmap for the Nomination of Reconstructed Cultural Properties for Inscription on the UNESCO World Heritage List
by: Roha W. Khalaf
Published: (2018-09-01) -
The List Edge Coloring and List Total Coloring of Planar Graphs with Maximum Degree at Least 7
by: Sun Lin, et al.
Published: (2020-11-01) -
The Reconstructive Toolbox
by: Geoffrey G. Hallock
Published: (2023-07-01) -
A list-mode multi-energy window low-count SPECT reconstruction method for isotopes with multiple emission peaks
by: Md Ashequr Rahman, et al.
Published: (2023-06-01) -
Tuning Reconstruction Level of Precatalysts to Design Advanced Oxygen Evolution Electrocatalysts
by: Hainan Sun, et al.
Published: (2021-09-01)