The Upper Connected Monophonic Number and Forcing Connected Monophonic Number of a Graph
Journal Title: INTERNATIONAL JOURNAL OF MATHEMATICS TRENDS AND TECHNOLOGY - Year 2012, Vol 3, Issue 1
Abstract
— A connected monophonic set ࡹ in a connected graph ࡳ = (ࢂ,ࡱ) is called a minimal connected monophonic set if no proper subset of M is a connected monophonic set of ࡳ. The upper connected monophonic number mc + (G) is the maximum cardinality of a minimal connected monophonic set of G. Connected graphs of order p with upper connected monophonic number 2 and p are characterized. It is shown that for any positive integers 2 ≤ a < b ≤ c, there exists a connected graph G with m(G) =a, mc (G) = b and mc + (G) = c, where m(G) is the monophonic number and mc(G) is the connected monophonic number of a graph G. Let M be a minimum connected monophonic set of G. A subset T⊆ M is called a forcing subset for M if M is the unique minimum connected monophonic set containing T. A forcing subset for M of minimum cardinality is a minimum forcing subset of M. The forcing connected monophonic number of M, denoted by fmc(M), is the cardinality of a minimum forcing subset of M. The forcing connected monophonic number of G, denoted by fmc(G), is fmc(G) = min{fmc(M)}, where the minimum is taken over all minimum connected monophonic set M in G. It is shown that for every integers a and b with a < b, and ࢈−ࢇ− > 0, there exists a connected graph G such that, fmc(G) = a and mc (G) = b.
Authors and Affiliations
J. John#1 , P. Arul Paul Sudhahar
Keywords
Related Articles
- EP ID EP87284
- DOI -
- Views 123
- Downloads 0
Bootstrap Testing for Long Range Dependence
The presence of long-memory or long-range dependence (LRD) in a stochastic process has important consequences in statistical inferences. Lo develops a robust test for detecting the existence of LRD and derives its asympt...
Interval Valued Intuitionistic Fuzzy MAGDM Problems with OWA Entropy Weights
In this paper, the Multiple Attribute Group Decision Making (MAGDM) problems is based on the Renyi’s, Daroczy’s and R-norm entropy weights especially when the attribute weights are completely unknown. The interval-valued...
Equivalence Of Super Magic Labelings
Let G (V, E) be a graph with p vertices and q edges. A bijection f : V E {1,2,…., p+q} is called a super magic labeling of a graph G, if f(V) = {1, 2,…., p} and for any edge xyE, f(x)+f(y)+f(xy) = c(f), a const...
Anti Q-Fuzzy M-Subgroups Of Near Rings
In this paper, we introduce the notion of Q-fuzzification of M-subgroups in a near-ring and investigate some related properties. Characterization of Anti Q-fuzzy M- subgroups with respect to s-norm is given.
On Strongly Multiplicative Graphs
A graph G with p vertices and q edges is said to be strongly multiplicative if the vertices are assigned distinct numbers 1, 2, 3, …, p such that the labels induced on the edges by the product of the end vertices a...