R. Lenin
Research Subjects
Research Interests
R. Lenin has a total of 2 co-authors. Here are the top co-authors by number of shared publications:
- Kumarappan Kathiresan
Ayya Nadar Janaki Ammal College
2 shared publications - Martin Bača
Department of Applied Mathematics and Informatics, Technical University, 042 00 Košice, Slovakia
1 shared publication
Latest Publications
- Open Access
- 27 November 2017
- Published by University of Calgary in Contributions to Discrete Mathematics
- Vol. 12 (2)
The Forcing Strong Metric Dimension of a Graph
For any two vertices u, v in a connected graph G, the interval I(u, v) consists of all vertices which are lying in some u − v shortest path in G. A vertex x in a graph G strongly resolves a pair of vertices u, v if either u ∈ I(x, v) or v ∈ I(x, u). A set of vertices W of V (G) is called a strong resolving set if every pair of vertices of G is strongly resolved by some vertex of W. The minimum cardinality of a strong resolving set in G is called the strong metric dimension number of G and it is denoted by sdim(G). For a strong resolving set W of G, a subset S of W is called the forcing subset of W if W is the unique strong resolving set containing S. The forcing number f(W, sdim(G)) of W in G is the minimum cardinality of a forcing subset for W, while the forcing strong metric dimension, fsdim(G), of G is the smallest forcing number among all strong resolving sets of G. The forcing strong metric dimensions of some well-known graphs are determined. It is shown that for any positive integers a and b, with 0 ≤ a ≤ b, there is nontrivial connected graph G with sdim(G) = b and fsdim(G) = a if and only if {a, b} not equal to {0, 1}.
- 27 November 2017
- Published by University of Calgary in Contributions to Discrete Mathematics
- Vol. 12 (2)
Open AccessThe Forcing Strong Metric Dimension of a Graph
For any two vertices u, v in a connected graph G, the interval I(u, v) consists of all vertices which are lying in some u − v shortest path in G. A vertex x in a graph G strongly resolves a pair of vertices u, v if either u ∈ I(x, v) or v ∈ I(x, u). A set of vertices W of V (G) is called a strong resolving set if every pair of vertices of G is strongly resolved by some vertex of W. The minimum cardinality of a strong resolving set in G is called the strong metric dimension number of G and it is denoted by sdim(G). For a strong resolving set W of G, a subset S of W is called the forcing subset of W if W is the unique strong resolving set containing S. The forcing number f(W, sdim(G)) of W in G is the minimum cardinality of a forcing subset for W, while the forcing strong metric dimension, fsdim(G), of G is the smallest forcing number among all strong resolving sets of G. The forcing strong metric dimensions of some well-known graphs are determined. It is shown that for any positive integers a and b, with 0 ≤ a ≤ b, there is nontrivial connected graph G with sdim(G) = b and fsdim(G) = a if and only if {a, b} not equal to {0, 1}.
- 4 July 2017
- Published by Taylor & Francis in Journal of Discrete Mathematical Sciences and Cryptography
- Vol. 20 (5) , 1091-1100
The near geodetic number of a graph
The interval I(u, v) for any two vertices consists of all those vertices lying on a u – v geodesic (shortest path) in G. If S is a set of vertices of G, then I(S) is the union of all sets I(u, v) for u, v ∈ S. The geodetic number g(G) is the minimum cardinality among the subsets S of V(G) with I(S) = V(G). A set S ⊇ V(G) is a near geodetic set if for every v in V(G) – S, there exists some x, y in S with |I(x, y) ∩ N(v)|≥ 2. The near geodetic number gnear(G) is the minimum cardinality of a near geodetic set in G. In this paper, we proved that if G is a graph of order n and clique number w (G), then gnear(G) ≤ n − ω(G) + 2 and this bound is sharp. Further we proved that any positive integers a, b and n, with 2 ≤ a < b ≤ n − 2, there exists a connected graph G of order n with g(G) = a and gnear(G) = b. Also we shown that, for positive integers n,k,l with n − k − l + 2 ≥ 0, 2 ≤ k < n − 1 and 2 ≤ l ≤ n, there exist a connected graph G of order n with clique number ω (G) = 1 and gnear(G) = K.
- 4 July 2017
- Published by Taylor & Francis in Journal of Discrete Mathematical Sciences and Cryptography
- Vol. 20 (5) , 1091-1100
The near geodetic number of a graph
The interval I(u, v) for any two vertices consists of all those vertices lying on a u – v geodesic (shortest path) in G. If S is a set of vertices of G, then I(S) is the union of all sets I(u, v) for u, v ∈ S. The geodetic number g(G) is the minimum cardinality among the subsets S of V(G) with I(S) = V(G). A set S ⊇ V(G) is a near geodetic set if for every v in V(G) – S, there exists some x, y in S with |I(x, y) ∩ N(v)|≥ 2. The near geodetic number gnear(G) is the minimum cardinality of a near geodetic set in G. In this paper, we proved that if G is a graph of order n and clique number w (G), then gnear(G) ≤ n − ω(G) + 2 and this bound is sharp. Further we proved that any positive integers a, b and n, with 2 ≤ a < b ≤ n − 2, there exists a connected graph G of order n with g(G) = a and gnear(G) = b. Also we shown that, for positive integers n,k,l with n − k − l + 2 ≥ 0, 2 ≤ k < n − 1 and 2 ≤ l ≤ n, there exist a connected graph G of order n with clique number ω (G) = 1 and gnear(G) = K.