Fuzzy super resolving number and resolving number of some special graphs
MetadataShow full item record
CitationShanmugapriya, R. & Jiny D., M. (2021). Fuzzy super resolving number and resolving number of some special graphs. TWMS Journal of Applied and Engineering Mathematics, 11(2), 459-468.
Resolving number of a graph was introduced by Slater in the year 1975, which is used to navigate the position of the robot uniquely in a graph-structured framework. In this paper, we introduce fuzzy super resolving set, fuzzy super resolving number and certain crisp graph with ʹ2nʹ vertices and resolving number ʹnʹ , whose resolving set form a basis for Rⁿ.
SourceTWMS Journal of Applied and Engineering Mathematics
The following license files are associated with this item:
Showing items related by title, author, creator and subject.
Given a bipartite graph G = (L0, L1, E) and a fixed ordering of the nodes in L0, the problem of finding an ordering of the nodes in L1 that minimizes the number of crossings has received much attention in literature. The ...
In this paper, we find the star chromatic number χs for the central graph of prism graph C(Yn), line graph of prism graph L(Yn), middle graph of prism graph M(Yn) and the total graph of prism graph T(Yn) for all n ≥ 3.
Vignesh, Radhakrishnan; Mohan, Sekar; Geetha, Jayabalan; Somasundaram, Kanagasabapathi (Işık University Press, 2020)A total coloring of a graph G is a combination of vertex and edge colorings of G. In other words, is an assignment of colors to the elements of the graph G such that no two adjacent elements (vertices and edges) receive a ...