Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Pebbling on Crisscross Sequence of m Complete Graphs
View through CrossRef
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. By analyzing these pebbling properties, we aim to gain insights into the efficiency and feasibility of pebbling operations within this specific graph structure.
Title: Pebbling on Crisscross Sequence of m Complete Graphs
Description:
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.
By analyzing these pebbling properties, we aim to gain insights into the efficiency and feasibility of pebbling operations within this specific graph structure.
Related Results
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...
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 ...
Weakly Modular Graphs and Nonpositive Curvature
Weakly Modular Graphs and Nonpositive Curvature
This article investigates structural, geometrical, and topological characterizations and properties of weakly modular graphs and of cell complexes derived from them. The unifying t...
Independent Set in Neutrosophic Graphs
Independent Set in Neutrosophic Graphs
New setting is introduced to study neutrosophic independent number and independent neutrosophic-number arising neighborhood of different vertices. Neighbor is a key term to have th...
Failed Independent Number in Neutrosophic Graphs
Failed Independent Number in Neutrosophic Graphs
New setting is introduced to study neutrosophic failed-independent number and failed independent neutrosophic-number arising neighborhood of different vertices. Neighbor is a key t...
Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage
Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage
Abstract
Chordal graphs are characterized as the intersection graphs of subtrees in a tree and such a representation is known as the tree model. Restricting the characteriz...
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 ) ...
Computing the Energy of Certain Graphs based on Vertex Status
Computing the Energy of Certain Graphs based on Vertex Status
Background:
The concept of Hückel molecular orbital theory is used to compute the graph energy numerically and graphically on the base of the status of a vertex.
Objective:
Our a...