Singaraj Ayyaswamy
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Singaraj Ayyaswamy has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Gopalakrishnan Venkatesh Sivaramakrishnan
Department of Mathematics, School of Arts, Sciences, Humanities and Education, SASTRA Deemed University, Thanjavur, Tamil Nadu, India
4 shared publications - Natarajan Chidambaram
Department of Mathematics, Srinivasa Ramanujan Centre, SASTRA Deemed to be University, Kumbakonam, India
4 shared publications - Raja Balachandar Sevugan
Department of Mathematics, School of Arts, Sciences, Humanities and Education, SASTRA Deemed University, Thanjavur, Tamil Nadu, India
4 shared publications - Selvaraj Balachandran
Sastra university, India
2 shared publications Chidambaram Natarajan
Department of Mathematics School of Humanities and Sciences SASTRA Deemed to be University Thanjavur-613 401 Tamilnadu India
1 shared publication- D. Sarala
Department of Mathematics, School of Humanities and Sciences, SASTRA Deemed to be University, Thanjavur, India
1 shared publication
Latest Publications
- 19 February 2020
- Published by Springer Nature in Proceedings of the National Academy of Sciences, India Section A: Physical Sciences
- Vol. 91 (2) , 269-272
On F-index of Certain Generalized Thorny Graphs
- 19 February 2020
- Published by Springer Nature in Proceedings of the National Academy of Sciences, India Section A: Physical Sciences
- Vol. 91 (2) , 269-272
On F-index of Certain Generalized Thorny Graphs
- Open Access
On the Hyper Zagreb index of certain generalized thorn graphs
Let $G=(V,E)$ be a graph with $n$ vertices and $m$ edges. The hyper Zagreb index of $G$, denoted by $HM(G)$, is defined as $HM(G) =\sum\limits_{uv \in E(G)}\left[d_{G}(u)+d_G(v)\right]^{2}$ where $d_G(v)$ denotes the degree of a vertex $v$ in $G$. In this paper we compute the hyper Zagreb index of certain generalized thorn graphs.Open AccessOn the Hyper Zagreb index of certain generalized thorn graphs
Let $G=(V,E)$ be a graph with $n$ vertices and $m$ edges. The hyper Zagreb index of $G$, denoted by $HM(G)$, is defined as $HM(G) =\sum\limits_{uv \in E(G)}\left[d_{G}(u)+d_G(v)\right]^{2}$ where $d_G(v)$ denotes the degree of a vertex $v$ in $G$. In this paper we compute the hyper Zagreb index of certain generalized thorn graphs. - 8 March 2016
- Published by Springer Nature in Computational and Applied Mathematics
- Vol. 37 (1) , 81-98
An efficient approach for solving Klein–Gordon equation arising in quantum field theory using wavelets
- 8 March 2016
- Published by Springer Nature in Computational and Applied Mathematics
- Vol. 37 (1) , 81-98
An efficient approach for solving Klein–Gordon equation arising in quantum field theory using wavelets
- 3 February 2016
- Published by Springer Nature in Journal of Mathematical Chemistry
- Vol. 54 (5) , 1072-1082
A new approach for solving a model for HIV infection of $\mathbf{CD4}^{+}\,\mathbf{T}$ CD 4 + T -cells arising in mathematical chemistry using wavelets- 3 February 2016
- Published by Springer Nature in Journal of Mathematical Chemistry
- Vol. 54 (5) , 1072-1082
A new approach for solving a model for HIV infection of $\mathbf{CD4}^{+}\,\mathbf{T}$ CD 4 + T -cells arising in mathematical chemistry using wavelets- Open Access
- 29 June 2015
- Published by Sociedade Paranaense de Matemática in Boletim da Sociedade Paranaense de Matemática
- Vol. 34 (2) , 99-105
X− Dominating colour transversals in graphs
Let G = (X, Y,E) be a bipartite graph. A X-dominating set D ⊆ X is called a X−dominating colour transversal set of a graph G if D is a transversal of at least one $chi$−partition of G.The minimum cardinal- ity of a X−dominating colour transversal set is called X−dominating colour transversal number and is denoted by $chi_{dct}(G)$. We find the bounds of X−dominating colour transversal number and characterize the graphs attaining the bound.- 29 June 2015
- Published by Sociedade Paranaense de Matemática in Boletim da Sociedade Paranaense de Matemática
- Vol. 34 (2) , 99-105
Open AccessX− Dominating colour transversals in graphs
Let G = (X, Y,E) be a bipartite graph. A X-dominating set D ⊆ X is called a X−dominating colour transversal set of a graph G if D is a transversal of at least one $chi$−partition of G.The minimum cardinal- ity of a X−dominating colour transversal set is called X−dominating colour transversal number and is denoted by $chi_{dct}(G)$. We find the bounds of X−dominating colour transversal number and characterize the graphs attaining the bound. - Open Access
- 1 June 2015
- Published by Walter de Gruyter GmbH in Analele ştiinţifice ale Universităţii "Ovidius" Constanţa. Seria Matematică
- Vol. 23 (2) , 187-199
Hop Domination in Graphs-II
Let G = (V;E) be a graph. A set S ⊂ V (G) is a hop dominating set of G if for every v ∈ V - S, there exists u ∈ S such that d(u; v) = 2. The minimum cardinality of a hop dominating set of G is called a hop domination number of G and is denoted by γ h (G). In this paper we characterize the family of trees and unicyclic graphs for which γ h (G) = γ t (G) and γ h (G) = γ c (G) where γ t (G) and γ c (G) are the total domination and connected domination numbers of G respectively. We then present the strong equality of hop domination and hop independent domination numbers for trees. Hop domination numbers of shadow graph and mycielskian graph of graph are also discussed.
- 1 June 2015
- Published by Walter de Gruyter GmbH in Analele ştiinţifice ale Universităţii "Ovidius" Constanţa. Seria Matematică
- Vol. 23 (2) , 187-199
Open AccessHop Domination in Graphs-II
Let G = (V;E) be a graph. A set S ⊂ V (G) is a hop dominating set of G if for every v ∈ V - S, there exists u ∈ S such that d(u; v) = 2. The minimum cardinality of a hop dominating set of G is called a hop domination number of G and is denoted by γ h (G). In this paper we characterize the family of trees and unicyclic graphs for which γ h (G) = γ t (G) and γ h (G) = γ c (G) where γ t (G) and γ c (G) are the total domination and connected domination numbers of G respectively. We then present the strong equality of hop domination and hop independent domination numbers for trees. Hop domination numbers of shadow graph and mycielskian graph of graph are also discussed.
- Open Access
- 1 March 2015
- Published by Universidad Catolica del Norte - Chile in Proyecciones (Antofagasta)
- Vol. 34 (1) , 69-83
State analysis of time-varying singular nonlinear systems using Legendre wavelets
In this paper, the Legendre wavelet method for State analysis of time-varying singular nonlinear systems is studied. The properties of Legendre wavelets and its operational matrices are first presented and then are used to convert into algebraic equations. Also the convergence and error analysis for the proposed technique have been discussed. Illustrative examples have been given to demonstrate the validity and applicability of the technique. The efficiency of the proposed method has been compared with Haar wavelet method and it is observed that the Legendre wavelet method is more convenient than the Haar wavelet method in terms of applicability, efficiency, accuracy, error, and computational effort.
- 1 March 2015
- Published by Universidad Catolica del Norte - Chile in Proyecciones (Antofagasta)
- Vol. 34 (1) , 69-83
Open AccessState analysis of time-varying singular nonlinear systems using Legendre wavelets
In this paper, the Legendre wavelet method for State analysis of time-varying singular nonlinear systems is studied. The properties of Legendre wavelets and its operational matrices are first presented and then are used to convert into algebraic equations. Also the convergence and error analysis for the proposed technique have been discussed. Illustrative examples have been given to demonstrate the validity and applicability of the technique. The efficiency of the proposed method has been compared with Haar wavelet method and it is observed that the Legendre wavelet method is more convenient than the Haar wavelet method in terms of applicability, efficiency, accuracy, error, and computational effort.
- Open Access
- 1 March 2014
- Published by Universidad Catolica del Norte - Chile in Proyecciones (Antofagasta)
- Vol. 33 (1) , 13-23
Some characterization theorems on dominating chromatic partition-covering number of graphs
Let G = (V, E) be a graph of order n = |V| and chromatic number (G) A dominating set D of G is called a dominating chromatic partition-cover or dcc-set, if it intersects every color class of every X-coloring of G. The minimum cardinality of a dcc-set is called the dominating chromatic partition-covering number, denoted dcc(G). The dcc-saturation number equals the minimum integer i such that every vertex ν ∈ V is contained in a dcc-set of cardinality k.This number is denoted by dccs(G) In this paper we study a few properties ofthese two invariants dcc(G) and dccs(G).
- 1 March 2014
- Published by Universidad Catolica del Norte - Chile in Proyecciones (Antofagasta)
- Vol. 33 (1) , 13-23
Open AccessSome characterization theorems on dominating chromatic partition-covering number of graphs
Let G = (V, E) be a graph of order n = |V| and chromatic number (G) A dominating set D of G is called a dominating chromatic partition-cover or dcc-set, if it intersects every color class of every X-coloring of G. The minimum cardinality of a dcc-set is called the dominating chromatic partition-covering number, denoted dcc(G). The dcc-saturation number equals the minimum integer i such that every vertex ν ∈ V is contained in a dcc-set of cardinality k.This number is denoted by dccs(G) In this paper we study a few properties ofthese two invariants dcc(G) and dccs(G).
- Open Access
- 31 December 2012
- Published by Elsevier in Ain Shams Engineering Journal
- Vol. 3 (4) , 417-422
Legendre approximation solution for a class of higher-order Volterra integro-differential equations
- 31 December 2012
- Published by Elsevier in Ain Shams Engineering Journal
- Vol. 3 (4) , 417-422
Open AccessLegendre approximation solution for a class of higher-order Volterra integro-differential equations
- Open Access
- 1 May 2011
- Published by Universidad Catolica del Norte - Chile in Proyecciones (Antofagasta)
- Vol. 30 (1) , 59-64
On graphs whose chromatic transversal domination number is two
In this paper we characterize the class of trees, block graphs, cactus graphs and cubic graphs for which the chromatic transversal domination number is equal to two.
- 1 May 2011
- Published by Universidad Catolica del Norte - Chile in Proyecciones (Antofagasta)
- Vol. 30 (1) , 59-64
Open AccessOn graphs whose chromatic transversal domination number is two
In this paper we characterize the class of trees, block graphs, cactus graphs and cubic graphs for which the chromatic transversal domination number is equal to two.