Zobrazeno 1 - 10
of 107
pro vyhledávání: '"Indra Rajasingh"'
Publikováno v:
Discrete Mathematics Letters, Vol 7, Pp 74-78 (2021)
Externí odkaz:
https://doaj.org/article/5ae23e9498bc41438f65e39cca0d80e2
Publikováno v:
Mathematics, Vol 10, Iss 8, p 1263 (2022)
Domination in graphs has been extensively studied and adopted in many real life applications. The monitoring electrical power system is a variant of a domination problem called power domination problem. Another variant is the zero forcing problem. De
Externí odkaz:
https://doaj.org/article/86be19c03e9749ccb56a74488fc1791d
Autor:
G. Kirithiga Nandini, R. Sundara Rajan, A. Arul Shantrinal, T. M. Rajalaxmi, Indra Rajasingh, Krishnan Balasubramanian
Publikováno v:
Symmetry, Vol 12, Iss 12, p 1992 (2020)
Severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2) has caused the global pandemic, coronavirus disease-2019 (COVID-19) which has resulted in 60.4 million infections and 1.42 million deaths worldwide. Mathematical models as an integral part
Externí odkaz:
https://doaj.org/article/1d59863997be4c259e86f849a9289fb3
Publikováno v:
Theoretical Computer Science. 932:21-30
Consider an information diffusion process on a graph $G$ that starts with $k>0$ burnt vertices, and at each subsequent step, burns the neighbors of the currently burnt vertices, as well as $k$ other unburnt vertices. The \emph{$k$-burning number} of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::639200078344dd67bd63896f29d271ef
https://doi.org/10.1016/j.tcs.2022.08.001
https://doi.org/10.1016/j.tcs.2022.08.001
Publikováno v:
International Journal of Computer Mathematics: Computer Systems Theory. 6:209-219
Graph is a mathematical model represented by points and lines joining certain pairs of points. These points are addressed as vertices or nodes and the lines are addressed as edges or links. Graph e...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4e2226348890f068eb7cc0b40ec97a48
https://doi.org/10.1080/23799927.2021.1963999
https://doi.org/10.1080/23799927.2021.1963999
Autor:
T. M. Rajalaxmi, Indra Rajasingh, R. Sundara Rajan, K. Jagadeesh Kumar, Krishnan Balasubramanian, A. Arul Shantrinal
Publikováno v:
Journal of Mathematical Chemistry
The present study, which is a continuation of the previous paper, augments a recent work on the use of phylogenetic networks. We develop techniques to characterize the topology of various X-trees and binary trees of biological and phylogenetic intere
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::536fde61e3562bf46fe50b536a1ad41a
http://europepmc.org/articles/PMC7914393
http://europepmc.org/articles/PMC7914393
Publikováno v:
International Journal of Computer Mathematics: Computer Systems Theory. 6:143-158
The minimum induced H-packing k-partition number is denoted by i p p H ( G , H ) . The induced H-packing k-partition number denoted by i p p ( G , H ) is defined as i p p ( G , H ) = m i n i p p H ...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8f93d08894f7b98b27c4783f744c9ccb
https://doi.org/10.1080/23799927.2020.1871418
https://doi.org/10.1080/23799927.2020.1871418
Autor:
Indra Rajasingh, J. Anitha
Publikováno v:
Procedia Computer Science. 172:187-192
A effective coloring of the vertices of a graph G starts with an initial subset S of colored vertices, with all residual vertices being uncolored. At each various time interval, a colored vertex with exactly one uncolored adjacent vertex forces this
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1f3526aa844b1666ef119c2ec91f618d
https://doi.org/10.1016/j.procs.2020.05.029
https://doi.org/10.1016/j.procs.2020.05.029
Autor:
Indra Rajasingh, V. Shalini
Publikováno v:
Procedia Computer Science. 172:66-70
A set S of vertices in a graph G is a dominating set if every vertex of G is either in S or in adjacent to some vertex of S. If S is independent, then S is called an independent dominating set. The domination problem is to determine a dominating set
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d9a3492ba80c4bb5d1d83c510fc1008b
https://doi.org/10.1016/j.procs.2020.05.010
https://doi.org/10.1016/j.procs.2020.05.010
Autor:
Indra Rajasingh, R. Stalin Mary
Publikováno v:
Procedia Computer Science. 172:115-121
An important feature of an interconnection network is its ability to efficiently simulate one architecture by another. Such a simulation problem can be mathematically formulated as a graph embedding problem. Although the definition of an embedding is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::feb4485908447c489395435ca324cb20
https://doi.org/10.1016/j.procs.2020.05.017
https://doi.org/10.1016/j.procs.2020.05.017