Zobrazeno 1 - 10
of 23
pro vyhledávání: '"J. Paulraj Joseph"'
Autor:
J. Paulraj Joseph, N. Shunmugapriya
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 17, Iss 3, Pp 887-891 (2020)
Let be a simple connected graph. An ordered subset W of V is said to be a resolving set of G if every vertex is uniquely determined by its vector of distances to the vertices in W. The minimum cardinality of a resolving set is called the resolving nu
Externí odkaz:
https://doaj.org/article/c6f91525625d4bd6893086bcefcb7072
Autor:
Samuel Issacraj, J. Paulraj Joseph
Publikováno v:
Advances and Applications in Discrete Mathematics. 34:39-55
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f36ca8e24e886ff2d45a648449964f47
https://doi.org/10.17654/0974165822042
https://doi.org/10.17654/0974165822042
Autor:
E. Murugan, J. Paulraj Joseph
Publikováno v:
Discrete Mathematics, Algorithms and Applications. 14
Let [Formula: see text] be a graph. A subset [Formula: see text] of [Formula: see text] is called a dominating set of [Formula: see text] if every vertex not in [Formula: see text] is adjacent to some vertex in [Formula: see text] The domination numb
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6d32c45284001d8d9b8772b05b8d04ea
https://doi.org/10.1142/s1793830922500331
https://doi.org/10.1142/s1793830922500331
A wireless sensor network consists of light-weight, low power, small size sensor nodes. Routing in wireless sensor networks is a demanding task. This demand has led to a number of routing protocols which efficiently utilize the limited resources avai
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::12deae63cd570e6968d92a3166e944ae
Autor:
J. Paulraj Joseph, E. Murugan
Publikováno v:
Discrete Mathematics, Algorithms and Applications. 12:2050068
In this paper, we investigate the upper and lower bounds for the sum of domination number of a graph and its total graph and characterize the extremal graphs.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::84261ac087d38a346bee307c204bfbc7
https://doi.org/10.1142/s1793830920500688
https://doi.org/10.1142/s1793830920500688
Autor:
S. Rosalin, J. Paulraj Joseph
Publikováno v:
Journal of Discrete Mathematical Sciences and Cryptography. 18:887-901
Let G=(V, E) be a simple connected graph. An induced cycle path partition of G is a partition of V (G) into subsets such that the subsets induce cycles and paths. The minimum order taken over all induced cycle path partitions is called the induced cy
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f4b6aa69177c343379a8071072f1e4bb
https://doi.org/10.1080/09720529.2015.1047588
https://doi.org/10.1080/09720529.2015.1047588
Publikováno v:
International Journal of Mathematical Trends and Technology. 13:19-29
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e179b543029509169e8b2f799825ba11
https://doi.org/10.14445/22315373/ijmtt-v13p504
https://doi.org/10.14445/22315373/ijmtt-v13p504
Autor:
J. Paulraj Joseph, M. K. Angel Jebitha
Publikováno v:
Journal of Discrete Mathematical Sciences and Cryptography. 14:279-303
Let G = (V, E) be a simple undirected graph of order n and size m. The transformation graph of G is a simple graph with vertex set V(G) ∪ E (G) in which adjacency is defined as follows: (a) two elements in V(G) are adjacent if and only if they are
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::857f05f5151e36baa1410064f0d169e2
https://doi.org/10.1080/09720529.2011.10698337
https://doi.org/10.1080/09720529.2011.10698337
Autor:
J. Paulraj Joseph, R. Sweetly
Publikováno v:
Journal of Discrete Mathematical Sciences and Cryptography. 12:729-736
Let d(u, v) denote the distance between two distinct vertices of a connected graph G, and diam(G) be the diameter of G. A radio labeling c of G is an assignment of positive integers to the vertices of G satisfying d(u, v) + |c(u) — c(v) | ≥ diam(
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::89adfacfd444f118567d7febfad4023e
https://doi.org/10.1080/09720529.2009.10698268
https://doi.org/10.1080/09720529.2009.10698268
Publikováno v:
Acta Mathematica Hungarica. 125:327-340
\( \mathcal{I}_g \)-normal and \( \mathcal{I}_g \)-regular spaces are introduced and various characterizations and properties are given. Characterizations of normal, mildly normal, g-normal, regular and almost regular spaces are also given.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6cab2150286bdd5cf5829fa32cd69f6e
https://doi.org/10.1007/s10474-009-9027-8
https://doi.org/10.1007/s10474-009-9027-8