Kumarappan Kathiresan
Kumarappan Kathiresan has a total of 23 co-authors. Here are the top co-authors by number of shared publications:
- Martin Bača
Department of Applied Mathematics and Informatics, Technical University, 042 00 Košice, Slovakia
4 shared publications C. Parameswaran
Centre for Research and Post Graduate Studies in Mathematics, Ayya Nadar Janaki Ammal College, Sivakasi, India
3 shared publicationsG. Marimuthu
3 shared publicationsKadarkarai Muthugurupackiam
Department of Mathematics Rajah Serfoji Government College Thanjavur-613005 Tamilnadu India
3 shared publicationsR. Gurusamy
Department of Mathematics, Mepco Schlenk Engineering College, Sivakasi 626005, Tamil Nadu, India
2 shared publications- R. Lenin
Centre for Research and Post Graduate Studies in Mathematics, Ayya Nadar Janaki Ammal College, Sivakasi, Tamil Nadu, India
2 shared publications
Latest Publications
- Open Access
- 1 April 2025
- Published by Apex Publishing in Iranian Journal of Mathematical Sciences and Informatics
- Vol. 20 (1) , 125-130
On the Independence Graph of Hamming Graph
The independence graph Ind(G) of a graph G is the graph with vertices as maximum independent sets of G and two vertices are adjacent, if and only if the corresponding maximum independent sets are disjoint. In this work, we find the independence graph of Cartesian product of d copies of complete graphs Kq, which ...
- 1 April 2025
- Published by Apex Publishing in Iranian Journal of Mathematical Sciences and Informatics
- Vol. 20 (1) , 125-130
Open AccessOn the Independence Graph of Hamming Graph
The independence graph Ind(G) of a graph G is the graph with vertices as maximum independent sets of G and two vertices are adjacent, if and only if the corresponding maximum independent sets are disjoint. In this work, we find the independence graph of Cartesian product of d copies of complete graphs Kq, which ...
- Open Access
- 17 March 2025
- Published by Combinatorial Press in Journal of Combinatorial Mathematics and Combinatorial Computing
- Vol. 124, 235-242
The Wiener index of connected tripartite graphs
In this paper, we prove that, the Wiener index of a connected tripartite graph is any natural number except 1, 2, 5, 6 and 11.
- 17 March 2025
- Published by Combinatorial Press in Journal of Combinatorial Mathematics and Combinatorial Computing
- Vol. 124, 235-242
Open AccessThe Wiener index of connected tripartite graphs
In this paper, we prove that, the Wiener index of a connected tripartite graph is any natural number except 1, 2, 5, 6 and 11.
- 1 December 2022
- Published by University Library in Kragujevac in Kragujevac Journal of Mathematics
- Vol. 46 (6) , 895-903
Total Absolute Difference Edge Irregularity Strength of Graphs
Kragujevac Journal of Mathematics is a periodical for mathematics. Requirements for acceptance of papers include originality, scientific significance and clarity of presentation.
- 1 December 2022
- Published by University Library in Kragujevac in Kragujevac Journal of Mathematics
- Vol. 46 (6) , 895-903
Total Absolute Difference Edge Irregularity Strength of Graphs
Kragujevac Journal of Mathematics is a periodical for mathematics. Requirements for acceptance of papers include originality, scientific significance and clarity of presentation.
- 28 February 2022
- Published by Springer Nature in Indian Journal of Pure and Applied Mathematics
- Vol. 53 (2) , 301-303
Wiener index of generalized odd complete graphs
- 28 February 2022
- Published by Springer Nature in Indian Journal of Pure and Applied Mathematics
- Vol. 53 (2) , 301-303
Wiener index of generalized odd complete graphs
- Open Access
- 30 October 2020
- Published by The Institute for Research and Community Services (LPPM) ITB in Electronic Journal of Graph Theory and Applications
- Vol. 8 (2) , 435-443
Modular irregularity strength of graphs
We introduce a modular irregularity strength of graphs as modification of the well-known irregularity strength. We obtain some estimation on modular irregularity strength and determine the exact values of this parameter for five families of graphs.
- 30 October 2020
- Published by The Institute for Research and Community Services (LPPM) ITB in Electronic Journal of Graph Theory and Applications
- Vol. 8 (2) , 435-443
Open AccessModular irregularity strength of graphs
We introduce a modular irregularity strength of graphs as modification of the well-known irregularity strength. We obtain some estimation on modular irregularity strength and determine the exact values of this parameter for five families of graphs.
- Open Access
- 14 October 2019
- Published by The Institute for Research and Community Services (LPPM) ITB in Electronic Journal of Graph Theory and Applications
- Vol. 7 (2) , 225-233
On the Steiner antipodal number of graphs
On the Steiner antipodal number of graphs
- 14 October 2019
- Published by The Institute for Research and Community Services (LPPM) ITB in Electronic Journal of Graph Theory and Applications
- Vol. 7 (2) , 225-233
Open AccessOn the Steiner antipodal number of graphs
On the Steiner antipodal number of graphs
- Open Access
- 1 August 2019
- Published by Taylor & Francis in AKCE International Journal of Graphs and Combinatorics
- Vol. 16 (2) , 125-144
A generalization of magic and antimagic labelings of graphs
A k-magic labeling of a finite, simple graph with |V(G)|=p <!--mathContainer--> <!--Loading Mathjax--> and |E(G)|=q, <!--mathContainer--> <!--Loading Mathjax--> is a bijection from the set of edges into the integers {1,2,3,…,q} <!--mathContainer--> <!--Loading Mathjax--> such that the vertex set V <!--mathContainer--> <!--Loading Mathjax--> can be partitioned into k <!--mathContainer--> <!--Loading Mathjax--> sets V1,V2,V3,…,Vk,1≤k≤p, <!--mathContainer--> <!--Loading Mathjax--> and each vertex in the set Vi <!--mathContainer--> <!--Loading Mathjax--> has the same vertex sum and any two distinct vertices in different sets have different vertex sum, where a vertex sum is the sum of the labels of all edges incident with that vertex. A graph is called k-magic if it has k <!--mathContainer--> <!--Loading Mathjax--> -magic labeling, for some k <!--mathContainer--> <!--Loading Mathjax--> , 1≤k≤p. <!--mathContainer--> <!--Loading Mathjax--> The study of k <!--mathContainer--> <!--Loading Mathjax--> -magic labeling is interesting, since all magic graphs are 1-magic and all antimagic graphs are p <!--mathContainer--> <!--Loading Mathjax--> -magic. In this paper, we discuss the k <!--mathContainer--> <!--Loading Mathjax--> -magicness of the Complete bipartite graph Kp,p, <!--mathContainer--> <!--Loading Mathjax--> where 1≤k≤2p. <!--mathContainer--> <!--Loading Mathjax-->- 1 August 2019
- Published by Taylor & Francis in AKCE International Journal of Graphs and Combinatorics
- Vol. 16 (2) , 125-144
Open AccessA generalization of magic and antimagic labelings of graphs
A k-magic labeling of a finite, simple graph with |V(G)|=p <!--mathContainer--> <!--Loading Mathjax--> and |E(G)|=q, <!--mathContainer--> <!--Loading Mathjax--> is a bijection from the set of edges into the integers {1,2,3,…,q} <!--mathContainer--> <!--Loading Mathjax--> such that the vertex set V <!--mathContainer--> <!--Loading Mathjax--> can be partitioned into k <!--mathContainer--> <!--Loading Mathjax--> sets V1,V2,V3,…,Vk,1≤k≤p, <!--mathContainer--> <!--Loading Mathjax--> and each vertex in the set Vi <!--mathContainer--> <!--Loading Mathjax--> has the same vertex sum and any two distinct vertices in different sets have different vertex sum, where a vertex sum is the sum of the labels of all edges incident with that vertex. A graph is called k-magic if it has k <!--mathContainer--> <!--Loading Mathjax--> -magic labeling, for some k <!--mathContainer--> <!--Loading Mathjax--> , 1≤k≤p. <!--mathContainer--> <!--Loading Mathjax--> The study of k <!--mathContainer--> <!--Loading Mathjax--> -magic labeling is interesting, since all magic graphs are 1-magic and all antimagic graphs are p <!--mathContainer--> <!--Loading Mathjax--> -magic. In this paper, we discuss the k <!--mathContainer--> <!--Loading Mathjax--> -magicness of the Complete bipartite graph Kp,p, <!--mathContainer--> <!--Loading Mathjax--> where 1≤k≤2p. <!--mathContainer--> <!--Loading Mathjax--> - 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}.
- Open Access
- 27 September 2017
- Published by University of Calgary in Contributions to Discrete Mathematics
- Vol. 12 (1)
STAR SUPER EDGE MAGIC DEFICIENCY OF GRAPHS
A graph G is called edge - magic if there is a bijec-tive function f : V (G)∪E(G) → {1, 2, . . . , |V (G)|+|E(G)|} such that for every edge xy ∈ E(G), f(x) + f(xy) + f(y) = c is a con-stant, called the valence of f. A graph G is said to be super edge - magic if f(V (G)) = {1, 2, . . . , |V (G)|}. Let G be a graph with p vertices with V (G) = {v1, v2, . . . , vp}. In G, every vertex vi is identified to the center vertex of Smi , for some mi ≥ 0, 1 ≤ i ≤ n, where S0 = K1 and the graph is denoted by G(m1,m2,...,mp). Let M(G) = {(m1,m2, . . . ,mp)|G(m1,m2,...,mp) is a super edge magic graph }. The star super edge magic deficiency Sμ∗(G) is defined as Sμ∗(G) = min(m1,,m2,...,mp)(m1 + m2 + · · · + mp) if M(G) 6= ∅; +∞ if M(G) = ∅. In this paper we determine the star super edge magic deficiency of certain classes of graphs.
- 27 September 2017
- Published by University of Calgary in Contributions to Discrete Mathematics
- Vol. 12 (1)
Open AccessSTAR SUPER EDGE MAGIC DEFICIENCY OF GRAPHS
A graph G is called edge - magic if there is a bijec-tive function f : V (G)∪E(G) → {1, 2, . . . , |V (G)|+|E(G)|} such that for every edge xy ∈ E(G), f(x) + f(xy) + f(y) = c is a con-stant, called the valence of f. A graph G is said to be super edge - magic if f(V (G)) = {1, 2, . . . , |V (G)|}. Let G be a graph with p vertices with V (G) = {v1, v2, . . . , vp}. In G, every vertex vi is identified to the center vertex of Smi , for some mi ≥ 0, 1 ≤ i ≤ n, where S0 = K1 and the graph is denoted by G(m1,m2,...,mp). Let M(G) = {(m1,m2, . . . ,mp)|G(m1,m2,...,mp) is a super edge magic graph }. The star super edge magic deficiency Sμ∗(G) is defined as Sμ∗(G) = min(m1,,m2,...,mp)(m1 + m2 + · · · + mp) if M(G) 6= ∅; +∞ if M(G) = ∅. In this paper we determine the star super edge magic deficiency of certain classes of graphs.
- 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.