
Adjacency energy of pebbling graphs
Author(s) -
Sakunthala Srinivasan,
Vimala Shanmugavel
Publication year - 2021
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1850/1/012089
Subject(s) - pebble , vertex (graph theory) , adjacency list , combinatorics , simple (philosophy) , mathematics , undirected graph , transformation (genetics) , energy (signal processing) , graph , discrete mathematics , computer science , chemistry , biology , philosophy , biochemistry , statistics , epistemology , gene , paleontology
This research paper presents the idea of energy for pebbling graphs. Pebbling is transportation of two pebbles from one vertex (place) to another vertex (place). During transformation, one pebble is lost as toll and only one pebble reaches the end. The lower bounds and upper bounds of energy levels were investigated for various types of simple and undirected graphs through pebbling concept.