Skip to main content
SpringerLink
Log in

On the edge irregular reflexive labeling for some classes of plane graphs

  • Mathematical methods in data science
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

Graph labeling is an algorithm that assigns labels (usually positive integers) to the edges and/or vertices under certain condition(s). Suppose \(G=(V,E)\) is a network (graph), with V(G) representing the vertex set and E(G) representing the edge set. The labeling is known as vertex labeling (or edge labeling), depending on whether the mapping domain is the vertex set (or edge set). In the same way, the labeling is called "total labeling" when the domain is \(V(G)\cup E(G)\). In this article, we examine two types of eight-sided and four-faced or six-sided and four-faced planar maps that have an edge irregular reflexive k-labeling. Additionally, we find the precise value of the reflexive edge strength for these two classes.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

Availability of data and materials

Data sharing was not applicable to this article as no data sets were generated or analyzed during the current study.

References

  • Agustin IH, Utoyo I, Venkatachalam M (2020) Edge irregular reflexive labeling of some tree graphs. J Phys Conf Ser 1543(1):012008–012016

    Article  Google Scholar 

  • Ahmad A, Al-Mushayt OBS, Bača M (2014) On edge irregularity strength of graphs. Appl Math Comput 243:607–610

    MathSciNet  MATH  Google Scholar 

  • Ahmad A, Bača M, Siddiqui MK (2014) On edge irregular total labeling of categorical product of two cycles. Theory Comput Syst 54(1):1–12

    Article  MathSciNet  MATH  Google Scholar 

  • Aigner M, Triesch E (1990) Irregular assignments of trees and forests. SIAM J Discret Math 3(4):439–449

    Article  MathSciNet  MATH  Google Scholar 

  • Amar D, Togni O (1998) Irregularity strength of trees. Discret Math 190(1–3):15–38

    Article  MathSciNet  MATH  Google Scholar 

  • Bača M, Siddiqui MK (2017) On total edge irregularity strength of strong product of two cycles. Util Math 104:255–275

    MathSciNet  MATH  Google Scholar 

  • Bača M, Jendroľ S, Miller M, Ryan J (2007) On irregular total labellings. Discret Math 307:1378–1388

    Article  MathSciNet  MATH  Google Scholar 

  • Bača M, Irfan M, Ryan J, Semaničovǎ-Feňovčíkovǎ A, Tanna D (2017) On edge irregular reflexive labellings for the generalized friendship graphs. Mathematics 5(4):67–77

    Article  MATH  Google Scholar 

  • Bača M, Irfan M, Ryan J, Semaničovǎ-Feňovčíkovǎ A, Tanna D (2019) Note on edge irregular reflexive labelings of graphs. AKCE Int J Graph Comb 16(2):145–157

    Article  MathSciNet  MATH  Google Scholar 

  • Basher M (2021) On the reflexive edge strength of the circulant graphs. AIMS Math 6(9):9342–9365

    Article  MathSciNet  MATH  Google Scholar 

  • Basher M (2021) Edge irregular reflexive labeling for the \( r \)-th power of the path. AIMS Math 6(10):10405–10430

    Article  MathSciNet  MATH  Google Scholar 

  • Basher M (2022) The reflexive edge strength of toroidal fullerene, AKCE International Journal of Graphs and Combinatorics, https://doi.org/0.1080/09728600.2022.2150587

  • Chartrand G, Jacobson MS, Lehel J, Oellermann OR, Ruiz S, Saba F (1988) Irregular networks. Congr Numer 64:197–210

    MathSciNet  MATH  Google Scholar 

  • Chunling T, Xiaohui L, Yuansheng Y, Liping W (2009) Irregular total labellings of some families of graphs. Indian J Pure Appl Math 40(3):155–181

    MathSciNet  MATH  Google Scholar 

  • Gallian JA (2018) A dynamic survey of graph labeling. Electr J Combin 1:DS6

    MathSciNet  MATH  Google Scholar 

  • Guirao JL, Ahmad S, Siddiqui MK, Ibrahim M (2018) Edge irregular reflexive labeling for disjoint union of generalized petersen graph. Mathematics 6(12):304–313

    Article  MATH  Google Scholar 

  • Ibrahim M, Majeed S, Siddiqui MK (2020) Edge irregular reflexive labeling for star, double star and caterpillar graphs. TWMS J Appl Eng Math 10(3):718–726

    Google Scholar 

  • Indriati D, Rosyida I (2020) Edge irregular reflexive labeling on Corona of path and other graphs. J Phys Conf Ser 1489(1):012004–012010

    Article  Google Scholar 

  • Ivančo J, Jendroľ S (2006) Total edge irregularity strength of trees. Discuss Math Graph Theory 26(3):449–456

    Article  MathSciNet  MATH  Google Scholar 

  • Ke Y, Khan MJA, Ibrahim M, Siddiqui MK (2021) On edge irregular reflexive labeling for Cartesian product of two graphs. Eur Phy J Plus 136(1):1–13

    Google Scholar 

  • Khan MJA, Ibrahim M, Ahmad A (2021) On edge irregular reflexive labeling of categorical product of two paths. Comput Syst Sc Eng 36(3):485–492

    Article  Google Scholar 

  • Krishnaa A (2006) Some applications of labelled graphs. Int J Math Trends Technol 37(3):19–23

    MathSciNet  Google Scholar 

  • Lahel J (1991) Facts and quests on degree irregular assignment. In: Graph theory, combinatorics and applications, Wiley New York, NY, USA, pp 765–782

  • Miller M, Pérez-Rosés H, Ryan J (2012) The bounded degree/diameter maximum subgraph problem in the mesh. Discret Appl Math 160(12):1782–1790

    Article  MATH  Google Scholar 

  • Nierhoff T (2000) A tight bound on the irregularity strength of graphs. SIAM J Discret Math 13(3):313–323

    Article  MathSciNet  MATH  Google Scholar 

  • Prasanna NL, Sravanthi K, Sudhakar N (2014) Applications of graph labeling in major areas of computer science. Int J Res Comput Commun Technol 3:1–5

  • Prasanna NL, Sravanthi K, Sudhakar N (2014) Applications of graph labeling in communication networks. Orient J Comput Sci Technol 7(1):139–145

    Google Scholar 

  • Rahmawati NA, Indriati D (2021) Edge irregular reflexive labeling on umbrella graphs \(U_{3, n}\) and \(U_{4, n}\). AIP Conf Proc 2326(1):020021–020025

    Article  Google Scholar 

  • Ryan J, Munasinghe B, Tanna D (2017) Reflexive irregular labelings, preprint

  • Stojmenovic I (1997) Honeycomb networks: topological properties and communication algorithms. Trans Parallel Distrib Syst 8(10):1036–1042

    Article  Google Scholar 

  • Tanna D, Ryan J, Semaničovǎ-Feňovčíkovǎ A (2017) A reflexive edge irregular labelings of prisms and wheels. Aust J Combin 69:394–401

    MATH  Google Scholar 

  • Vinutha MS, Arathi P (2017) Applications of graph coloring and labeling in computer science. Int J Future Revol Comput Sci Commun Eng 3:14–15

    Google Scholar 

  • Zhang X, Ibrahim M, Siddiqui MK (2018) Edge irregular reflexive labeling for the disjoint union of gear graphs and prism graphs. Mathematics 6(9):142–151

    Article  MATH  Google Scholar 

Download references

Funding

No funding was received.

Author information

Authors and Affiliations

  1. Department of Mathematics, College of Science and Arts in Unaizah, Qassim University, Qassim, Saudi Arabia

    M. Basher

  2. Department of Mathematics and Computer Science, Faculty of Science, Suez University, Suez, Egypt

    M. Basher

Authors
  1. M. Basher
    View author publications

    You can also search for this author in PubMed Google Scholar

Contributions

MB carried out all theorems and proofs and drafted the manuscript by himself without any participation.

Corresponding author

Correspondence to M. Basher.

Ethics declarations

Conflict of interest

The author declares that he has no competing interests.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Basher, M. On the edge irregular reflexive labeling for some classes of plane graphs. Soft Comput 27, 7789–7799 (2023). https://doi.org/10.1007/s00500-023-07973-9

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-023-07973-9

Keywords

Search

Navigation