• Publications
  • Influence
An Analytical Discourse on Strong Edge Coloring for Interference-free Channel Assignment in Interconnection Networks
TLDR
A strong edge coloring of a graph G is a proper edge coloring in which no two edges of the same color lie within distance 2 from each other. Expand
Location Domination for Generalized Friendship Graphs Analytics
Locating defective elements in a processor network brings the motivation for location dominating sets. In this paper, the location dominating set problem for friendship graphs is solved. LocationExpand
Strong Edge Coloring of Some Classes of Unicyclic Graphs
Let G be an undirected simple graph. A strong edge coloring of a graph G is a function f : E → {1, 2, . . . , k} such that f(e1) 6= f(e2) whenever e1 and e2 lie within distance 2 from each other. InExpand
Strong Rainbow Edge Coloring of Some Interconnection Networks
TLDR
This paper investigates the strong rainbow connection numbers of butterfly network, Benes network and torus network. Expand
A Study on Strong Rainbow Vertex-Connection in Some Classes of Generalized Petersen Graphs
TLDR
This paper explores sharp upper bounds for the strong rainbow vertex-connection number of GP graphs P(n,k) for the cases when k|n and n = mk +1, m is a positive integer. Expand
Wireless Networks Analysis based on Graphs with Equal and Strong Proper Connection Number
An edge colored graph is properly colored if there exists a proper path (a path in which two neighboring edges do not acquire identical color) amid every two distinct vertices. Such a graph is calledExpand
Strong rainbow vertex-connection of cubic graphs
TLDR
The rainbow vertex - connection number, rvc(G), of a connected graph is the minimum number of colors needed to color its vertices such that every pair of vertices is connected by at least one path whose internal vertices have distinct colors. Expand
Strong rainbow edge colouring and graph decomposition
TLDR
We find the minimum number of colours required in an edge colouring of a connected graphGin which every pair of vertices is connected by at least one shortest path in which no two edges are coloured the same using subgraph decomposition. Expand
STRONG RAINBOW EDGE-COLOURING OF VARIANTS OF CUBIC HALIN GRAPHS
A non trivial connected graph G = (V,E) is strongly rainbow connected if every two vertices u and v of G are connected by at least one shortest u− v path in which no two edges have same colours. TheExpand
On strong rainbow vertex-coloring of generalized Petersen graphs G(n,2) and G(n,3)
A path in a vertex-colored graph G is called a rainbow path if no two internal vertices get the same color. A vertex-colored graph G is strongly rainbow vertexconnected, if for every pair of distinctExpand