Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Edge Monophonic Domination Number of Graphs
View through CrossRef
In this paper the concept of edge monophonic domination num-ber of a graph is introduced.A set of vertices D of a graph G is edge mono-phonic domination set (EMD set) if it is both edge monophonic set and adomination set of G.The edge monophonic domination number (EMD num- ber) of G, me(G) is the cardinality of a minimum EMD set. EMD number of some connected graphs are realized.Connected graphs of order n with EMD number n are characterised.It is shown that for any two integers p and q such that 2 p q there exist a connected graph G with m(G) = p and me(G) = q.Also there is a connected graph G such that (G) = p;me(G) = q and me(G) = p + q
Title: Edge Monophonic Domination Number of Graphs
Description:
In this paper the concept of edge monophonic domination num-ber of a graph is introduced.
A set of vertices D of a graph G is edge mono-phonic domination set (EMD set) if it is both edge monophonic set and adomination set of G.
The edge monophonic domination number (EMD num- ber) of G, me(G) is the cardinality of a minimum EMD set.
EMD number of some connected graphs are realized.
Connected graphs of order n with EMD number n are characterised.
It is shown that for any two integers p and q such that 2 p q there exist a connected graph G with m(G) = p and me(G) = q.
Also there is a connected graph G such that (G) = p;me(G) = q and me(G) = p + q.
Related Results
THE FORCING EDGE FIXING EDGE-TO-VERTEX MONOPHONIC NUMBER OF A GRAPH
THE FORCING EDGE FIXING EDGE-TO-VERTEX MONOPHONIC NUMBER OF A GRAPH
For a connected graph G = (V, E), a set Se ⊆ E(G)–{e} is called an edge fixing edge-to-vertex monophonic set of an edge e of a connected graph G if every vertex of G lies on an e –...
On the edge monophonic number of a graph
On the edge monophonic number of a graph
For a connected graph G = (V, E), an edge monophonic set of G is a set M?
V(G) such that every edge of G is contained in a monophonic path joining some
pair of vertices in M....
Domination of Polynomial with Application
Domination of Polynomial with Application
In this paper, .We .initiate the study of domination. polynomial , consider G=(V,E) be a simple, finite, and directed graph without. isolated. vertex .We present a study of the Ira...
On monophonic pebbling number
On monophonic pebbling number
Given a connected graph G and a configuration D of pebbles on V(G), a pebble move consists of removing two pebbles from one vertex and placing one pebble on an adjacent vertex. A m...
RESTRAINED DOUBLE MONOPHONIC NUMBER OF A GRAPH
RESTRAINED DOUBLE MONOPHONIC NUMBER OF A GRAPH
For a connected graph \(G\) of order at least two, a double monophonic set \(S\) of a graph \(G\) is a restrained double monophonic set if either \(S=V\) or the subgraph induced b...
Magic graphs
Magic graphs
DE LA TESIS<br/>Si un graf G admet un etiquetament super edge magic, aleshores G es diu que és un graf super edge màgic. La tesis està principalment enfocada a l'estudi del c...
Independent Set in Neutrosophic Graphs
Independent Set in Neutrosophic Graphs
New setting is introduced to study neutrosophic independent number and independent neutrosophic-number arising neighborhood of different vertices. Neighbor is a key term to have th...
Monophonic domination polynomial of the path graph
Monophonic domination polynomial of the path graph
Let $MD(G, i)$ be the family of monophonic dominating sets of a graph $G$ with cardinality $i$ and let $\md(G, i) = |MD(G, i)|$. Then the monophonic domination polynomial $MD(G, x)...