Add to ORKGA card (ecard) of a graph G is a subgraph formed by deleting a vertex (an edge). A dacard (da-ecard) specifies the degree of the deleted vertex (edge) along with the card (ecard). The degree associated reconstruction number (degree associated edge reconstruction number ) of a graph G, drn(G) (dern(G)), is the minimum number of dacards (da-ecards) that uniquely determines G. In this paper, we investigate these two parameters for the total graph of certain standard graphs
The deck of a graph G is the multiset of cards. Myrvold (1992) showed that the degree sequence of a ...
The rupture degree of an incomplete connected graph G is defined by r(G) = max {w (G -S) - |S|m (G -...
The edge reconstruction number of a graph G, RN(G), is the minimum number of edge deleted subgraphs ...
A card (ecard) of a graph G is a subgraph formed by deleting a vertex (an edge). A dacard (da-ecard)...
A vertex-deleted subgraph of a graphG is a card. A dacard consists of a card and the degree of the m...
AbstractA card of a graph G is a subgraph formed by deleting one vertex. The Reconstruction Conjectu...
An ecard of a graph $G$ is a subgraph formed by deleting an edge. A da-ecard specifies the degree of...
AbstractA card of a graph G is a subgraph formed by deleting one vertex. The Reconstruction Conjectu...
A vertex-deleted subgraph of a graph G is a card. A dacard specifies the degree of the deleted verte...
AbstractA vertex-deleted subgraph (or card) of a graph G is obtained from G by deleting the vertex v...
10 pagesThe deck of a graph $G$ is the multiset of cards $\{G-v:v\in V(G)\}$. Myrvold (1992) showed ...
AbstractHarary's edge reconstruction conjecture states that a graph G=(V,E) with at least four edges...
AbstractA vertex-deleted subgraph (or card) of a graph G is obtained from G by deleting the vertex v...
One of the most important open questions in graph theory is the graph reconstruction conjecture, fir...
AbstractAs a variant of the famous graph reconstruction problem we characterize classes of graphs of...
The deck of a graph G is the multiset of cards. Myrvold (1992) showed that the degree sequence of a ...
The rupture degree of an incomplete connected graph G is defined by r(G) = max {w (G -S) - |S|m (G -...
The edge reconstruction number of a graph G, RN(G), is the minimum number of edge deleted subgraphs ...
A card (ecard) of a graph G is a subgraph formed by deleting a vertex (an edge). A dacard (da-ecard)...
A vertex-deleted subgraph of a graphG is a card. A dacard consists of a card and the degree of the m...
AbstractA card of a graph G is a subgraph formed by deleting one vertex. The Reconstruction Conjectu...
An ecard of a graph $G$ is a subgraph formed by deleting an edge. A da-ecard specifies the degree of...
AbstractA card of a graph G is a subgraph formed by deleting one vertex. The Reconstruction Conjectu...
A vertex-deleted subgraph of a graph G is a card. A dacard specifies the degree of the deleted verte...
AbstractA vertex-deleted subgraph (or card) of a graph G is obtained from G by deleting the vertex v...
10 pagesThe deck of a graph $G$ is the multiset of cards $\{G-v:v\in V(G)\}$. Myrvold (1992) showed ...
AbstractHarary's edge reconstruction conjecture states that a graph G=(V,E) with at least four edges...
AbstractA vertex-deleted subgraph (or card) of a graph G is obtained from G by deleting the vertex v...
One of the most important open questions in graph theory is the graph reconstruction conjecture, fir...
AbstractAs a variant of the famous graph reconstruction problem we characterize classes of graphs of...
The deck of a graph G is the multiset of cards. Myrvold (1992) showed that the degree sequence of a ...
The rupture degree of an incomplete connected graph G is defined by r(G) = max {w (G -S) - |S|m (G -...
The edge reconstruction number of a graph G, RN(G), is the minimum number of edge deleted subgraphs ...