On (a, d)-SEAT labeling of forests of subdivided stars
2019
AbstractGraph ϒ = (V(ϒ), E(ϒ)) contain finite nodes V(ϒ) and finite edges E(ϒ). We also represent the order of the graph and size as μ = |V(ϒ)| and v = |V(ϒ)|. A graph is called (a, d)-edge magic t...
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
3
References
0
Citations
NaN
KQI