Hostname: page-component-745bb68f8f-d8cs5 Total loading time: 0 Render date: 2025-01-26T21:28:25.675Z Has data issue: false hasContentIssue false
  • English
  • Français

Graphs with near v- and e-neighbourhoods

Published online by Cambridge University Press:  18 May 2009

Dalibor Fronček
Dalibor Fronček
Affiliation:
Department of Mathematics, University of Mining and Metallurgy, Viězného Února, 708 33 Ostrava, Czechoslovakia.
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

All the graphs considered in this paper are connected finite undirected graphs without loops and multiple edges.

By the vertex-neighbourhood (v-neighbourhood) of any vertex x in the graph G we mean the subgraph induced by the set of all vertices adjacent to x. Analogously by the edge-neighbourhood (e-neighbourhood) of any edge f with end vertices x, y we mean the subgraph (f) (or (xy)) induced by the set of all vertices which are adjacent to at least one vertex of the pair x, y and which are different from x, y.

Type
Research Article
Information
Glasgow Mathematical Journal , Volume 32 , Issue 2 , May 1990 , pp. 197 - 199
Copyright
Copyright © Glasgow Mathematical Journal Trust 1990

References

REFERENCES

1.FronCek, D., Graphs with given edge neighbourhoods, Czech. Math. J., 39 (114), 1989, 627–630.CrossRefGoogle Scholar
2.Hell, P., Graphs with given neighborhoods, I, Problimes combinatoires et theorie des graphes, Colloque CNRS, 260, Orsay 1976, 219–223.Google Scholar
3.Nedela, R., Which cycles are edge-realizable?, Czech. Math. J., to appear.Google Scholar
4.Zelinka, B., Edge neighbourhoods graphs, Czech. Math. J., 36 (111), 1986, 44–47.Google Scholar
5.Zykov, A. A., Problem 30, in: Theory of graphs and its applications, Proc. Symp. Smolenice 1963 (Academia Prague 1964).Google Scholar