TOTAL RESTRAINED EDGE MONOPHONIC DOMINATION NUMBER M OF A GRAPH

SUDHAHAR, P. ARUL PAUL and FLOWER, M. LITTLE and MERLY, E. EBIN RAJA (2018) TOTAL RESTRAINED EDGE MONOPHONIC DOMINATION NUMBER M OF A GRAPH. Asian Journal of Mathematics and Computer Research, 23 (4). pp. 201-206.

Full text not available from this repository.

Abstract

In this paper the concept of total restrained edge monophonic domination number M of a graph G is introduced. For a connected graph G = (V,E) of order at least two, a total restrained edge monophonic dominating set M of a graph G is a restrained edge monophonic dominating set M such that the subgraph induced by M has no isolated vertices. A total restrained edge monophonic dominating set of cardinality is called a - set of G . It is shown that if pand k are positive integers such that 3≤ k ≤ p there exists a connected graph G of order P such that = k . Also For any positive integers 3 < a < b < c < d , there exists a connected graph G such that me(G) = a, , and = d.

Item Type: Article
Subjects: Open Research Librarians > Mathematical Science
Depositing User: Unnamed user with email support@open.researchlibrarians.com
Date Deposited: 12 Dec 2023 04:38
Last Modified: 12 Dec 2023 04:38
URI: http://stm.e4journal.com/id/eprint/2293

Actions (login required)

View Item
View Item