Zobrazeno 1 - 5
of 5
pro vyhledávání: '"I Keerthi Asir"'
Publikováno v:
Mapana - Journal of Sciences. 16:27-40
For a graph G, the x-triangle free detour set, the x-triangle free detour number, the minimal x-triangle free detour set, the upper x-triangle free detour number, are defined and studied. Certain bounds are determined and the relation with the vertex
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e374c08ec2c3ed99c08992f8877415e5
https://doi.org/10.12723/mjs.42.3
https://doi.org/10.12723/mjs.42.3
Publikováno v:
Mapana - Journal of Sciences. 15:9-24
The \emph{$x$-triangle free detour number} $dn_{\triangle f_x}(G)$ of a connected graph $G$ is the minimum order of its $x$-triangle free detour sets and any $x$-triangle free detour set $S_{x} \subseteq V$ of order $dn_{\triangle f_x}(G)$ is a \emph
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::56ca7064bb0a6d52e634bd19e8681ba4
https://doi.org/10.12723/mjs.38.2
https://doi.org/10.12723/mjs.38.2
Autor:
I. Keerthi Asir, S. Athisayanathan
It is shown that the clique-to-clique monophonic center a connected graph does not lie in a single block of G.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::90299ed87a2b5309d2db08bda312fbf8
Autor:
I Keerthi Asir, S Athisayanathan
Publikováno v:
Discrete Mathematics, Algorithms and Applications. :1750004
In this paper, we define the clique-to-vertex [Formula: see text]–[Formula: see text] monophonic path, the clique-to-vertex monophonic distance [Formula: see text], the clique-to-vertex monophonic eccentricity [Formula: see text], the clique-to-ver
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::140397e2d9c121c7dd2029ec230eeb2c
https://doi.org/10.1142/s1793830917500045
https://doi.org/10.1142/s1793830917500045
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.