Vertex Triangle Free Detour Number of a Graph
| Autor: | S Sethu Ramalingam, I Keerthi Asir, S Athisayanathan |
|---|---|
| Rok vydání: | 2016 |
| Předmět: | |
| Zdroj: | Mapana - Journal of Sciences. 15:9-24 |
| ISSN: | 0975-3303 |
| DOI: | 10.12723/mjs.38.2 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|