The forcing connected outer connected monophonic number of a graph

For a connected graph G = (V, E) of order at least two, a connected outer connected monophonic set S of G is an outer connected monophonic set such that the subgraph induced by S is connected. The minimum cardinality of a connected outer connected monophonic set of G is the connected outer connected...

Full description

Saved in:
Bibliographic Details
Main Authors: Ganesamoorthy, K., Priya, S. Lakshmi
Format: Conference Proceeding
Language:English
Subjects:
Graph theory
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:For a connected graph G = (V, E) of order at least two, a connected outer connected monophonic set S of G is an outer connected monophonic set such that the subgraph induced by S is connected. The minimum cardinality of a connected outer connected monophonic set of G is the connected outer connected monophonic number of G and is denoted by cmco(G). In this paper, we introduce the concepts of forcing connected outer connected monophonic subset and the forcing connected outer connected monophonic number fcom(G) of a graph G. Certain general properties satisfied by this parameter are studied. It is shown that for every pair a, b of integers with 0 aa + 3, there exists a connected graph G such that fcom(G) = a and cmco(G) = b.
ISSN:0094-243X
1551-7616
DOI:10.1063/5.0149065