- Tytuł:
- Iterated neighborhood graphs
- Autorzy:
-
Sonntag, Martin
Teichert, Hanns-Martin - Powiązania:
- https://bibliotekanauki.pl/articles/743216.pdf
- Data publikacji:
- 2012
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
neighborhood graph
2-step graph
neighborhood completeness number - Opis:
-
The neighborhood graph N(G) of a simple undirected graph G = (V,E) is the graph $(V,E_N)$ where $E_N$ = {{a,b} | a ≠ b, {x,a} ∈ E and {x,b} ∈ E for some x ∈ V}. It is well-known that the neighborhood graph N(G) is connected if and only if the graph G is connected and non-bipartite.
We present some results concerning the k-iterated neighborhood graph $N^k(G) : = N(N(...N(G)))$ of G. In particular we investigate conditions for G and k such that $N^k(G)$ becomes a complete graph. - Źródło:
-
Discussiones Mathematicae Graph Theory; 2012, 32, 3; 403-417
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł