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 of a graph G (or dr n(G)) is the size of the smallest collection of dacards of G that uniquely determines G. It is shown that drn(G) = 1 or 2 for all biregular bipartite graphs with degrees d and d+ k, k ≥ 2 except the bistar B_(2,2) on 6 vertices and that drn(B_(2,2)) = 3.
展开▼
机译：图G的顶点删除的子图称为G的卡。还给出了删除顶点的程度的G卡称为G的程度相关卡（或DACard）。学位相关的重建数图G（或N（g）博士）是唯一确定G.唯一确定G的巨大曲线集合的大小。显示所有双面二分层的DRN（g）= 1或2，具有d和d + k ，K≥2除了双眼顶点的Bistar B_（2,2），DRN（B_（2,2））= 3。
展开▼
