In this paper, by considering Γ ( S M 1 ) [ Γ ( S M 2 ) ], we present some certain results for the diameter, radius, girth, maximum and minimum degrees, and finally chromatic, clique and domination numbers.
Currently, many cohesive measurements have been proposed to ensure the cohesiveness of a community, such as subgraph density [2, 9], minimum degree [11], and subgraph diameter [28].
Consider a connected graph G having order n, radius (r_{G}), diameter (d_{G}), minimum degree δ, and maximum degree Δ, then frac{delta^{delta}}{d_{G}}leqfrac{1}{n}cdotxi^{ac} G) leq frac{Delta^{Delta}}{r_{G}}, (8) and the equality holds iff G is a regular self-centered graph.
There is a widespread opinion that the British empire was obtained and maintained with a minimum degree of force and with maximum co-operation from a grateful local population.
The mean degree is between d and 2 d, the minimum degree is d, and the maximum degree can be as large as n - 1, with n being the number of genes in the network.
Theft and burglary, by contrast, may require a minimum degree of expertise and planning (Wright et al. 1995), though it would be a stretch to describe these as high-skill activities.
In detail, we investigate the diameter, radius, girth, maximum and minimum degree, chromatic number, clique number and domination number for the lexicographic product of any two (not necessarily different) graphs Γ ( S M 1 ) and Γ ( S M 2 ).
As they are representative of samples undergoing the maximum and minimum degree of structural conversion, MndBi3_10y and MndBi10_10y were investigated by TEM to gain further insights into transformation mechanisms.
At each iteration, we only consider neighbors of node with minimum degree in H and use them to expand H.
