Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
On monophonic pebbling number
View through CrossRef
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 monophonic path is a longest chordless path between two non-adjacent vertices u and v. The line segment that connects two vertices on a curve is known as a chord. The monophonic distance between u and v is the number of vertices in the longest u–v monophonic path, denoted by dμ(u, v) in G. The monophonic pebbling number (MPN) of G is the least number of pebbles needed to guarantee that, from any distribution of pebbles on a graph G, one pebble can be moved to any specified vertex using monophonic paths through pebbling moves. The monophonic t-pebbling number (MtPN) of G is the least number of pebbles needed to guarantee that, from any distribution of pebbles, t pebbles can be moved to any specified vertex using monophonic paths. In this article, we determine the MPN and MtPN of Dutch windmill graphs, square of cycles, tadpole graphs, lollipop graphs, double star path graphs, and fuse graphs, and we also discuss their t-pebbling versions.
Title: On monophonic pebbling number
Description:
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 monophonic path is a longest chordless path between two non-adjacent vertices u and v.
The line segment that connects two vertices on a curve is known as a chord.
The monophonic distance between u and v is the number of vertices in the longest u–v monophonic path, denoted by dμ(u, v) in G.
The monophonic pebbling number (MPN) of G is the least number of pebbles needed to guarantee that, from any distribution of pebbles on a graph G, one pebble can be moved to any specified vertex using monophonic paths through pebbling moves.
The monophonic t-pebbling number (MtPN) of G is the least number of pebbles needed to guarantee that, from any distribution of pebbles, t pebbles can be moved to any specified vertex using monophonic paths.
In this article, we determine the MPN and MtPN of Dutch windmill graphs, square of cycles, tadpole graphs, lollipop graphs, double star path graphs, and fuse graphs, and we also discuss their t-pebbling versions.
Related Results
Pebbling on Crisscross Sequence of m Complete Graphs
Pebbling on Crisscross Sequence of m Complete Graphs
This paper investigates the pebbling number, the two pebbling property, the t-pebbling number, and the 2t-pebbling property of a crisscross sequence comprised of m complete graphs....
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 –...
Pebbling on zig-zag chain graph of n odd cycles
Pebbling on zig-zag chain graph of n odd cycles
Given a distribution of pebbles on the vertices of a connected graph G, a pebbling move on G consists of removing two pebbles from one vertex and placing one pebble on an adjacent ...
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...
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)...
On Binary DCP Labeling
On Binary DCP Labeling
A graph labeling is an assignment of integers to the vertices or edges or both, which satisfies certain conditions. The domination cover pebbling number of a graph G is ψ ( G ) ...