regular graph


Also found in: Wikipedia.

regular graph

[′reg·gə·lər ¦graf]
(mathematics)
A graph whose vertices all have the same degree.

regular graph

(mathematics)
A graph in which all nodes have the same degree.
References in periodicals archive ?
For a regular graph G = (V, E, w) with n vertices such that n [greater than or equal to] 3, we have
The ant colony algorithm, which is a bionic algorithm, is applied herein to the study of the three regular graph coloring problem, in order to gain a more reasonable solution to the problems of coloring and number labeling.
Ali, Families of regular graph with constant metric dimension, Utilitas Mathematica 65(2008),21-33.
Let G = (V (G), E((})) and G' = (V (G'), E(G '))$ be [lambda] and [lambda]' connected regular graphs respectively, then H = G [??] G' is a [lambda] + [lambda]' regular graph and therefore it is a [lambda] + [lambda]' harmonic graph.
A regular graph G has j as an eigenvector and therefore it has only one main eigenvalue, namely, the maximum eigenvalue.
The cocktail party graph CP(n) [17] is a unique regular graph of degree 2n - 2 on 2n vertices.
For example, If G = [W.sub.6], [[gamma].sub.M] (G) = 1 and [d.sub.M] (G) = 6 but [W.sub.6] is not a regular graph.
Sooryanarayana [13]] For every path [P.sub.n], n [greater than or equal to] 3 and an integer t, 1 [less than or equal to] t < n/2, the graph D([P.sub.n], S) is a regular graph whenever S = {t, n - t}.
For n = 1, 2n + 4 = 6.Then the graphical partition 1 + 1 + 1 + 1 + 1 + 1 of 6 gives us a regular graph of degree 1 as shown in the figure (1.1).
Some specific topics examined include a hybrid genetic scheduling strategy, design of an actor-based worm modeling system using DML, a parallel and memory-efficient mean shift filter on a regular graph, and introducing volunteer nodes into P2P live streaming.
The purpose of this paper is to give an example of how to construct a regular graph from an Alphabet Overlap graph.
Thus another difference in the participants' performance with the two types of graphs was that participants were more sensitive to Segment A's difference from the anchor with the regular graph than with the aligned graph.