K - Power-3 Heronian Mean Labeling of Graphs
Year: 2024
Type: article
Abstract: We describe a function as – Power 3. If constitute both the induced edge labelling and take be an injective function and express it as, then a graph's Heronian Mean Labelling with p nodes and q lines is or with distinct edge labels. In this manuscript we have proved the – Power -3 Mean labeling behaviour of Path, Twig Graph, Triangular ladder . We have also investigated - Super power -3 Heronian Mean labelling of graghs. Also, we prove that is not – Power - 3 Heronian Mean graph and - Super power -3 Heronian Mean labelling of Snake related graphs like triangular, alternative triangular and double triangular snake graphs.
Authors: Anitha H, Sowjanya S K, B Shanmukha, Karthik K R
Institution: P.E.S. College of Engineering, Mandya
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W6949472111
FWCI:
Cites:
Cited by:
Related to: