Deficiency of forests
Artificial intelligence
comb
0102 computer and information sciences
Graph Labeling
2-sided generalized comb
Quantum mechanics
01 natural sciences
Graph
MAGIC (telescope)
Optical Code Division Multiple Access
Antimagic Labeling
super edge magic total labeling
Engineering
Number theory
QA1-939
FOS: Electrical engineering, electronic engineering, information engineering
FOS: Mathematics
05c78
Conjecture
Electrical and Electronic Engineering
0101 mathematics
Graph Labeling and Dimension Problems
forests
Physics
Edge Coloring
Total Edge Irregularity
Discrete mathematics
15. Life on land
bistar
Computer science
Programming language
Enhanced Data Rates for GSM Evolution
Computational Theory and Mathematics
Combinatorics
deficiency of graph
Computer Science
Physical Sciences
Integer (computer science)
Mathematics
DOI:
10.1515/math-2017-0122
Publication Date:
2017-12-13T08:00:49Z
AUTHORS (6)
ABSTRACT
Abstract An edge-magic total labeling of an ( n , m )-graph G = V E ) is a one to map λ from ∪ onto the integers {1,2,…, + } with property that there exists integer constant c such x y xy for any ∈ ). It called super if )) }. Furthermore, has no labeling, then minimum number vertices added have deficiency graph denoted by μ s [4]. If do not exist, will be ∞. In this paper we study and forests comprising combs, 2-sided generalized combs bistar. The evidence provided these facts supports conjecture proposed Figueroa-Centeno, Ichishima Muntaner-Bartle [2].
SUPPLEMENTAL MATERIAL
Coming soon ....
REFERENCES (20)
CITATIONS (2)
EXTERNAL LINKS
PlumX Metrics
RECOMMENDATIONS
FAIR ASSESSMENT
Coming soon ....
JUPYTER LAB
Coming soon ....