𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Degree associated edge reconstruction number of graphs

✍ Scribed by Monikandan, S.; Anusha Devi, P.; Sundar Raj, S.

Book ID
125454041
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
200 KB
Volume
23
Category
Article
ISSN
1570-8667

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Number of edges in degree-magic graphs
Number of edges in degree-magic graphs
✍ BezegovΓ‘, L’udmila; Ivančo, Jaroslav πŸ“‚ Article πŸ“… 2013 πŸ› Elsevier Science 🌐 English βš– 462 KB
The maximum number of edges in a graph w
The maximum number of edges in a graph with fixed edge-degree
✍ R.J. Faudree; J. Sheehan πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 633 KB

Suppose that n i> 2t + 2 (t/> 17). Let G be a graph with n vertices such that its complement is connected and, for all distinct non-adjacent vertices u and v, there are at least t common neighbours. Then we prove that and Furthermore, the results are sharp.

Reconstructibility versus edge reconstru
Reconstructibility versus edge reconstructibility of infinite graphs
✍ Carsten Thomassen πŸ“‚ Article πŸ“… 1978 πŸ› Elsevier Science 🌐 English βš– 151 KB

## RECONgTRUCTIBILITY VERSUI~ EDGE RECONSTR1UCTIBILtlY OF !NF![?CTE GN~APNS Cars,~en -FI-!Ob,~ ASSEN A.hah,,\*~atL~k /~.t;tir~\*., t h~ieersi;e~sp ~tk~'n, S0{P} Aarbus C. Detm~a& Rcc~ .d 23 [;cccm~cr 1~)77 [~Β’ :{>.cd 7 April D)TS For every cm~dma! a >R o ~here exi::ts an ,:t-rQ,',ular .g;api~ w[?

The edge reconstruction of hamiltonian g
The edge reconstruction of hamiltonian graphs
✍ L. Pyber πŸ“‚ Article πŸ“… 1990 πŸ› John Wiley and Sons 🌐 English βš– 305 KB πŸ‘ 1 views

## Abstract If a graph __G__ on __n__ vertices contains a Hamiltonian path, then __G__ is reconstructible from its edge‐deleted subgraphs for __n__ sufficiently large.