Odd mean labeling for two star graph
In this paper further result on odd mean labeling is discussed. We prove that the two star G = K1,m ∧ K1,n is an odd mean graph if and only if |m − n| ≤ 3. The condition for a graph to be odd mean is that p ≤ q + 1, where p and q stands for the number of the vertices and edges in the graph respectiv...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Sciendo
2017-06-01
|
| Series: | Applied Mathematics and Nonlinear Sciences |
| Subjects: | |
| Online Access: | https://doi.org/10.21042/AMNS.2017.1.00016 |