Degree Associated Edge Reconstruction Number of Graphs with Regular Pruned Graph
An ecard of a graph $G$ is a subgraph formed by deleting an edge. A da-ecard specifies the degree of the deleted edge along with the ecard. The degree associated edge reconstruction number of a graph $G,~dern(G),$ is the minimum number of da-ecards that uniquely determines $G.$ The adversary degree...
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Artigo |
| Lingua: | Inglês |
| Pubblicazione: |
Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia
2015-10-01
|
| Serie: | Electronic Journal of Graph Theory and Applications |
| Soggetti: | |
| Accesso online: | http://www.ejgta.org/index.php/ejgta/article/view/61 |
| Tags: |
Nessun Tag, puoi essere il primo ad aggiungerne!!
|