Reverse vertex magic labeling of complete graphs
Autor: | K.J Sarmasmieee, Md. Shakeel, Shaik Sharief Basha |
---|---|
Rok vydání: | 2016 |
Předmět: |
Discrete mathematics
Vertex (graph theory) Magic square Astrophysics::High Energy Astrophysical Phenomena Edge-graceful labeling Magic (programming) Graph Combinatorics Factorization Physics::Atomic and Molecular Clusters Bijection Pharmacology (medical) Pharmacology Toxicology and Pharmaceutics (miscellaneous) Mathematics |
Zdroj: | Research Journal of Pharmacy and Technology. 9:1710 |
ISSN: | 0974-360X 0974-3618 |
DOI: | 10.5958/0974-360x.2016.00345.0 |
Popis: | A reverse vertex magic labeling of a graph G = (V,E) is a bijection such that for every vertex , is a constant . It is well known that all complete graphs Kn admit a reverse magic labeling. In this paper, we present a new proof of this theorem using the concepts of twin factorization and magic square. |
Databáze: | OpenAIRE |
Externí odkaz: |