Zobrazeno 1 - 10
of 75
pro vyhledávání: '"K. GANESAMOORTHY"'
Autor:
P. Titus, K. Ganesamoorthy
Publikováno v:
Transactions on Combinatorics, Vol 10, Iss 4, Pp 201-211 (2021)
For a connected graph $G=(V,E)$ of order at least two, an edge detour monophonic set of $G$ is a set $S$ of vertices such that every edge of $G$ lies on a detour monophonic path joining some pair of vertices in $S$. The edge detour mon
Externí odkaz:
https://doaj.org/article/a4e960d242384c7e9003087a65bb6a0f
Autor:
A.P. Santhakumaran, K. Ganesamoorthy
Publikováno v:
Ural Mathematical Journal, Vol 5, Iss 2 (2019)
For a connected graph \(G\) of order at least two, a double monophonic set \(S\) of a graph \(G\) is a restrained double monophonic set if either \(S=V\) or the subgraph induced by \(V-S\) has no isolated vertices. The minimum cardinality of a restra
Externí odkaz:
https://doaj.org/article/2bfb5509500644dcb7abe085acedda51
Autor:
P. TITUS, K. GANESAMOORTHY
Publikováno v:
Romanian Journal of Mathematics and Computer Science, Vol 4, Iss 2, Pp 180-188 (2014)
For a connected graph G = (V, E) of order at least three, the monophonic distance d_m(u, v) is the length of a longest u − v monophonic path in G. For subsets A and B of V , the monophonic distance d_m(A, B) is defined as d_m(A, B) = min{d_m(x, y)
Externí odkaz:
https://doaj.org/article/ab90d0baff7040df9a13548e4980217b
Autor:
K. Ganesamoorthy, S. Lakshmi Priya
Publikováno v:
International Journal of Computer Mathematics: Computer Systems Theory. 8:57-66
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e089d53de7f0d77e399113a7663b73af
https://doi.org/10.1080/23799927.2023.2184722
https://doi.org/10.1080/23799927.2023.2184722
Publikováno v:
Proyecciones (Antofagasta). 41:879-890
For a connected graph G = (V, E) of order at least two, a connected restrained monophonic set S of G is a restrained monophonic set such that the subgraph G[S] induced by S is connected. The minimum cardinality of a connected restrained monophonic se
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::92e131443708539ce27c098e80330929
https://doi.org/10.22199/issn.0717-6279-4475
https://doi.org/10.22199/issn.0717-6279-4475
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
International Journal of Computer Mathematics: Computer Systems Theory. 7:6-15
For a connected graph G of order n, a total open monophonic set S of vertices in a graph G is a minimal total open monophonic set if no proper subset of S is a total open monophonic set of G. The u...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b3d16669e03cb29387dd498235f1acd7
https://doi.org/10.1080/23799927.2021.1974568
https://doi.org/10.1080/23799927.2021.1974568
Autor:
K. Ganesamoorthy, D. Jayanthi
Publikováno v:
Discrete Mathematics, Algorithms and Applications. 15
For a connected graph [Formula: see text] of order at least two, a total outer connected geodetic set [Formula: see text] of a graph [Formula: see text] is an outer connected geodetic set such that the subgraph induced by [Formula: see text] has no i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::af86e8ba35e212a837d487bfc537fa22
https://doi.org/10.1142/s1793830922501282
https://doi.org/10.1142/s1793830922501282
Publikováno v:
Proyecciones (Antofagasta) v.40 n.2 2021
SciELO Chile
CONICYT Chile
instacron:CONICYT
SciELO Chile
CONICYT Chile
instacron:CONICYT
For a connected graph G = (V, E) of order at least two, a subset T of a minimum total monophonic set S of G is a forcing total monophonic subset for S if S is the unique minimum total monophonic set containing T . A forcing total monophonic subset fo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a93dccf7b54c34d6cecf4275c583ca73
https://doi.org/10.22199/issn.0717-6279-2021-02-0031
https://doi.org/10.22199/issn.0717-6279-2021-02-0031