Total and forcing total edge-to-vertex monophonic number of a graph

John, J; Samundesvari, KU

Samundesvari, KU (reprint author), Noorul Islam Ctr Higher Educ, Dept Math, Kumaracoil 629175, India.

JOURNAL OF COMBINATORIAL OPTIMIZATION, 2018; 35 (1): 134

Abstract

For a connected graph , a set is called a total edge-to-vertex monophonic set of a connected graph G if the subgraph induced by S has no isolated edge......

Full Text Link


Links

期刊讨论 | 中国SCI论文 | 期刊主页 | 投稿经验 | 杂志官网 | 投稿链接 | 作者需知 | PMC链接 | Pubmed全文检索