e-Realization of double-stars

Research output: Contribution to journalArticlepeer-review


A graph H is called e-realizable if there exists a graph G such that the neighbourhood of any edge of G (i.e. a subgraph of G induced by all vertices adjacent to at least one vertex of this edge) is isomorphic to H. We show which double-stars are e-realizable.

Original languageEnglish (US)
Pages (from-to)399-402
Number of pages4
JournalDiscrete Mathematics
Issue number1-3
StatePublished - Mar 1 1994


Dive into the research topics of 'e-Realization of double-stars'. Together they form a unique fingerprint.

Cite this