On the connected monophonic number of a graph

IF 0.9 Q3 COMPUTER SCIENCE, THEORY & METHODS

International Journal of Computer Mathematics: Computer Systems Theory Pub Date : 2022-04-03 DOI:10.1080/23799927.2022.2071765

K. Ganesamoorthy, M. Murugan, A. Santhakumaran

引用次数: 7

Abstract

For a connected graph G of order at least two, a connected monophonic set of G is a monophonic set S such that the subgraph induced by S is connected. The minimum cardinality of a connected monophonic set of G is the connected monophonic number of G and is denoted by . The number of extreme vertices and cut-vertices of G is its extreme-cut order . A graph G is an extreme-cut connected monophonic graph if . Some interesting results on the extreme-cut connected monophonic graphs G are studied. For positive integers r, d and with r

查看原文本刊更多论文

图的连通单音数

对于至少为二阶的连通图G, G的连通单音集是单音集S，使得S引出的子图是连通的。G的连通单音集的最小基数是G的连通单音数，表示为。G的极值顶点和切割顶点的个数就是它的极值切割阶数。图G是一个极切连通单音图。研究了关于极切连通单音图G的一些有趣的结果。对于正整数r、d和r

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊