The Forcing Monophonic Hull Number of a Graph
Journal Title: INTERNATIONAL JOURNAL OF MATHEMATICS TRENDS AND TECHNOLOGY - Year 2012, Vol 3, Issue 2
Abstract
For a connected graph G = (V, E), let a set M be a minimum monophonic hull set of G. A subset T M is called a forcing subset for M if M is the unique minimum monophonic hull set containing T. A forcing subset for M of minimum cardinality is a minimum forcing subset of M. The forcing monophonic hull number of M, denoted by fmh(M), is the cardinality of a minimum forcing subset of M. The forcing monophonic hull number of G, denoted by fmh(G), is fmh(G)=min{fmh(M)}, where the minimum is taken over all minimum monophonic hull sets in G. Some general properties satisfied by this concept are studied. The forcing monophonic hull numbers of certain classes of graphs are determined. It is shown that, for every pair a, b of integers with 0 ≤ a ≤ b and b ≥ 2, there exists a connected graph G such that fmh(G) = a and mh(G) = b.
Authors and Affiliations
J. John#1 , V. Mary Gleeta*2
Contra θgs-Continuous Functions
The aim of this paper is to introduce and study of a new generalization of contra continuity called contra gs-continuous functions utilizing gs-closed set.
Sequences of Special Dio - Triples
This paper concerns with the study of constructing sequences of special Dio-Triples (a,b,c) such that the product of any two elements of the set added with their sum and increased by a non-zero integer or a polynomial wi...
Securing Server System from Buffer Overflow vulnerability using Vel-Alagar Algorithm
Now a day’s buffer overflows have take place the most common target for network based attacks. The main proliferation method used by worms, malicious codes and improper coding by developers. Many techniques have be...
A Study on Quasi Class Q Operator
In this paper quasi class operator is introduced with example and compared with normaloid operator. Necessary and sufficient condition for a composition operator to be quasi class is given with an example. Also weighted...
Some Studies on Semirings
In this paper, we study the structures of Boolean Semirings and multiplicatively semirings. We proved that, Let S be a multiplicatively subidempotent semiring which contains multiplicative identity1 which is also additiv...