Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
The Monophonic Metric Dimension of Degree Splitting Graph
View through CrossRef
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 have different representations with respect to . A monophonic resolving set of minimum number of elements is called a minimum monophonic set for and its cardinality is known as the monophonic metric dimension of , represented by In this article, we determined the monophonic metric dimension of degree splitting graph.
Science Research Society
Title: The Monophonic Metric Dimension of Degree Splitting Graph
Description:
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 have different representations with respect to .
A monophonic resolving set of minimum number of elements is called a minimum monophonic set for and its cardinality is known as the monophonic metric dimension of , represented by In this article, we determined the monophonic metric dimension of degree splitting graph.
Related Results
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....
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 –...
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...
On the (M,D) number of a graph
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
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...
Central Metric Dimension of Rooted Product Graph
Central Metric Dimension of Rooted Product Graph
The Central metric dimension is a type of metric dimension on graph. Some special graphs for which the central metric dimension have been found include path graph, cycle graph, com...
Dimensi Metrik Kuat Lokal Graf Hasil Operasi Kali Kartesian
Dimensi Metrik Kuat Lokal Graf Hasil Operasi Kali Kartesian
The strong local metric dimension is the development result of a strong metric dimension study, one of the study topics in graph theory. Some of graphs that have been discovered ab...
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)...