IDEAS home Printed from https://ideas.repec.org/a/hin/jjmath/2635564.html
   My bibliography  Save this article

Assignment Computations Based on Cexp Average in Various Ladder Graphs

Author

Listed:
  • A.Rajesh Kannan
  • P. Manivannan
  • K. Loganathan
  • K. Prabu
  • Sonam Gyeltshen
  • M. T. Rahim

Abstract

This study introduces the Cexp average assignments and investigates its properties using various ladder graphs. The ladder graphs can be found in every communication networks. Ladder networks are increasingly being used in everyday life for monitoring and environmental applications such as domestic, military, surveillance, industrial, medical applications, and traffic management. These datasets are afflicted by the average representation of the graph structure. It aids in the visualisation and comprehension of data analysis. The Cexp labeling is used in sensor networks, adhoc networks, and other applications. It also efficiently creates a communication network after using noise reduction methods to remove salt and pepper noise.

Suggested Citation

  • A.Rajesh Kannan & P. Manivannan & K. Loganathan & K. Prabu & Sonam Gyeltshen & M. T. Rahim, 2022. "Assignment Computations Based on Cexp Average in Various Ladder Graphs," Journal of Mathematics, Hindawi, vol. 2022, pages 1-8, May.
    • Handle: RePEc:hin:jjmath:2635564
    DOI: 10.1155/2022/2635564
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/jmath/2022/2635564.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/jmath/2022/2635564.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2022/2635564?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. A. Rajesh Kannan & S. Murali Krishnan & Karuppusamy Loganathan & Nazek Alessa & M. Hymavathi, 2023. "Enhanced Effectiveness in Various Ladder Graphs Based on the F -Centroidal Meanness Criterion," Mathematics, MDPI, vol. 11(14), pages 1-10, July.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:jjmath:2635564. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.