GraphPower

उपलब्ध

Graph connecting vertices within a given distance

रूप

GraphPower[g, n]

GraphPower[{v -> w, …}, …]

सत्यापित उदाहरणg = CycleGraph[7]; m = AdjacencyMatrix[g]; {GraphPower[g, 3], SimpleGraph[AdjacencyGraph[Clip[m + m.m + m.m.m]]]} → {Graph[<7>, <21>], SimpleGraph[Graph[<7>, <21>]]}

इसे Qurak पर चलाएँ संदर्भ में खोजें

विषय

Graph Modifications - Operations on Graphs
New In80 Alphabetical Listing - G
Summary Of New Features In143 - Graph Computation
Summary Of New Features In143 - Graph Computation

संबंधित

Graph AdjacencyMatrix GraphComplement GraphDifference GraphIntersection GraphUnion LineGraph DirectedGraph EdgeAdd EdgeDelete EdgeTaggedGraph FindSpanningTree

सभी 6300 फ़ंक्शन · इसे किसी MCP क्लाइंट से उपयोग करें