Readability of Some Stariike Trees

D. FronĉEk

doi:10.1016/S0167-5060(08)70609-5

Readability of Some Stariike Trees

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

Abstract

A graph H is called e-realizable if there exists a graph G such that the neighbourhood of any edge of G (i.e. the subgraph of G induced by all vertices adjacent to at least one end vertex of this edge) is isomorphic to H. We show that certain starlike trees (graphs homeomorphic to stars) with short branches are not e-realizable.

Original language	English (US)
Pages (from-to)	81-83
Number of pages	3
Journal	Annals of Discrete Mathematics
Volume	51
Issue number	C
DOIs	https://doi.org/10.1016/S0167-5060(08)70609-5
State	Published - Jan 1 1992
Externally published	Yes

Access

10.1016/S0167-5060(08)70609-5

OpenUrl availability

Full text

Cite this

@article{3b5edd6ef76243bf984d4519e8207570,

title = "Readability of Some Stariike Trees",

abstract = "A graph H is called e-realizable if there exists a graph G such that the neighbourhood of any edge of G (i.e. the subgraph of G induced by all vertices adjacent to at least one end vertex of this edge) is isomorphic to H. We show that certain starlike trees (graphs homeomorphic to stars) with short branches are not e-realizable.",

author = "D. FronĉEk",

year = "1992",

month = jan,

day = "1",

doi = "10.1016/S0167-5060(08)70609-5",

language = "English (US)",

volume = "51",

pages = "81--83",

journal = "Annals of Discrete Mathematics",

issn = "0167-5060",

publisher = "Elsevier",

number = "C",

}

TY - JOUR

T1 - Readability of Some Stariike Trees

AU - FronĉEk, D.

PY - 1992/1/1

Y1 - 1992/1/1

N2 - A graph H is called e-realizable if there exists a graph G such that the neighbourhood of any edge of G (i.e. the subgraph of G induced by all vertices adjacent to at least one end vertex of this edge) is isomorphic to H. We show that certain starlike trees (graphs homeomorphic to stars) with short branches are not e-realizable.

AB - A graph H is called e-realizable if there exists a graph G such that the neighbourhood of any edge of G (i.e. the subgraph of G induced by all vertices adjacent to at least one end vertex of this edge) is isomorphic to H. We show that certain starlike trees (graphs homeomorphic to stars) with short branches are not e-realizable.

UR - http://www.scopus.com/inward/record.url?scp=77957086602&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77957086602&partnerID=8YFLogxK

U2 - 10.1016/S0167-5060(08)70609-5

DO - 10.1016/S0167-5060(08)70609-5

M3 - Article

AN - SCOPUS:77957086602

SN - 0167-5060

VL - 51

SP - 81

EP - 83

JO - Annals of Discrete Mathematics

JF - Annals of Discrete Mathematics

IS - C

ER -

Readability of Some Stariike Trees

Abstract

Access

OpenUrl availability

Other files and links

Fingerprint

Cite this