Edge irregular reflexive labeling for the disjoint union of gear graphs and prism graphs (Q1634474)

Summary: Given a graph \(G=(V,E)\), an edge naming is a mapping of an element of \(E\) to an arrangement of marks. In this case, the diagram is called an edge-marked graph. We consider an edge irregular reflexive \(k\)-labeling for the disjoint association of wheel-related diagrams and deduce the correct estimation of the reflexive edge strength for the disjoint association of \(m\) copies of some wheel-related graphs, specifically gear graphs and prism graphs.