### 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. 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 language | English (US) |
---|---|

Pages (from-to) | 399-402 |

Number of pages | 4 |

Journal | Discrete Mathematics |

Volume | 126 |

Issue number | 1-3 |

DOIs | |

State | Published - Mar 1 1994 |

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

## Cite this

Fronček, D. (1994). e-Realization of double-stars.

*Discrete Mathematics*,*126*(1-3), 399-402. https://doi.org/10.1016/0012-365X(94)90285-2