Upper Vertex Triangle Free Detour Number of a Graph

Autor:	I Keerthi Asir, S Athisayanathan, S Sethu Ramalingam
Rok vydání:	2017
Předmět:	Combinatorics Vertex (graph theory) Computer Science::Social and Information Networks Graph Mathematics
Zdroj:	Mapana - Journal of Sciences. 16:27-40
ISSN:	0975-3303
DOI:	10.12723/mjs.42.3
Popis:	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 triangle free detour number of a graph is found out. Some realization problems, properties related to the upper vertex detour number, the upper vertex detour monophonic number and the upper vertex geodetic number are also studied.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::e374c08ec2c3ed99c08992f8877415e5 https://doi.org/10.12723/mjs.42.3 Zobrazit plný text záznamu