Edge Irregular Reflexive Labeling for the Disjoint Union of Gear Graphs and Prism Graphs
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 a...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2018-08-01
|
| Series: | Mathematics |
| Subjects: | |
| Online Access: | http://www.mdpi.com/2227-7390/6/9/142 |