Zobrazeno 1 - 10 of 52 pro vyhledávání: '"C Jayasekaran"'
1
Akademický článek
Results on Relatively Prime Domination Number of Vertex Switching of Some Graphs
Autor: A Jancy Vini, C Jayasekaran
Publikováno v: Ratio Mathematica, Vol 48, Iss 0 (2023)
If a set S ⊆ V has at least two members and every pair of vertices u and v is such that (d(u), d(v)) = 1, then it is said to be a relatively prime dominating set. The relatively prime domination number, represented by γrpd(G), is the lowest cardin
Externí odkaz: https://doaj.org/article/797008a34a4b438ba74d9bd1a398e14e
Zobrazit plný text záznamu
2
Akademický článek
Relatively Prime Detour Domination Number of Some Switching Graphs
Autor: C Jayasekaran, L. G. Binoja
Publikováno v: Ratio Mathematica, Vol 48, Iss 0 (2023)
In this paper, we introduce the concept of relatively prime detour domination number for switching graph. If a set S ⊆ V is a detour set, a dominating set with at least two elements, and has (deg(u), deg(v)) = 1 for each pair of vertices u and v, t
Externí odkaz: https://doaj.org/article/c3eb6d9a824e4e04a8b1ba7396a39ed0
Zobrazit plný text záznamu
4
EVEN RADIO MEAN GRACEFUL LABELING ON DEGREE SPLITTING OF SNAKE RELATED GRAPHS
Autor: C. Jayasekaran, C. David Raj, Brindha Mary V. T.
Publikováno v: South East Asian J. of Mathematics and Mathematical Sciences. 18:197-204
A radio mean labeling of a connected graph G is an injection φ from the vertex set V(G) to N such that the condition d(u, v) + & φ(u)+φ(v) 2 ' ≥ 1 + diam(G) holds for any two distinct vertices u and v of G. A graph which admits radio mean labeli
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::ef9899f8d708300cb0848a106dbcef72
https://doi.org/10.56827/seajmms.2022.1802.18
Zobrazit plný text záznamu
6
Some Results on 2-Vertex Switching in Joints
Autor: M. Ashwin Shijo, J. Christabel Sudha, C. Jayasekaran
Publikováno v: Communications in Mathematics and Applications. 12:59-69
For a finite undirected graph \(G(V,E)\) and a non empty subset \(\sigma\subseteq V\), the switching of \(G\) by \(\sigma\) is defined as the graph \(G^{\sigma}(V,E')\) which is obtained from \(G\) by removing all edges between \(\sigma\) and its com
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::2d2502c421925d4efcd091ff8aa6de6b
https://doi.org/10.26713/cma.v12i1.1426
Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání

Omezení vyhledávání
Plný text Recenzováno Digitální knihovna AV ČR
Zdroje