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

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

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

Monophonic Polynomial of the cartesian product of some graphs

Let be the family of monophonic sets of a graph with cardinality and let Then the monophonic polynomial of is defined as , where is the monophonic number of . In this paper w...

Bilangan Terhubung Titik Pelangi pada Graf Garis dan Graf Tengah dari Hasil Operasi Comb Graf Bintang C<sub>3</sub> dan Graf Bintang S<sub>n</sub>

Penelitian ini bertujuan menentukan bilangan terhubung titik pelangi (rainbow vertex connection number) pada graf garis dan graf tengah yang diperoleh dari hasil operasi comb antar...

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

Email:
Password:

Email:

RESTRAINED DOUBLE MONOPHONIC NUMBER OF A GRAPH

Related Results