Preprint Article Version 1 Preserved in Portico This version is not peer-reviewed

Total Edge Irregularity Strength of Star Snake Graphs

Version 1 : Received: 4 November 2023 / Approved: 6 November 2023 / Online: 6 November 2023 (11:13:09 CET)

How to cite: Attiya, H.; Ahmed, N.; Salama, F. Total Edge Irregularity Strength of Star Snake Graphs. Preprints 2023, 2023110349. https://doi.org/10.20944/preprints202311.0349.v1 Attiya, H.; Ahmed, N.; Salama, F. Total Edge Irregularity Strength of Star Snake Graphs. Preprints 2023, 2023110349. https://doi.org/10.20944/preprints202311.0349.v1

Abstract

In different fields in our life, like physics, coding theory and computer science, graph labeling dramas an vital role and appears in many applications. A labeling of a graph is a map which assign each element in with a positive integer number. An edge irregular total -labeling is a function such that where and are weights for any two distinct edges. In this case, has total edge irregularity strength (TEIS) if is minimum. In our paper, we defined a new type of graphs called a triple star snake graph and star snake graph . Also, we investigated TEIS for a triple star snake graph . After that, we generalized the results for star snake graph .

Keywords

Edge labeling; Irregularity strength; Irregular labelling; Total edge irregularity strength; Star snake graph.

Subject

Computer Science and Mathematics, Mathematics

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.

Leave a public comment
Send a private comment to the author(s)
* All users must log in before leaving a comment
Views 0
Downloads 0
Comments 0
Metrics 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.