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 190
- Downloads 0
FIRST- ORDER STRONG DIFFERENTIAL SUBORDINATION AND SUPERORDINATION PROPERTIES FOR ANALYTIC FUNCTIONS ASSOCIATED WITH LINEAR OPERATOR
In the present paper we study of some properties first - order strong differential subordination and superordination for analytic functions associated with Ruscheweyh derivative operator which are obtained by considering...
TOPSIS Approach for Solving Bi-Level Non-Linear Fractional MODM Problems
TOPSIS (technique for order preference similarity to ideal solution) is considered one of the known classical multiple criteria decision making (MCDM) methods to solve bi-level non-linear fractional multi-objective decis...
On a fractional differemtial equation with Jumaries fractional derivative
By a counterexample, we prove that the results obtained in [1] are incorrect and there exist some theoretical mistakes in fractional complex transform.
Variations of Moisture Content in The Presence of Combined Flux
A model for diffusion in grains, through the drying process in the form of moisture removal, discussed through this work. While in drying, the moisture leaves the product as vapour or gas. This is achieved by impairing e...
Symbolic Analytical Expressions for the Solution of Hyperbolic form of Keplers Equation
In this paper, symbolic analytical expressions for the solution of hyperbolic form of Keplers equation will be established .Mathematical procedure for the expressions is also established to together wit...