The Detour Monophonic Convexity Number of a Graph

Autor:	M Sivabalan, S Sundar Raj, V Nagarajan
Jazyk:	angličtina
Rok vydání:	2022
Předmět:	convex detour chord detour monophonic path monophonic convexity number detour monophonic convexity number. Mathematics QA1-939 Probabilities. Mathematical statistics QA273-280
Zdroj:	Ratio Mathematica, Vol 44, Iss 0, Pp 302-308 (2022)
Druh dokumentu:	article
ISSN:	1592-7415 2282-8214
DOI:	10.23755/rm.v44i0.918
Popis:	A set is detour monophonic convexif The detour monophonic convexity number is denoted by is the cardinality of a maximum proper detour monophonic convex subset of Some general properties satisfied by this concept are studied. The detour monophonic convexity number of certain classes of graphs are determined. It is shown that for every pair of integers and with there exists a connected graph such that and , where is the monophonic convexity number of G
Databáze:	Directory of Open Access Journals
Externí odkaz:	https://doaj.org/article/a9497565d30b4e83a58294455cc36713 Zobrazit plný text záznamu View record in DOAJ