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

On the (M,D) number of a graph

For a connected graph G = (V, E), a monophonic set of G is a set M ⊆ V (G) such that every vertex of G is contained in a monophonic path joining some pair of vertices in M. A subse...

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 Roman domination of a graph

For a graph G = (V, E), a restrained double Roman dominating function is a function f : V → {0, 1, 2, 3} having the property that if f(v) = 0, then the vertex v must have at least ...

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

The Monophonic Metric Dimension of Degree Splitting Graph

Let be a simple graph and be an ordered set and. The representation of with respect to is the -tuple . Then is called a monophonic resolving set if different vertices of hav...

Graph convolutional neural networks for 3D data analysis

(English) Deep Learning allows the extraction of complex features directly from raw input data, eliminating the need for hand-crafted features from the classical Machine Learning p...

Email:
Password:

Email:

RESTRAINED DOUBLE MONOPHONIC NUMBER OF A GRAPH

Related Results