Edge Irregular Reflexive Labeling for the Disjoint Union of Gear Graphs and Prism Graphs

Mathematics

Muhammad Ibrahim¹  SyedAhtsham ul Haq Bokhary¹  MuhammadKamran Siddiqui²  Xiujun Zhang³ 

[1] Centre for Advanced Studies in Pure and Applied Mathematics, Bahauddin Zakariya University, Multan 60800, Pakistan;Department of Mathematics, COMSATS University Islamabad, Sahiwal Campus, Sahiwal 57000, Pakistan;School of Information Science and Engineering, Chengdu University, Chengdu 610106, China;

关键词: edge irregular reflexive labeling;    reflexive edge strength;    gear graphs;    prism graphs;   

DOI  :  10.3390/math6090142

来源: DOAJ

【 摘 要 】

In graph theory, a graph is given names—generally a whole number—to edges, vertices, or both in a chart. Formally, given a graph G = ( V , E ), a vertex naming is a capacity from V to an arrangement of marks. A diagram with such a capacity characterized defined is known as a vertex-marked graph. Similarly, 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.

【 授权许可】

Unknown