Edge irregular reflexive labeling for the disjoint union of gear graphs and prism graphs (Q1634474)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Edge irregular reflexive labeling for the disjoint union of gear graphs and prism graphs |
scientific article; zbMATH DE number 6994706
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Edge irregular reflexive labeling for the disjoint union of gear graphs and prism graphs |
scientific article; zbMATH DE number 6994706 |
Statements
Edge irregular reflexive labeling for the disjoint union of gear graphs and prism graphs (English)
0 references
18 December 2018
0 references
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.
0 references
edge irregular reflexive labeling
0 references
reflexive edge strength
0 references
gear graphs
0 references
prism graphs
0 references
