On (a, d)-SEAT labeling of forests of subdivided stars
| Autor: | Abdul Raheem, Muhammad Javaid, Roslan Hasni, A. Hussain, Muhammad Awais Umar |
|---|---|
| Rok vydání: | 2019 |
| Předmět: |
Physics
Algebra and Number Theory Applied Mathematics Magic (programming) 010103 numerical & computational mathematics 02 engineering and technology 01 natural sciences Graph Combinatorics Stars 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing 0101 mathematics Analysis |
| Zdroj: | Journal of Discrete Mathematical Sciences and Cryptography. 24:71-80 |
| ISSN: | 2169-0065 0972-0529 |
| Popis: | Graph ϒ = (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 total (EA... |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|