Zobrazeno 1 - 10
of 59
pro vyhledávání: '"R. Mary Jeya Jothi"'
Publikováno v:
AIMS Mathematics, Vol 7, Iss 2, Pp 2634-2645 (2022)
Let $ G_1 \square G_2 $ be the Cartesian product of simple, connected and finite graphs $ G_1 $ and $ G_2 $. We give necessary and sufficient conditions for the Cartesian product of graphs to be very strongly perfect. Further, we introduce and charac
Externí odkaz:
https://doaj.org/article/648fe1e102aa4dabbb6715d7d3c47dbc
Publikováno v:
AIMS Mathematics, Vol 7, Iss 2, Pp 2634-2645 (2022)
Let $ G_1 \square G_2 $ be the Cartesian product of simple, connected and finite graphs $ G_1 $ and $ G_2 $. We give necessary and sufficient conditions for the Cartesian product of graphs to be very strongly perfect. Further, we introduce and charac
Autor:
R. Mary Jeya Jothi, R. Revathi
Publikováno v:
Advances in Mathematics: Scientific Journal. 9:1301-1305
Autor:
R. Mary Jeya Jothi, R. Revathi
Publikováno v:
Advances in Mathematics: Scientific Journal. 9:1315-1321
Publikováno v:
Proceeding of First Doctoral Symposium on Natural Computing Research ISBN: 9789813340725
Many fields must define simplified and effective networks to obtain required forms of output. In this paper, the products of a very strongly perfect graph (VSPG) are considered. This paper presents products on connected simple graphs G1 and G2 with n
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8c6d0d40da27c59f1c7be1709feac4b9
https://doi.org/10.1007/978-981-33-4073-2_14
https://doi.org/10.1007/978-981-33-4073-2_14
Publikováno v:
INTERNATIONAL JOURNAL OF MECHANICAL ENGINEERING AND TECHNOLOGY (IJMET). 11
Autor:
R. Mary Jeya Jothi, R. Revathi
Publikováno v:
AIP Conference Proceedings.
Autor:
R. Mary Jeya Jothi, R. Revathi
Publikováno v:
The Journal of Analysis. 27:173-178
A graph G(V, E) with n vertices is said to have modular multiplicative divisor (MMD) labeling if there exist a bijection f:V(G) → {1, 2,…,n} and the induced function f*:E(G) → {0, 1, 2,…,n − 1}where f*(uv) = f(u)f(v)(mod n) for all uv ∊ E
Publikováno v:
Journal of Physics: Conference Series. 1770:012078
Expander graphs are highly connected graphs that have numerous applications in statistical physics, pure mathematics and in computer science. The increased connectivity in expanders are useful to model connections between interconnecting systems whic
Publikováno v:
Journal of Physics: Conference Series. 1770:012081
A graph is SSP (Super Strongly Perfect) if all of its (induced) subgraph H in G obsesses a (minimal dominating set) MDS that link up all of its cliques (maximal) in H. In this paper, SSP Structure along with its parameters (counting of maximal clique