Log in

Relevant bibliographies by topics / Cover pebbling

Contents

Journal articles
Book chapters

Academic literature on the topic 'Cover pebbling'

Author: Grafiati

Published: 3 June 2025

Last updated: 31 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Cover pebbling.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Cover pebbling"

1

S, Sarah Surya, and Mathew Lian. "Secure Domination Cover Pebbling Number of Join of graphs." Indian Journal of Science and Technology 15, no. 27 (2022): 1344–48. https://doi.org/10.17485/IJST/v15i27.2145.

Full text

Abstract:

Abstract <strong>Objectives:</strong> To find the secure domination cover pebbling number for the join of two graphs G(p; q) and G ′ (p ′ ;q ′ ). <strong>Methods:</strong> We define Secure domination cover pebbling number, fsd p(G), of a graph G as the minimum number of pebbles that must be placed on V(G) such that, after a sequence of pebbling moves, the set of vertices with pebbles forms a secure dominating set for G. <strong>Findings:</strong> We found the secure domination cover pebbling number for the join of two graphs G(p; q) and Kn. Also, the

APA, Harvard, Vancouver, ISO, and other styles

2

Priscilla, Paul, and Syed Ali Fathima S. "A Study on Edge Pebbling Number, Covering Cover Edge Pebbling Number of Friendship Graphs, Odd Path and Even Path." Indian Journal of Science and Technology 16, no. 32 (2023): 2480–84. https://doi.org/10.17485/IJST/v16i32.674.

Full text

Abstract:

Abstract <strong>Objectives:</strong> To find the edge pebbling number and covering cover edge pebbling number of friendship graphs.<strong> Methods:</strong> The possible minimum edge covering set of the friendship graph is considered and the set with the minimum pebble requirement covering all vertices is selected. <strong>Findings:</strong> Obtained the modified result of edge pebbling number of friendship graph, defined the covering cover edge pebbling number of a graph G, and covering cover edge pebbling number for friendship graphs, odd path and even path is foun

APA, Harvard, Vancouver, ISO, and other styles

3

Lourdusamy, A., F. Joy Beaula, and F. Patrick. "Hub Cover Pebbling Number." Ars Combinatoria 160, no. 1 (2024): 31–35. http://dx.doi.org/10.61091/ars-160-05.

Full text

Abstract:

The hub cover pebbling number, h ∗ ( G ) , of a graph $G$, is the least non-negative integer such that from all distributions of h ∗ ( G ) pebbles over the vertices of G , it is possible to place at least one pebble each on every vertex of a set of vertices of a hub set for G using a sequence of pebbling move operations, each pebbling move operation removes two pebbles from a vertex and places one pebble on an adjacent vertex. Here we compute the hub cover pebbling number for wheel related graphs.

APA, Harvard, Vancouver, ISO, and other styles

4

Sarah Surya, S., and Lian Mathew. "Maximal matching cover pebbling number for variants of hypercube." Proyecciones (Antofagasta) 42, no. 4 (2023): 931–56. http://dx.doi.org/10.22199/issn.0717-6279-5608.

Full text

Abstract:

An edge pebbling move is defined as the removal of two pebbles from one edge and placing one on the adjacent edge. The maximal matching cover pebbling number, fmmcp(G), of a graph G, is the minimum number of pebbles that must be placed on E(G), such that after a sequence of pebbling moves the set of edges with pebbles forms a maximal matching regardless of the initial configuration. In this paper, we find the maximal matching cover pebbling number for variants of hypercube.

APA, Harvard, Vancouver, ISO, and other styles

5

Surya, S. Sarah, Lian Mathew, Jyothy Thomas, and Jeet Kurian Mattam. "SECURE VERTEX COVER PEBBLING NUMBER FOR FAMILIES OF TREE-DERIVED STRUCTURES." Advances and Applications in Discrete Mathematics 42, no. 2 (2024): 177–90. https://doi.org/10.17654/0974165825012.

Full text

Abstract:

The secure vertex cover pebbling number of a graph , is the smallest number that allows every distribution of pebbles to reach some secure vertex cover of by a sequence of pebbling moves. Trees are advantageous in biological science especially in systematics, bioinformatics and phylogenetics. In this paper, the secure vertex cover pebbling number for some tree-derived structures such as coconut tree, comb graph, Bistar graph, Banana tree and complete binary tree has been determined.

APA, Harvard, Vancouver, ISO, and other styles

6

Lourdusamy, A. "On Binary DCP Labeling." Journal of Combinatorial Mathematics and Combinatorial Computing 122, no. 1 (2024): 255–61. http://dx.doi.org/10.61091/jcmcc122-21.

Full text

Abstract:

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 ) , which is the minimum number of pebbles required such that any initial configuration of ψ ( G ) pebbles can be transformed through a number of pebbling moves so that the set of vertices with pebbles after the pebbling operation forms a dominating set of G . In this paper, we explore the relationship between two graph parameters, namely graph labeling and domination cover pebbling.

APA, Harvard, Vancouver, ISO, and other styles

7

Lourdusamy, A., S. Kither Iammal, and I. Dhivviyanandam. "Monophonic Cover Pebbling Number \((MCPN)\) of Network Graphs." Utilitas Mathematica 121, no. 1 (2024): 11–24. https://doi.org/10.61091/um121-02.

Full text

Abstract:

Given a connected graph \(G\) and a configuration \(D\) of pebbles on the vertices of \(G\), a pebbling transformation involves removing two pebbles from one vertex and placing one pebble on its adjacent vertex. A monophonic path is defined as a chordless path between two non-adjacent vertices \(u\) and \(v\). The monophonic cover pebbling number, \(\gamma_{\mu}(G)\), is the minimum number of pebbles required to ensure that, after a series of pebbling transformations using monophonic paths, all vertices of \(G\) are covered with at least one pebble each. In this paper, we determine the monopho

APA, Harvard, Vancouver, ISO, and other styles

8

Lourdusamy, A., and T. Mathivanan. "The covering cover pebbling number for some acyclic graphs." Utilitas Mathematica 122 (March 30, 2025): 41–52. https://doi.org/10.61091/um122-03.

Full text

Abstract:

The covering cover pebbling number, \(\sigma(G)\), of a graph \(G\), is the smallest number such that some distribution \(D \in \mathscr{K}\) is reachable from every distribution starting with \(\sigma(G)\) (or more) pebbles on \(G\), where \(\mathscr{K}\) is a set of covering distributions. In this paper, we determine the covering cover pebbling number for two families of graphs those do not contain any cycles.

APA, Harvard, Vancouver, ISO, and other styles

9

Crull, Betsy, Tammy Cundiff, Paul Feltman, et al. "The cover pebbling number of graphs." Discrete Mathematics 296, no. 1 (2005): 15–23. http://dx.doi.org/10.1016/j.disc.2005.03.009.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Surya, S. Sarah, and Lian Mathew. "Secure Domination Cover Pebbling Number of Join of graphs." Indian Journal Of Science And Technology 15, no. 27 (2022): 1344–48. http://dx.doi.org/10.17485/ijst/v15i27.2145.

Full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

Book chapters on the topic "Cover pebbling"

1

Lourdusamy, A., I. Dhivviyanandam, and Lian Mathew. "Non-split domination cover pebbling number for some class of middle graphs." In Mathematical Sciences and Applications. CRC Press, 2024. http://dx.doi.org/10.1201/9781003451808-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!