NeighborhoodGraph[g,v]
グラフ g の頂点 v のグラフ近傍を与える.
NeighborhoodGraph[g,{a1,a2,…}]
aiのグラフ近傍を与える.aiは g の頂点,辺,部分グラフのいずれでもよい.
NeighborhoodGraph[g,patt]
パターン patt にマッチする頂点と辺のグラフ近傍を与える.
NeighborhoodGraph[g,…,d]
距離 d までの近傍を与える.
NeighborhoodGraph[{vw,…},…]
規則 vw を使ってグラフ g を指定する.
NeighborhoodGraph
NeighborhoodGraph[g,v]
グラフ g の頂点 v のグラフ近傍を与える.
NeighborhoodGraph[g,{a1,a2,…}]
aiのグラフ近傍を与える.aiは g の頂点,辺,部分グラフのいずれでもよい.
NeighborhoodGraph[g,patt]
パターン patt にマッチする頂点と辺のグラフ近傍を与える.
NeighborhoodGraph[g,…,d]
距離 d までの近傍を与える.
NeighborhoodGraph[{vw,…},…]
規則 vw を使ってグラフ g を指定する.
詳細とオプション
- 頂点 v の近傍グラフは v に隣接する頂点とそれに接合する辺によって与えられる.
- 辺 e の近傍グラフは e の頂点の近傍グラフである.
- 部分グラフ h の近傍グラフは h 内の頂点の近傍グラフである.
- 距離 d の近傍グラフは距離 d-1にある近傍グラフの頂点の近傍グラフである.
- d のデフォルト値は1である.
- NeighborhoodGraphは,無向グラフ,有向グラフ,多重グラフ,混合グラフに使うことができる.
例題
すべて開く すべて閉じる例 (2)
g = PetersenGraph[5, 2]HighlightGraph[g, {NeighborhoodGraph[g, 1], Labeled[1, 1]}]HighlightGraph[g, {NeighborhoodGraph[g, {1, 2}], Labeled[#, #]& /@ {1, 2}}]GridGraph[{4, 4}]Table[HighlightGraph[%, NeighborhoodGraph[%, 1, k]], {k, 4}]スコープ (8)
NeighborhoodGraphは無向グラフに使うことができる:
GridGraph[{3, 4}, VertexSize -> {1 -> 0.2, 11 -> 0.2}]HighlightGraph[%, NeighborhoodGraph[%, {1, 11}]]g = [image];HighlightGraph[g, NeighborhoodGraph[g, {1, 11}]]g = [image];HighlightGraph[g, NeighborhoodGraph[g, {1, 11}]]g = [image];HighlightGraph[g, NeighborhoodGraph[g, {1, 11}]]NeighborhoodGraphは頂点に使うことができる:
g = GridGraph[{5, 5}]HighlightGraph[g, NeighborhoodGraph[g, 1]]HighlightGraph[g, NeighborhoodGraph[g, 16]]g = {1 -> 2, 1 -> 3, 2 -> 4, 3 -> 4, 3 -> 5, 4 -> 6, 5 -> 6};HighlightGraph[g, NeighborhoodGraph[g, 1]]g = PetersenGraph[5, 2]NeighborhoodGraph[g, _ ? ((# < 3)&)]NeighborhoodGraphは大きいグラフに使うことができる:
g = GridGraph[{10, 10, 10, 10}];NeighborhoodGraph[g, 1];//Timingアプリケーション (2)
CompleteGraph中の頂点からの近傍をハイライトする:
g = CompleteGraph[8, VertexSize -> {1 -> 0.2}];HighlightGraph[g, NeighborhoodGraph[g, 1]]g = CycleGraph[8, VertexSize -> {1 -> 0.2}];HighlightGraph[g, NeighborhoodGraph[g, 1]]g = StarGraph[8, VertexSize -> {1 -> 0.2}];HighlightGraph[g, NeighborhoodGraph[g, 1]]v = {1, 15, 18};g = GridGraph[{6, 6}, VertexSize -> 0.2];HighlightGraph[g, MapThread[Style[NeighborhoodGraph[g, #1], #2]&, {{1, 15, 18}, {Blue, Red, Green}}]]g = CompleteKaryTree[3, 3, VertexSize -> {1 -> 0.2}];HighlightGraph[g, NeighborhoodGraph[g, 1]]g = PathGraph[Range[20], VertexSize -> 0.2];HighlightGraph[g, MapThread[Style[NeighborhoodGraph[g, #1], #2]&, {{1, 6, 20}, {Blue, Red, Green}}]]g = RandomGraph[{10, 20}, VertexSize -> {1 -> 0.3}];HighlightGraph[g, NeighborhoodGraph[g, 1]]Manipulate[HighlightGraph[GridGraph[{5, 5}], NeighborhoodGraph[GridGraph[{5, 5}], i]], {i, 1, 25, 1}]特性と関係 (2)
Subgraphを使って頂点集合の近傍グラフを求める:
g = GridGraph[{8, 12}]v = {28, 36, 37, 43};nbg = Subgraph[g, Join[v, AdjacencyList[g, v]]];HighlightGraph[g, nbg, GraphHighlightStyle -> "DehighlightGray"]NeighborhoodGraph[g, v]CompleteGraph[8]NeighborhoodGraph[%, 1]おもしろい例題 (2)
g = GridGraph[{50, 75}];NeighborhoodGraph[g, RandomSample[VertexList[g], 35], 1]g = GridGraph[{25, 50}];Subgraph[g, Complement[VertexList[g], VertexList[NeighborhoodGraph[g, RandomSample[VertexList[g], 25], 1]]]]テキスト
Wolfram Research (2010), NeighborhoodGraph, Wolfram言語関数, https://reference.wolfram.com/language/ref/NeighborhoodGraph.html (2015年に更新).
CMS
Wolfram Language. 2010. "NeighborhoodGraph." Wolfram Language & System Documentation Center. Wolfram Research. Last Modified 2015. https://reference.wolfram.com/language/ref/NeighborhoodGraph.html.
APA
Wolfram Language. (2010). NeighborhoodGraph. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/ref/NeighborhoodGraph.html
BibTeX
@misc{reference.wolfram_2026_neighborhoodgraph, author="Wolfram Research", title="{NeighborhoodGraph}", year="2015", howpublished="\url{https://reference.wolfram.com/language/ref/NeighborhoodGraph.html}", note=[Accessed: 03-November-2026]}
BibLaTeX
@online{reference.wolfram_2026_neighborhoodgraph, organization={Wolfram Research}, title={NeighborhoodGraph}, year={2015}, url={https://reference.wolfram.com/language/ref/NeighborhoodGraph.html}, note=[Accessed: 03-November-2026]}