Javascript must be enabled to continue!

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 by $V-S$ has no isolated vertices. The minimum cardinality of a restrained double monophonic set of $G$ is the restrained double monophonic number of $G$ and is denoted by $dm_{r}(G)$. The restrained double monophonic number of certain classes graphs are determined. It is shown that for any integers $a,\, b,\, c$ with $3 \leq a \leq b \leq c$, there is a connected graph $G$ with $m(G) = a$, $m_r(G) = b$ and $dm_{r}(G) = c$, where $m(G)$ is the monophonic number and $m_r(G)$ is the restrained monophonic number of a graph $G$.

Ural Federal University

A.P. Santhakumaran K. Ganesamoorthy

Ural Mathematical Journal

2019

Title: RESTRAINED DOUBLE MONOPHONIC NUMBER OF A GRAPH

Description:

The minimum cardinality of a restrained double monophonic set of $G$ is the restrained double monophonic number of $G$ and is denoted by $dm_{r}(G)$.

The restrained double monophonic number of certain classes graphs are determined.

It is shown that for any integers $a,\, b,\, c$ with $3 \leq a \leq b \leq c$, there is a connected graph $G$ with $m(G) = a$, $m_r(G) = b$ and $dm_{r}(G) = c$, where $m(G)$ is the monophonic number and $m_r(G)$ is the restrained monophonic number of a graph $G$.

Back

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....

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 –...

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)...

Bootstrapping a Biodiversity Knowledge Graph

The "biodiversity knowledge graph" is a nice metaphor for connecting biodiversity data sources, but can we actually build it? Do we have sufficient linked data available? Given tha...

Edge Monophonic Domination Number of Graphs

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...

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...

Abstract 902: Explainable AI: Graph machine learning for response prediction and biomarker discovery

Abstract Accurately predicting drug sensitivity and understanding what is driving it are major challenges in drug discovery. Graphs are a natural framework for captu...

E-Cordial Labeling of Some Families of Graphs

An E-cordial labeling σ: E →{0,1} induces σ∗: V →{0,1} on graph G=(V,E), where (σ(v)=(∑_(u∈V)▒〖σ(uv)〗) mod 2 is taken over all edges uv∈E, and the labelling satisfies the condition...

Email:
Password:

Email:

RESTRAINED DOUBLE MONOPHONIC NUMBER OF A GRAPH

Related Results