The Upper Total Triangle Free Detour Number of a Graph
Main Article Content
Abstract
For a connected graph G = (V,E) of order at least two, a total triangle free detour set of a graph G is a triangle free detour set S such that the subgraph G[S] induced by S has no isolated vertices. The minimum cardinality of a total triangle free detour set of G is the total triangle free detour number of G. It is denoted by 〖tdn〗_Δf (G). A total triangle free detour set of cardinality 〖tdn〗_Δf (G) is called 〖tdn〗_Δf- set of G. In this article, the concept of upper total triangle free detour number of a graph G is introduced. It is found that the upper total triangle free detour number differs from total triangle free detour number. The upper total triangle free detour number is found for some standard graphs. Their bounds are determined. Certain general properties satisfied by them are studied.
Article Details
Issue
Section
You are free to:
- Share — copy and redistribute the material in any medium or format for any purpose, even commercially.
- Adapt — remix, transform, and build upon the material for any purpose, even commercially.
- The licensor cannot revoke these freedoms as long as you follow the license terms.
Under the following terms:
- Attribution — You must give appropriate credit , provide a link to the license, and indicate if changes were made . You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.
Notices:
You do not have to comply with the license for elements of the material in the public domain or where your use is permitted by an applicable exception or limitation .
No warranties are given. The license may not give you all of the permissions necessary for your intended use. For example, other rights such as publicity, privacy, or moral rights may limit how you use the material.