Vertex Triangle Free Detour Number of a Graph
DOI:
https://doi.org/10.12723/mjs.38.2Abstract
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{$x$-triangle free detour basis} of $G$. A connected graph of order $n$ with vertex triangle free detour number $n-1$ or $n-2$ for every vertex is characterized. Certain general properties satisfied by the vertex triangle free detour sets are studied.
Additional Files
Published
2021-08-28
Issue
Section
Research Articles
License
Copyright (c) 2016 S Sethu Ramalingam, I Keerthi Asir, S Athisayanathan, Ph D
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.