On a conjecture concerning the reconstruction of graphs

Roger M. Bryant

On a conjecture concerning the reconstruction of graphs

Roger M. Bryant

Research output: Contribution to journal › Article › peer-review

Abstract

Original language	English
Pages (from-to)	139-141
Number of pages	2
Journal	Journal of Combinatorial Theory, Series B
Volume	11
Issue number	2
Publication status	Published - Oct 1971

Cite this

@article{3b239734c5f14827957342dd6069ec87,

title = "On a conjecture concerning the reconstruction of graphs",

abstract = "It is shown that for each positive integer k there are non-isomorphic pendant vertex equivalent graphs with k pendant vertices. {\textcopyright} 1971.",

author = "Bryant, {Roger M.}",

year = "1971",

month = oct,

language = "English",

volume = "11",

pages = "139--141",

journal = "Journal of Combinatorial Theory, Series B",

issn = "0095-8956",

publisher = "Elsevier BV",

number = "2",

}

TY - JOUR

T1 - On a conjecture concerning the reconstruction of graphs

AU - Bryant, Roger M.

PY - 1971/10

Y1 - 1971/10

M3 - Article

SN - 0095-8956

VL - 11

SP - 139

EP - 141

JO - Journal of Combinatorial Theory, Series B

JF - Journal of Combinatorial Theory, Series B

IS - 2

ER -

On a conjecture concerning the reconstruction of graphs

Abstract

Fingerprint

Cite this