Programs
- M. Tech. in Automotive Engineering -
- B. Sc. Clinical Nutrition, Dietetics, and Food Science - Undergraduate
Publisher : International Journal of Pure and Applied Mathematics
Source : International Journal of Pure and Applied Mathematics , Volume 120, Number 1, p.67-75 (2018)
Url : https://ijpam.eu/contents/2018-120-1/6/6.pdf
Keywords : detour distance, distances, graphs, uniform number
Campus : Coimbatore
School : School of Engineering
Department : Mathematics
Verified : No
Year : 2018
Abstract : The uniform number of a connected graph G is the least cardinality of a nonempty subset M of the vertex set of G for which the function fM : Mc → P(X) − {∅} defined as fM (x) = {D(x, y) : y ∈ M} is a constant function, where D(x, y) is the detour distance between x and y in G and P(X) is power set of X = {D(xi, xj ) : xi 6= xj}. In this note, we determine the uniform number for the classes of graphs having at least one cycle as its induced subgraph.
Cite this Research Publication : K. Abhishek and Elakkiya, M., “Uniform numbers of cyclic graphs”, International Journal of Pure and Applied Mathematics , vol. 120, pp. 67-75, 2018.