The Total Open Monophonic Number of a Graph
Journal Title: JOURNAL OF ADVANCES IN MATHEMATICS - Year 2014, Vol 9, Issue 3
Abstract
For a connected graph G of order n >- 2, a subset S of vertices of G is a monophonic set of G if each vertex v in G lies on a x-y monophonic path for some elements x and y in S. The minimum cardinality of a monophonic set of G is defined as the monophonic number of G, denoted by m(G). A monophonic set of cardinality m(G) is called a m-set of G. A set S of vertices of a connected graph G is an open monophonic set of G if for each vertex v in G, either v is an extreme vertex of G and v ˆˆ? S, or v is an internal vertex of a x-y monophonic path for some x, y ˆˆ? S. An open monophonic set of minimum cardinality is a minimum open monophonic set and this cardinality is the open monophonic number, om(G). A connected open monophonic set of G is an open monophonic set S such that the subgraph < S > induced by S is connected. The minimum cardinality of a connected open monophonic set of G is the connected open monophonic number of G and is denoted by omc(G). A total open monophonic set of a graph G is an open monophonic set S such that the subgraph < S > induced by S contains no isolated vertices. The minimum cardinality of a total open monophonic set of G is the total open monophonic number of G and is denoted by omt(G). A total open monophonic set of cardinality omt(G) is called a omt-set of G. The total open monophonic numbers of certain standard graphs are determined. Graphs with total open monphonic number 2 are characterized. It is proved that if G is a connected graph such that omt(G) = 3 (or omc(G) = 3), then G = K3 or G contains exactly two extreme vertices. It is proved that for any integer n 3, there exists a connected graph G of order n such that om(G) = 2, omt(G) = omc(G) = 3. It is proved that for positive integers r, d and k 4 with 2r, there exists a connected graph of radius r, diameter d and total open monophonic number k. It is proved that for positive integers a, b, n with 4 <_ a<_ b <_n, there exists a connected graph G of order n such that omt(G) = a and omc(G) = b.
Authors and Affiliations
A. P. Santhakumaran, M. Mahendran
Keywords
Related Articles
- EP ID EP651363
- DOI 10.24297/jam.v9i3.2424
- Views 160
- Downloads 0
Fuzzy Soft Connected Sets in Fuzzy Soft Topological Spaces
In this paper we introduce some types of fuzzy soft separated sets and study some of thier preperties. Next, the notion of connectedness in fuzzy topological spaces due to Ming and Ming, Zheng etc., extended to fuzzy sof...
Rational Chebyshev functions with new collocation points in semi-infinite domains for solving higher-order linear ordinary differential equations
The purpose of this paper is to investigate the use of rational Chebyshev (RC) functions for solving higher-order linear ordinary differential equations with variable coefficients on a semi-infinite domain using new rati...
A new Characterization of some distributions Based on the r th conditional moment of doubly truncated mean function
New characterizations of doubly truncated exponential and geometric distributions are presented by using the s th conditional expectation in terms of their failure rate and reversed failure rate. These results may serve...
A new analytical modelling for fractional telegraph equation via Elzaki transform
The main aim of this paper is to propose a new and simple algorithm for space-fractional telegraph equation, namely new fractional homotopy analysis transform method (FHATM). The fractional homotopy analysis transform...
Natural Gas
The discovery of natural gas played very important role in economy. It effected the urbanization of different countries and changed the economic status in the world. The discovery of natural gas led to higher immig...