Abstract
Let G be an undirected simple connected graph, and e = uv be an edge of G. Let N G(e) be the subgraph of G induced by the set of all vertices of G which are not incident to e but are adjacent to u or v. Let N e be the class of all graphs H such that, for some graph G,N G (e) ≅ H for every edge e of G. Zelinka [3] studied edge neighborhood graphs and obtained some special graphs in N e. Balasubramanian and Alsardary [1] obtained some other graphs in N e. In this paper we given some new graphs in N e.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
K. Balasubramanian, Salar Y. Alsardary: On edge neighborhood graphs (Communicated, Dirasat J. of Science).
F. Harary: Graph Theory. Addison Wesley, Reading, Mass., 1969.
B. Zelinka: Edge neighborhood graphs. Czech. Math. J. 36(111) (1986), 44–47.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Ali, A.A., Alsardary, S.Y. New edge neighborhood graphs. Czechoslovak Mathematical Journal 47, 501–504 (1997). https://doi.org/10.1023/A:1022415602169
Issue Date:
DOI: https://doi.org/10.1023/A:1022415602169