GraphData

GraphData[name]
给出指定名称的一个图.

GraphData[name,"property"]
给出指定已定义图的指定属性值.

GraphData["class"]
给出指定类的已定义图列表.

GraphData[n]
给出带有 n 个顶点的已定义图列表.

更多信息更多信息

  • 指定图可以采用标准名称,例如 .
  • GraphData[patt] 给出匹配字符模式 patt 的所有图列表.
  • GraphData[] 列出所有标准的已定义的图. GraphData[All] 给出所有可能的图.
  • GraphData[name] 给出一个 Graph 对象.
  • GraphData[{n,i},] 给出带有 n 个顶点的第 i 个图形的数据.
  • GraphData[{"type",id},] 给出标识符 id 的指定类型的数据. 标识符通常是一个整数或整数列表.
  • GraphData[;;n] 给出 n 个顶点的标准图列表.
  • GraphData[m;;n] 给出带有 mn 个顶点的标准图形的列表.
  • GraphData["class",n] 给出带有 n 个顶点的指定类的图列表.
  • GraphData["Classes"] 给出所有支持类的列表.
  • GraphData["Properties"] 给出图可能属性的列表:
  • 基本图形属性包括:
  • "AdjacencyMatrices"all adjacency matrices
    "AdjacencyMatrix"邻接矩阵
    "AdjacencyMatrixCount"number of distinct adjacency matrices
    "DistanceMatrix"距离矩阵
    "EdgeCount"全部边的数量
    "EdgeIndices"每个边的成对顶点
    "EdgeList"使用无向边 () 指定的边
    "EdgeRules"指定顶点连接规则的边
    "FaceCount"面(平面图)的总数
    "FaceIndices"面(平面图)的指数
    "IncidenceMatrix"关联矩阵
    "LaplacianMatrix"拉普拉斯矩阵
    "NormalizedLaplacianMatrix"普通化的拉普拉斯矩阵
    "VertexCount"全部顶点数量
  • 和连接图形有关的属性包括:
  • "AlgebraicConnectivity"second smallest eigenvalue of the Laplacian matrix
    "Connected"连接
    "ConnectedComponentCount"连接元件的数量
    "ConnectedComponentGraphNames"连接元件中的图形名称
    "ConnectedComponentIndices"连接元件的索引
    "Disconnected"非连接
    "EdgeConnectivity"为了断开图表的最低边缘的缺失
    "Triangulated"三角(最大平面)
    "VertexConnectivity"为了断开图表的最小点的缺失
  • 关于图形显示的属性包括:
  • "AllImages"图所有可能布局的图像列表
    "AllVertexCoordinates"所有交替布局的顶点坐标
    "EmbeddingClasses"嵌入式类别标签列表,一个对于一种嵌入式
    "EmbeddingClasses3D"三维嵌入式类别标签列表,一个对于一种三维嵌入式
    "Embeddings""AllVertexCoordinates" 的替换名称
    "Embeddings3D"所有可用三维布局的顶点坐标
    "Image"缺省布局的图像
    "Image3D"三维嵌入图像
    "LabeledImage"带有顶点数的缺省布局的图像
    "VertexCoordinates"缺省布局的顶点坐标
  • 返回 Graph 对象的属性包括:
  • "CanonicalGraph"canonical version of graph that is isomorphic to the original
    "CochromaticGraphs"graphs with the same chromatic polynomial
    "ComplementGraph"补图
    "ConnectedComponentGraphs"连通分量
    "CoresistanceGraphs"具有相同阻力多重集的图
    "CospectralGraphs"具有相同谱函数的图
    "DualGraph"对偶图
    "Graph"图对象
    "Graph3D"graph object with 3D embedding
    "LineGraph"线图
    "LocalGraph"局部图
  • GraphData[name,"property","type"] 给出一组特定图、图像或者嵌入式结构,其中在二维空间内, 可能包括 ;在三维空间内, 可能包括 .
  • 与图的显示相关的符号包括:
  • "Embeddings","type"一个具有某给定类型的嵌入式结构
    "Embeddings3D","type"一个具有某给定类型的三维嵌入式结构
    "Graph","type"一个具有某给定类型的组合(Combinatorica)图
    "Graphs","type"几个具有某给定类型的组合(Combinatorica)图
    "Graph3D","type"3D-embedded graph of a given type
    "Graphs3D","type"3D-embedded graphs of a given type
    "Images","type"具有某给定类型的图像
    "Images3D","type"具有某给定类型的三维图像
  • 对表示图形多项式的纯函数给出的属性包括:
  • "CharacteristicPolynomial"邻近矩阵的特征多项式
    "ChromaticPolynomial"色多项式
    "DetourPolynomial"转向矩阵的特征多项式
    "DistancePolynomial"距离多项式
    "FlowPolynomial"流动多项式
    "IdiosyncraticPolynomial"Tutte 特殊多项式
    "IndependencePolynomial"独立多项式
    "LaplacianPolynomial"拉普拉斯多项式
    "MatchingGeneratingPolynomial"匹配生成多项式
    "MatchingPolynomial"匹配多项式
    "RankPolynomial"秩多项式
    "ReliabilityPolynomial"可靠性多项式
    "SigmaPolynomial"下降阶乘基础的色多项式
    "TuttePolynomial"Tutte 多项式
  • 有关颜色的图像属性包括:
  • "ChromaticallyUnique"没有其他图形共有色多项式
    "ChromaticInvariant"色不变量
    "ChromaticNumber"色数
    "EdgeChromaticNumber"边色数
    "FractionalChromaticNumber"分数色素
    "FractionalEdgeChromaticNumber"分数边色素
    "MinimumVertexColoring"最小顶点着色
    "MinimumEdgeColoring"最小边着色
    "MinimumWeightFractionalColoring"最小权值分数着色
  • 图像指数属性包括:
  • "BalabanIndex"Balaban 指数
    "CyclomaticNumber"移动翻转圈数的最低边数
    "DetourIndex"转向指数
    "HararyIndex"Harary 指数
    "HosoyaIndex"Hosoya 指数
    "KirchhoffIndex"Kirchhoff 指数
    "KirchhoffSumIndex"Kirchhoff 总和指数
    "MolecularTopologicalIndex"分子拓扑(第二 Schultz)指数
    "StabilityIndex"稳定指数
    "TopologicalIndex"拓扑(第一 Schultz)指数
    "WienerIndex"Wiener 指数
    "WienerSumIndex"Wiener 总和指数
    "ZIndex"Z 指数
  • Local graph properties include:
  • "BridgeCount"number of bridges
    "Bridges"移除将使图形断开的边列表
    "IsolatedPoints"vertices of degree 0
    "LeafCount"number of leaves
    "Leaves"vertices of degree 1
  • 全局图形属性包括:
  • "Anarboricity"maximum number of edgedisjoint nonacyclic subgraphs whose union is the original graph
    "Apices"list of vertices whose removal renders the graph planar
    "Arboricity"minimum number of edgedisjoint acyclic subgraphs whose union is the original graph
    "ArticulationVertices"移除将使图形断开的顶点列表
    "Center"顶点指数,图离心率等于半径
    "Circumference"circumference of the graph
    "Coarseness"线不相交非平面子图的最大数目
    "Corank"边数数目减去顶点数目加上连接元素数目
    "CrossingNumber"一个嵌入图形的最小交叉
    "Degrees"每个顶点的度 in vertex order
    "DegreeSequence"vertex degree sorted from smallest to largest
    "DeterminedByResistance"没有其它图像共有相同的电阻多重设定
    "DeterminedBySpectrum"没有其它图形共享频谱
    "DetourMatrix"最长路径距离的矩阵
    "Diameter"图形直径
    "Eccentricities"各顶点离心率
    "Genus"取得平面嵌入的最少步骤
    "Girth"最小循环的长度
    "LaplacianSpectrum"eigenvalues of the Laplacian matrix
    "MaximumLeafNumber"largest number of tree leaves in any spanning trees
    "MaximumVertexDegree"largest vertex degree
    "MeanDistance"顶点之间的平均距离
    "MinimumVertexDegree"smallest vertex degree
    "Periphery"顶点指数,其中图离心率等于直径
    "Radius"radius of the graph
    "Rank"顶点数目减去连接元素数目
    "RectilinearCrossingNumber"嵌入直线的最小交叉数量
    "ResistanceMatrix"单位电阻边上一对顶点之间的电阻
    "Skewness"minimum number of edges whose removal would result in a planar graph
    "SpanningTreeCount"跨越树木的数目
    "Spectrum"邻接矩阵的特征值
    "SpectrumSignature"tallies of adjacency matrix eigenvalues
    "Thickness"并集为原始图形的平面子图形的最小数目
    "ToroidalCrossingNumber"minimum crossings in a toroidal embedding
  • 匹配、团和覆盖相关属性包括:
  • "BicliqueNumber"biclique number
    "BipartiteDimension"bipartite dimension
    "CliqueCoveringNumber"minimum number of maximum cliques needed to cover the vertex set
    "CliqueNumber"number of vertices in a maximum clique
    "ConnectedDominationNumber"smallest possible size of a connected dominating set
    "DominatingSetCount"number of dominating sets
    "DominatingSets"dominating sets
    "DominationNumber"smallest possible size of a dominating set
    "EdgeCoverCount"number of edge covers
    "EdgeCoverNumber"size of the minimum edge cover
    "EdgeCovers"edge covers
    "EdgeIndependenceNumber"size of the largest independent edge set
    "FractionalCliqueNumber"fractional clique number
    "IndependenceNumber"size of the largest independent vertex set
    "IntersectionNumber"intersection number
    "MatchingNumber"degree of the matchinggenerating polynomial
    "MaximalCliqueCount"number of distinct maximal cliques
    "MaximalCliques"maximal cliques
    "MaximalIndependentEdgeSetCount"number of maximal independent edge sets (matchings)
    "MaximalIndependentEdgeSets"maximal independent edge sets (matchings)
    "MaximalIndependentVertexSetCount"number of maximal independent vertex sets
    "MaximalIndependentVertexSets"maximal independent vertex sets
    "MaximumCliqueCount"number of maximum cliques
    "MaximumCliques"maximum cliques
    "MaximumIndependentEdgeSetCount"number of maximum independent edge sets (matchings)
    "MaximumIndependentEdgeSets"maximum independent edge sets (matchings)
    "MaximumIndependentVertexSetCount"number of maximum independent vertex sets
    "MaximumIndependentVertexSets"maximum independent vertex sets
    "MinimumCliqueCoveringCount"number of minimum clique coverings
    "MinimumCliqueCoverings"minimum clique coverings
    "MinimumEdgeCoverCount"number of minimum edge covers (matchings)
    "MinimumEdgeCovers"minimum edge covers (matchings)
    "MinimumVertexCoverCount"number of minimum vertex covers
    "MinimumVertexCovers"minimum vertex covers
    "VertexCoverCount"number of vertex covers
    "VertexCoverNumber"size of a minimum vertex cover
    "VertexCovers"vertex covers
  • 对称性相关属性包括:
  • "ArcTransitivity"s-弧反射图的最大阶数 s
    "AutomorphismCount"顶点同构群的顺序
    "AutomorphismGroup"图同构置换群
    "CayleyGraphGeneratingGroupNames"生成 Cayley 图的群的名称
    "CayleyGraphGeneratingGroups"生成 Cayley 图的
  • 与信息相关的属性包括:
  • "Bandwidth"graph bandwidth
    "Likelihood"probability for graph to be generated by random number and corresponding vertex -subset picking
    "LovaszNumber"Lovász number (estimate of Shannon capacity)
    "Pathwidth"graph pagewidth
    "ShannonCapacity"effective alphabet size in a graphrepresented communication model
    "TreeDepth"tree depth
    "Treewidth"graph treewidth
  • 与路径和圈相关的属性包括:
  • "ChordlessCycles"(simple) cycles with no chords
    "ChordlessCycleSignature"tallies of chordless cycle lengths
    "ComplementOddChordlessCycles"odd chordless cycles of the graph complement
    "ComplementOddChordlessCycleSignature"tallies of lengths of odd chordless cycles of the graph complement
    "CycleSignature"tallies of cycle lengths
    "DirectedCycleCount"number of distinct directed cycles
    "DirectedCycles"lists of directed cycles
    "DirectedEulerianCycleCount"number of distinct directed Eulerian cycles
    "DirectedEulerianCycles"lists of directed Eulerian cycles
    "DirectedHamiltonianCycleCount"number of distinct directed Hamiltonian cycles
    "DirectedHamiltonianCycles"lists of directed Hamiltonian cycles
    "DirectedHamiltonianPathCount"number of distinct directed Hamiltonian paths
    "DirectedHamiltonianPaths"lists of directed Hamiltonian paths
    "DirectedHamiltonianWalkCount"number of distinct directed Hamiltonian walks
    "DirectedHamiltonianWalks"lists of directed Hamiltonian walks
    "FaceSignature"tallies of face lengths
    "HamiltonDecompositions"partitions of edge set into Hamiltonian cycles
    "HamiltonianNumber"length of a shortest Hamiltonian walk
    "LCFSignature"tally of the orders of all possible LCF signatures
    "OddChordlessCycles"chordless cycles of odd length
    "OddChordlessCycleSignature"tallies of numbers of odd chordless cycles by length
    "UndirectedCycleCount"number of distinct undirected (simple) cycles
    "UndirectedCycles"lists of undirected (simple) cycles
    "UndirectedEulerianCycleCount"number of distinct undirected (simple) Eulerian cycles
    "UndirectedEulerianCycles"lists of undirected (simple) Eulerian cycles
    "UndirectedHamiltonianCycleCount"number of distinct undirected (simple) Hamiltonian cycles
    "UndirectedHamiltonianCycles"lists of undirected (simple) Hamiltonian cycles
    "UndirectedHamiltonianPathCount"number of distinct undirected (simple) Hamiltonian paths
    "UndirectedHamiltonianPaths"lists of undirected (simple) Hamiltonian paths
    "UndirectedHamiltonianWalkCount"number of distinct undirected (simple) Hamiltonian walks
    "UndirectedHamiltonianWalks"lists of distinct undirected (simple) Hamiltonian walks
  • 与名称相关的属性包括:
  • "AlternateNames"英文等价名称
    "AlternateStandardNames"标准 Mathematica 等价名称
    "CochromaticGraphNames"共有相同色多项式的图像
    "ComplementGraphName"补充图的名称
    "ConnectedComponentGraphNames"组成连通分量的图
    "CoresistanceGraphNames"空有相同电阻距离多重设定的图像
    "CospectralGraphNames"共同范围的图像
    "DualGraphName"对偶图的名称
    "LineGraphName"线型图的名称
    "LocalGraphName"局部图的名称
    "Name"英文名称
    "Names"英文名和替换名
    "StandardName"标准 Mathematica 名称
    "StandardNames"标准和替换 Mathematica 名称
  • 与符号相关的属性包括:
  • "LCFNotations"基于哈密顿圈的嵌入式结构的图符号
    "Notation"用于图的主要的符号
    "NotationRules"用于指定图的符号的规则
  • GraphData["class"] 给出指定类中已定义的图列表. 根据图的名称 name 是否属于指定类, GraphData[name,"class"] 给出 TrueFalse.
  • GraphData[name,"Classes"] 给出图中相应于 name 的类的列表.
  • 图的基本类包括:
  • "Bipartite"双向 (每条边连接的两个组件)
    "Nonplanar"空间的(需要交叉)
    "Planar"平面的(非交叉)
    "Tree"(非循环)
  • 基于顶点度的类包括:
  • "Cubic"每个顶点度为 3
    "Octic"每个顶点度为 8
    "Quartic"每个顶点度为 4
    "Quintic"每个顶点度为 5
    "Regular"每个顶点的度相同
    "Septic"每个顶点度为 7
    "Sextic"每个顶点度为 6
    "TwoRegular"每个度数为 2 的顶点
  • 基于横向类包括:
  • "Acyclic"非循环
    "AlmostHamiltonian"-node graph with Hamiltonian number
    "Bridged"含有至少一个架接
    "Bridgeless"没有架接
    "Chordal"没有无弦周期
    "Cyclic"含有至少一个循环
    "Eulerian"每条边仅包含一次的封闭循环
    "HamiltonConnected"限制于一个哈密顿(Hamiltonian)路径的成对顶点
    "HamiltonDecomposable"has a partition of its edge set into Hamiltonian cycles
    "Hamiltonian"每个顶点仅包含一次的封闭循环
    "HamiltonLaceable"具有二分式端点的哈密顿连通图
    "HStarConnected"either Hamiltonconnected or Hamiltonlaceable
    "Hypohamiltonian"移除一个顶点的哈密顿(Hamiltonian)图
    "Hypotraceable"可追溯的移除一个顶点的图
    "KempeCounterexample"Kempe的四色演算法的反例
    "MaximallyNonhamiltonian"maximally nonhamiltonian
    "Noneulerian"非 Eulerian
    "Nonhamiltonian"非 Hamiltonian
    "SquareFree"连通 4 圈
    "Traceable"包含一个 Hamiltonian 路径
    "TriangleFree"连通 3 圈
    "Untraceable"不可追溯
  • Classes based on chess boards include:
  • "Antelope"moves of an antelope generalized chess piece
    "Bishop"moves of two (white and black) chess bishops
    "BlackBishop"moves of a chess black bishop
    "Fiveleaper"moves of a fiveleaper generalized chess piece
    "King"moves of a chess king
    "Knight"moves of a chess knight
    "Queen"moves of a chess queen
    "Rook"moves of a chess rook
    "TriangularHoneycombAcuteKnight"moves of an acute knight on a triangular honeycomb chess board
    "TriangularHoneycombBishop"moves of a bishop on a triangular honeycomb chess board
    "TriangularHoneycombKing"moves of a king on a triangular honeycomb chess board
    "TriangularHoneycombObtuseKnight"moves of an obtuse knight on a triangular honeycomb chess board
    "TriangularHoneycombQueen"moves of a queen on a triangular honeycomb chess board
    "TriangularHoneycombRook"moves of a rook on a triangular honeycomb chess board
    "WhiteBishop"moves of a chess white bishop
  • 基于对称和均匀的类包括:
  • "ArcTransitive"指令具有相同环境的成对相邻顶点
    "Asymmetric"非对称
    "Chang"28顶点的强正规
    "DistanceRegular"所有顶点具有相同的距离
    "DistanceTransitive"具有相同距离环境的全部成对顶点
    "EdgeTransitive"所有边具有相同的环境
    "Identity"相同次的自同构群
    "LocallyPetersen"相邻顶点的诱导图总是 Petersen 图
    "Paulus"25 或 26 顶点的强正规
    "Semisymmetric"可传递的边,顶点不可传递
    "StronglyRegular"强正则化
    "Symmetric"边和顶点都可传递
    "Taylor"距离正规数组格式的交点
    "VertexTransitive"所有顶点具有相同的环境
    "WeaklyRegular"正则化,但不强正则化
    "ZeroSymmetric"边分割成运行轨道的顶点传递立方体
    "ZeroTwo"每两个顶点有0个或者2个共同的邻点
  • Classes based on forbidden graphs include:
  • "Beineke"Beineke graph (not a line graph if these are forbidden)
    "Metelsky"Metelsky graph (not a line graph if these are forbidden and )
  • 特殊类包括:
  • "Apex"apex graph
    "Bicolorable"需要两种或更少的顶点色
    "Bicubic"双向的立方
    "Cage"给定周长的最小图
    "Cayley"Cayley 图
    "ClawFree"无爪图
    "Conference"会议图
    "CriticalNonplanar"任何顶点的非平面化和去除产生一个平面图
    "Fullerene"全边界面呈五边或六边的平面立方体
    "Fusene"全边界面呈六边形2-连通平面
    "Imperfect"不完美的图
    "Incidence"配置的关联图
    "Integral"整数组成的范围
    "LCF"用 LCF 符号描述 ( Hamiltonian 立方)
    "Line"线图
    "Local"对于所有顶点是一个局部特殊图的图
    "Moore"带有 Moore 属性的图
    "NoPerfectMatching"has no perfect matching
    "Perfect"优化图
    "PerfectMatching"n/2 顶点有一个相符
    "SelfComplementary"同构的补足
    "SelfDual"同构的双数
    "Snark"Snark 图
    "StronglyPerfect"every induced subgraph H has an independent set meeting all maximal cliques of
    "Toroidal"图可以嵌入在一个 torus 中
    "UnitDistance"可嵌入的单位长度的边
    "WeaklyPerfect"clique number equals chromatic number
    "WellCovered"every minimal vertex cover has the same size
  • 图中心度包括:
  • "BetweennessCentralities"betweenness centralities
    "ClosenessCentralities"紧密中心度
    "DegreeCentralities"顶点度
    "EccentricityCentralities"顶点离心率的倒数
    "EdgeBetweennessCentralities"边中介中心度
    "EigenvectorCentralities"特征向量中心度
    "HITSCentrailities"核心中心度
    "KatzCentralities"Katz 中心度
    "PageRankCentralities"页面排名中心度
    "RadialityCentralities"径向中心度
    "StatusCentralities"状态中心度
  • 与图相关的类包括:
  • "Antiprism"反棱柱的框架
    "Archimedean"13 个阿基米德立体之一的框架
    "ArchimedeanDual"13 个阿基米德对偶之一的框架
    "Platonic"5 个Platonic 立体之一的框架
    "Polyhedral"一个多面体的框架
    "Prism"棱柱的框架
    "RegularPolychoron"6 个正规 4 维立体之一的框架
  • 特别树种包括:
  • "Cactus"连通图,其中任意两个图的圈没有共同的边
    "Caterpillar"顶点在树干的中心或只有一个边远离树干
    "Centipede"顶点和边成梳子状
    "Forest"树集合 ("Acyclic" 相同)
    "Halin"Halin 图
    "Lobster"除去叶子得到毛虫状
    "Pseudoforest"每个连通分量至多包含一个圈
    "Pseudotree"连通伪森林
    "Spider"一个顶点角度在3,其它在角度2
    "Tripod"恰好有三个叶子节点的树
  • 用一个或多个整数标记的图的类型包括:
  • "Apollonian"二维 Apollonian 衬垫的连接图
    "BipartiteKneser"顶点表示 k 子集和 子集
    "Book"星状和 2 路径图的笛卡尔乘积
    "Bouwer"包含对称但非弧传递的成员的规则图
    "Caveman"caveman graph
    "Circulant"n 个顶点,相同的邻接方式
    "Complete"所有连接的成对顶点
    "CompleteBipartite"所有连接的成对顶点
    "CompleteTripartite"横跨两个不相交集合的顶点的所有成对连接
    "Cone"圈图和空图的图联合
    "Crown"完全二部 ,其中水平边被删除
    "Cycle"穿过 n 个顶点的单个圈
    "Cyclotomic"带有相邻顶点的图,如果它们的差是 中的立方
    "Doob"Shrikhande 图和 Hamming 图的笛卡尔乘积
    "Empty"没有边的 n 个顶点
    "Fan"带有路径图的空图的图连接
    "FoldedCube"折叠 n 超立方图
    "Gear"外循环顶点之间附加顶点的轮子
    "GeneralizedPolygon"基于对称二元关系上的入射面
    "Grid"用网格连接的点列表
    "Haar"指数 n 的 Haar (普通两等分)图
    "Hadamard"对应 矩阵的图形满足
    "HalvedCube"半分的 n 超立方图
    "Hamming"大小为 m 完全图的直积
    "Hanoi"Hanoi 图
    "Harary"Harary 图
    "Helm"带有每个循环顶点处连接的吊坠边缘的轮子
    "Hypercube"一个 n 维超立方体
    "IGraph"一个广义 Petersen 图的推广
    "Johnson"描述 n 集合的 m 个子集合间邻接关系的图
    "Keller"Keller graph
    "Kneser"表示 k 个子集的顶点
    "Ladder" 个顶点组成的梯形图
    "LadderRung"n 个两条路径组成的图的交集
    "Lattice"完全二部图 的线图
    "MoebiusLadder"半螺旋状的 n 边棱柱图
    "Mycielski"带有色数 n 的三角自由图
    "Odd"奇图
    "Paley"带有顶点相邻的图,如果它们的差是 中的平方
    "Pan"由一个桥路连接到一个单一图的 n
    "Path"没有分枝的由 n 个顶点组成的树型图
    "PermutationStar"边通过采用 的置换进行对换得到的星图
    "SierpinskiCarpet"connectivity graph of the Sierpiński carpet
    "SierpinskiSieve"connectivity graph of the Sierpiński sieve
    "Square"顶点表示 个有序对
    "StackedBook"一个星图与一个 n 路径图的笛卡尔积
    "Star"中心顶点与 个顶点连接
    "Sun"外围边呈竖立三角的完全图
    "Sunlet"带有吊坠三角形的一个圈
    "Tetrahedral" Johnson 图
    "TorusGrid"花托上的网格图
    "Triangular" Johnson 图
    "TriangularGrid"a triangular grid graph
    "Turan"n 个顶点组成的 Turán 图,其中不含有 ()
    "Wheel"所有顶点都与中心连接的一个圈
    "Windmill"带有一个共同顶点的完全图 m 个副本
  • GraphData[name,"property","ann"]GraphData["property","ann"] 给出一个属性相关的多个注 解. 通常的注解包括:
  • "Description"用较短文字描述特性
    "Information"其它信息的超链接
    "LongDescription"用较长文字描述特性
    "Note"特性的附加信息
    "Value"属性的数值
  • GraphData 需要网络连接.
2007年引入
(6.0)
| 2014年更新
(10.0)