Enhanced Effectiveness in Various Ladder Graphs Based on the F -Centroidal Meanness Criterion

A. Rajesh Kannan, S. Murali Krishnan, Karuppusamy Loganathan (), Nazek Alessa () and M. Hymavathi
Additional contact information
A. Rajesh Kannan: Department of Mathematics, Mepco Schlenk Engineering College, Sivakasi 626005, Tamil Nadu, India
S. Murali Krishnan: Department of Mathematics, Anna University Regional Campus, Madurai 625019, Tamil Nadu, India
Karuppusamy Loganathan: Department of Mathematics and Statistics, Manipal University Jaipur, Jaipur 303007, Rajasthan, India
Nazek Alessa: Department of Mathematical Sciences, College of Sciences, Princess Nourah Bint Abdulrahman University, P.O. Box 84428, Riyadh 11671, Saudi Arabia
M. Hymavathi: Department of Science and Humanities, MLR Institute of Technology, Hyderabad 500043, Telangana, India

Mathematics, 2023, vol. 11, issue 14, 1-10

Abstract: Graph labeling allows for the representation of additional attributes or properties associated with the vertices, edges, or both of graphs. This can provide a more comprehensive and detailed representation of the system being modeled, allowing for a richer analysis and interpretation of the graph. Graph labeling in ladder graphs has a wide range of applications in engineering, computer science, physics, biology, and other fields. It can be applied to various problem domains, such as image processing, wireless sensor networks, VLSI design, bioinformatics, social network analysis, transportation networks, and many others. The versatility of ladder graphs and the ability to apply graph labeling to them make them a powerful tool for modeling and analyzing diverse systems. If a function Υ is an injective vertex assignment in { 1 , 2 , … q + 1 } and the inductive edge assignment function Υ * in { 1 , 2 , … q } is expressed as a graph with q edges, defined as Υ * ( u v ) = 2 [ Υ ( u ) 2 + Υ ( u ) Υ ( v ) + Υ ( v ) 2 ] 3 [ Υ ( u ) + Υ ( v ) ] , then the function is referred to as F -centroidal mean labeling. This is known as the F -centroidal mean criterion. Here, we have determined the F -centroidal mean criteria of the graph ladder, slanting ladder, triangular ladder, T L n ∘ S m , S L n ∘ S m for m ≤ 2 , double-sided step ladder, D n * , and diamond ladder.

Keywords: labeling; F-centroidal mean labeling; F-centroidal mean graph (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/11/14/3205/pdf (application/pdf)
https://www.mdpi.com/2227-7390/11/14/3205/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:11:y:2023:i:14:p:3205-:d:1199340

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().