8.6 各顶点的度均相同的图称为(regular graph)。各顶点度均为k 的正则图 称为k- 。 www.docin.com|基于5个网页 3. 正规图 离散数学双语专业词汇表 - 豆丁网 ... complete graph: 完全图regular graph:正规图,正则图 linear graph: 线性图 ... ...
Graph Theory - Regular Graphs - A regular graph is a graph where every vertex has the same number of edges, i.e., each vertex has the same degree. This type of graph has symmetrical properties, making it a useful structure in various areas of graph theor
Let G be a simple graph of order n and let μ be an adjacency eigenvalue with multiplicity k≥1. A star complement H for μ in G is an induced subgraph of order n?k with no eigenvalue μ. In this paper, the regular graphs with the complete multipartite graph sK1∪˙Kt~ (s≥2)...
(0,2)-Graph, Cage Graph, Complete Graph, Completely Regular Graph, Configuration, Cubic Graph, Distance-Regular Graph, Irregular Graph, Local Degree, Moore Graph, Octic Graph, Quartic Graph, Quasi-Regular Graph, Quintic Graph, Septic Graph, Sextic Graph, Strongly Regular Graph, Superregular ...
45 Yuval Peres Coloring a graph arising from a lacunary sequence 59:15 Vojtěch Rödl On two Ramsey type problems for Kt+1-free graphs 47:07 Vilmos Totik Erdős on polynomials And Ben Green The sum-free set constant is ⅓ 1:45:31 Tomasz Łuczak Threshold functions a historical ...
regular polygon- a polygon with all sides and all angles equal isogon- an equiangular polygon foursquare,square- (geometry) a plane rectangle with four equal sides and four right angles; a four-sided regular polygon; "you can compute the area of a square if you know the length of its sid...
ideal solid,Platonic body,Platonic solid,regular convex polyhedron,regular convex solid,regular polyhedron- any one of five solids whose faces are congruent regular polygons and whose polyhedral angles are all congruent Based on WordNet 3.0, Farlex clipart collection. © 2003-2012 Princeton Universit...
The same algorithm was used to search for regular two-graphs on 30 vertices and confirmed that the six found by Arlasarov in the mid 1970s, and later by Bussemaker, Mathon, and Seidel, constitute the complete set. Each regular two-graph on 36 vertices gives rise to a Hadamard matrix ...
Given the relation between the weights of a projective three-weight code and the eigenvalues of the coset graph of its dual, corresponding solutions of Eq. (1) can be easily enumerated. However, not all cases are feasible, i.e., attainable by a projective three-weight code. The aim of ...
作者: RB Bapat 摘要: A graph is said to be regular if all its vertices have the same degree. If the degree of each vertex of G is k, then G is said to be k-regular. Examples of regular graphs include cycles, complete... DOI: 10.1007/978-1-84882-981-7_6 年份: 2010 收藏...