Consider
cycle graph [C.sub.3], complete graph [K.sub.4] and diamond graph D and certain links are depicted in Figure 1.
* The
cycle graph [C.sub.2k+1] , k [greater than or equal to] 1 is a circular complete graph with p = 2k + 1 and q = k.
* The
cycle graph [C.sub.2k+1], k [greater than or equal to] 1 is a circular complete graph with p = 2k + 1 and q = k.
We relate radio number of dublicated
cycle graph with the radio number number of cycle as follows.
Note that path graph, [P.sub.n], has n - 1 edges and can be obtained from
cycle graph, [C.sub.n], by removing any edge.
Note that path graph, [P.sub.n], has n - 1 edges and can be obtained from a
cycle graph, [C.sub.n], by removing any edge.
If [C.sub.n] is a
cycle graph then the middle graph of the
cycle graph M ([C.sub.n]) is strongly multiplicative.
The tadpole graph Tn k [13] is the graph obtained by joining a
cycle graph [C.sub.n] to a path of length k.
(i) For the
cycle graph, [C.sub.n], n [greater than or equal to] 3, [mu][C.sub.n] = 2, [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII]
In matrix population models, the basic units are classes, i.e., groups of individuals with similar demography (noes in the life
cycle graph).
Denote by [C.sub.n] the
cycle graph with n vertices; [C.sub.3] is also called a triangle.